Single-machine scheduling with learning functions

In this study we consider the single-machine scheduling problems with a sum of-processing-times-based learning effect. The sum of-processing-times-based learning effect of a job is assumed to be a function of the sum of the normal processing time of the already processed jobs. The objective is to minimize one of two regular objective functions, namely the weighted sum of completion times and the maximum lateness. We use the weighted shortest processing time (WSPT) rule and the earliest due date (EDD) rule as heuristics for the general cases and analyze their worst-case error bounds. We also provide computational results to evaluate the performance of the heuristics.

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

[2]  Ji-Bo Wang,et al.  Learning effect and deteriorating jobs in the single machine scheduling problems , 2009 .

[3]  Ji-Bo Wang,et al.  A due-date assignment problem with learning effect and deteriorating jobs , 2010 .

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

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

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

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

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

[9]  Pradeep Chintagunta.  Measuring the effects of new brand introduction on inter-brand strategic interaction , 1999, Eur. J. Oper. Res..

[10]  Dirk Biskup,et al.  A state-of-the-art review on scheduling with learning effects , 2008, Eur. J. Oper. Res..

[11]  Dar-Li Yang,et al.  Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect , 2006, Eur. J. Oper. Res..

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

[13]  G. Wang,et al.  Single-machine scheduling with past-sequence-dependent setup times and effects of deterioration and learning , 2009 .

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

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

[16]  Dirk Simons,et al.  Common due date scheduling with autonomous and induced learning , 2004, Eur. J. Oper. Res..

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

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

[19]  Ji-Bo Wang,et al.  Single-machine scheduling with general learning functions , 2008, Comput. Math. Appl..

[20]  Christos Koulamas,et al.  Single-machine and two-machine flowshop scheduling with general learning functions , 2007, Eur. J. Oper. Res..

[21]  Wen-Chiung Lee,et al.  A note on single-machine group scheduling problems with position-based learning effect , 2009 .

[22]  Wen-Chiung Lee,et al.  A bi-criterion single-machine scheduling problem with learning considerations , 2004, Acta Informatica.

[23]  Ji-Bo Wang,et al.  Two-machine flow shop problem with effects of deterioration and learning , 2009, Comput. Ind. Eng..

[24]  Dehua Xu,et al.  Some scheduling problems with general position-dependent and time-dependent learning effects , 2009, Inf. Sci..

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

[26]  J.-B. Wang.  Single machine scheduling with a time-dependent learning effect and deteriorating jobs , 2009, J. Oper. Res. Soc..