Makespan minimization in machine dominated flowshop

Abstract In a flowshop scheduling problem, a set of jobs is processed by a set of machines. The jobs follow the same sequence in all machines. We study the flowshop scheduling problem under a new case of machine dominance that is often found in the manufacturing of computers and electronic devices. We provide a formula for makespan value for a given sequence, show that the makespan value depends only on certain jobs in the sequence, and present an algorithm that finds a sequence with minimum makespan. Numerical examples of the solution approaches are provided.

[1]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[2]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[3]  Ji-Bo Wang.  Erratum to: A note on flow shop scheduling problems with a learning effect on no-idle dominant machines [Appl. Math. Computation 184 (2007) 945-949] , 2008, Appl. Math. Comput..

[4]  Jatinder N. D. Gupta,et al.  Flowshop scheduling with dominant machines , 1995, Comput. Oper. Res..

[5]  Milan Vlach,et al.  Nonpreemptive flowshop scheduling with machine dominance , 1998, Eur. J. Oper. Res..

[6]  J.-B. Wang,et al.  Flow shop scheduling problems with deteriorating jobs under dominating machines , 2006, J. Oper. Res. Soc..

[7]  Ji-Bo Wang,et al.  Flow shop scheduling with deteriorating jobs under dominating machines , 2006 .

[8]  Bo Jiang,et al.  Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time , 2006, Appl. Math. Comput..

[9]  Shijie Sun,et al.  A note on flow shop scheduling problems with a learning effect on no-idle dominant machines , 2007, Appl. Math. Comput..

[10]  Cheng Wu,et al.  Makespan distribution of permutation flowshop schedules , 2008, J. Sched..

[11]  Z. Xia,et al.  No-wait or no-idle permutation flowshop scheduling with dominating machines , 2005 .

[12]  Ji-Bo Wang,et al.  Flow shop scheduling problems with decreasing linear deterioration under dominant machines , 2007, Comput. Oper. Res..

[13]  A. Nouweland,et al.  Flow-shops with a dominant machine , 1992 .

[14]  T. Cheng,et al.  Solvable cases of permutation flowshop scheduling with dominating machines , 2000 .