Some results of the worst-case analysis for flow shop scheduling with a learning effect

We consider flow shop scheduling problems with a learning effect. In this model the processing times of jobs are defined as functions of their positions in a permutation. The objective is to minimize one of the three regular performance criteria, namely, the total weighted completion time, the discounted total weighted completion time, and the sum of the quadratic job completion times. We present algorithms by using the optimal permutations for the corresponding single machine scheduling problems. We also analyze the worst-case bound of our algorithms.

[1]  Dirk Biskup,et al.  Single-machine scheduling with learning considerations , 1999, Eur. J. Oper. Res..

[2]  Adam Janiak,et al.  Scheduling jobs with position-dependent processing times , 2004, J. Oper. Res. Soc..

[3]  Guoqing Wang,et al.  Single Machine Scheduling with Learning Effect Considerations , 2000, Ann. Oper. Res..

[4]  Gur Mosheiov,et al.  Scheduling with general job-dependent learning curves , 2003, Eur. J. Oper. Res..

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

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

[7]  Chin-Chia Wu,et al.  Minimizing total completion time in a two-machine flowshop with a learning effect , 2004 .

[8]  Teofilo F. Gonzalez,et al.  Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..

[9]  Ji-Bo Wang,et al.  Flow shop scheduling jobs with position-dependent processing times , 2005 .

[10]  Gur Mosheiov,et al.  Note on scheduling with general learning curves to minimize the number of tardy jobs , 2005, J. Oper. Res. Soc..

[11]  T. P. Wright,et al.  Factors affecting the cost of airplanes , 1936 .

[12]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[13]  Gur Mosheiov,et al.  Scheduling problems with a learning effect , 2001, Eur. J. Oper. Res..

[14]  Dar-Li Yang,et al.  Single-machine group scheduling with a time-dependent learning effect , 2006, Comput. Oper. Res..

[15]  Adedeji Badiru,et al.  Computational survey of univariate and multivariate learning curve models , 1992 .

[16]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[17]  J.-B. Wang,et al.  Flow-shop scheduling with a learning effect , 2005, J. Oper. Res. Soc..

[18]  W. Townsend.  The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution , 1978 .

[19]  Czeslaw Smutnicki,et al.  Some results of the worst-case analysis for flow shop scheduling , 1998, Eur. J. Oper. Res..

[20]  Gur Mosheiov,et al.  Parallel machine scheduling with a learning effect , 2001, J. Oper. Res. Soc..

[21]  George J. Kyparisis,et al.  Algorithms with performance guarantees for flow shops with regular objective functions , 2005 .