Simulated annealing approach for the single-machine total late work scheduling problem with a position-based learning

This paper considers a single-machine scheduling problem with a position-based learning effect where the aim is to find an optimal sequence to minimize the total late work. The late work for a job means the amount of processing of this job that is performed after its due date. Because the problem under consideration is NP-hard, this paper then proposes several simulated annealing algorithms for the near-optimal solution. Finally, the computational results of proposed algorithms are also reported.

[1]  Adam Janiak,et al.  A note on a makespan minimization problem with a multi-ability learning effect , 2010 .

[2]  Chin-Chia Wu,et al.  Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times , 2011, Comput. Oper. Res..

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

[4]  T. C. Edwin Cheng,et al.  A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations , 2011, Comput. Ind. Eng..

[5]  Jacek Blazewicz,et al.  Scheduling preemptible tasks on parallel processors with information loss , 1984 .

[6]  Suh-Jenq Yang,et al.  Parallel-machine scheduling with setup and removal times under consideration of the learning effect , 2010 .

[7]  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..

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

[9]  Dar-Li Yang,et al.  Single-machine scheduling with a sum-of-actual-processing-time-based learning effect , 2010, J. Oper. Res. Soc..

[10]  David Ben-Arieh,et al.  Annealing method for PCB assembly scheduling on two sequential machines , 1992 .

[11]  Bahram Alidaee,et al.  Single machine scheduling to minimize total weighted late work: a comparison of scheduling rules and search algorithms , 2002 .

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

[13]  Marc E. Posner,et al.  Generating Experimental Data for Computational Testing with Machine Scheduling Applications , 2001, Oper. Res..

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

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

[16]  Dehua Xu,et al.  Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect , 2010 .

[17]  Chris N. Potts,et al.  Single Machine Scheduling to Minimize Total Late Work , 1992, Oper. Res..

[18]  Malgorzata Sterna,et al.  A comparison of solution procedures for two-machine flow shop scheduling with late work criterion , 2005, Comput. Ind. Eng..

[19]  Malgorzata Sterna,et al.  Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date , 2008, Comput. Oper. Res..

[20]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

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

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