A single-machine learning effect scheduling problem with release times

In this paper, we investigate a single-machine problem with the learning effect and release times where the objective is to minimize the makespan. A branch-and-bound algorithm incorporating with several dominance properties and lower bounds is developed to derive the optimal solution. A heuristic algorithm is proposed to obtain a near-optimal solution. The computational experiments show that the branch-and-bound algorithm can solve instances up to 36 jobs, and the average error percentage of the proposed heuristic is less than 0.11%.

[1]  Bernard W. Taylor,et al.  Operations management : multimedia version , 2000 .

[2]  Stanislaw Gawiejnowicz,et al.  A Note on Scheduling on a Single Processor with Speed Dependent on a Number of Executed Jobs , 1996, Inf. Process. Lett..

[3]  Adam Janiak,et al.  The learning effect: Getting to the core of the problem , 2007, Inf. Process. Lett..

[4]  Ji-Bo Wang,et al.  Single-machine scheduling problems with the effects of learning and deterioration , 2007 .

[5]  Tamer Eren,et al.  Minimizing total tardiness in a scheduling problem with a learning effect , 2007 .

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

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

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

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

[10]  Fu-Kwun Wang,et al.  Learning curve analysis in total productive maintenance , 2001 .

[11]  G. Rand.  Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

[12]  Chin-Chia Wu,et al.  A bi-criteria two-machine flowshop scheduling problem with a learning effect , 2006, J. Oper. Res. Soc..

[13]  B. Williams,et al.  Operations management. , 2001, Optometry.

[14]  Wen-Chiung Lee,et al.  A note on the total completion time problem in a permutation flowshop with a learning effect , 2009, Eur. J. Oper. Res..

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

[16]  V. Reddy Dondeti,et al.  Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs , 1998, Eur. J. Oper. Res..

[17]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

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

[19]  Barry Render,et al.  Operations Management , 2019, CCSP (ISC)2 Certified Cloud Security Professional Official Study Guide, 2nd Edition.

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

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

[22]  Chengbin Chu.  A branch‐and‐bound algorithm to minimize total flow time with unequal release dates , 1992 .

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

[24]  Adam Janiak,et al.  A new approach to the learning effect: Beyond the learning curve restrictions , 2008, Comput. Oper. Res..

[25]  J.-B. Wang,et al.  A note on scheduling problems with learning effect and deteriorating jobs , 2006, Int. J. Syst. Sci..

[26]  Adam Janiak,et al.  Solution algorithms for the makespan minimization problem with the general learning model , 2009, Comput. Ind. Eng..