Subscribe Now Subscribe Today
Science Alert
 
Blue
   
Curve Top
Journal of Applied Sciences
  Year: 2008 | Volume: 8 | Issue: 12 | Page No.: 2217-2225
DOI: 10.3923/jas.2008.2217.2225
 
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Two-Machine Flexible Flow-Shop Scheduling with Setup Times

Ming- Cheng Lo, Jen- Shiang Chen and Yong- Fu Chang

Abstract:
This investigation studies two-machine flow-shop scheduling problems in which both machines are versatile and setup time is considered. First, a modified branch and bound algorithm for determining the optimal schedule is developed to minimize the makespan of jobs for these problems. Second, a genetic algorithm is used to rapidly find near-optimal schedules for large scale problems. Finally, computational experiments are performed to illustrate the effectiveness and efficiency of the proposed algorithms.
PDF Fulltext XML References Citation Report Citation
How to cite this article:

Ming- Cheng Lo, Jen- Shiang Chen and Yong- Fu Chang, 2008. Two-Machine Flexible Flow-Shop Scheduling with Setup Times. Journal of Applied Sciences, 8: 2217-2225.

DOI: 10.3923/jas.2008.2217.2225

URL: https://scialert.net/abstract/?doi=jas.2008.2217.2225

COMMENT ON THIS PAPER
 
 
 

 

 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 

Curve Bottom