The single-machine total weighted tardiness scheduling problem with position-based learning effects

This study addresses the problem of minimizing the total weighted tardiness on a single-machine with a position-based learning effect. Several dominance properties are established to develop branch and bound algorithm and a lower bound is provided to derive the optimal solution. In addition, three heuristic procedures are developed for near-optimal solutions. Computational results are also presented to evaluate the performance of the proposed algorithms.

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

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

[3]  Zhiyong Xu,et al.  Some results of the worst-case analysis for flow shop scheduling with a learning effect , 2008, Annals of Operations Research.

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

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

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

[7]  Bertrand M. T. Lin.  Complexity results for single-machine scheduling with positional learning effects , 2007, J. Oper. Res. Soc..

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

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

[10]  Dehua Xu,et al.  Some single-machine scheduling problems with past-sequence-dependent setup times and a general learning effect , 2010 .

[11]  E. Lawler.  A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness , 1977 .

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

[13]  T. C. Edwin Cheng,et al.  Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations , 2009, Inf. Sci..

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

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

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

[17]  L Jing,et al.  Some Single Machine Scheduling Problems with Learning Effect under Consistent Condition , 2003 .

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

[19]  Wen-Chiung Lee,et al.  A single-machine learning effect scheduling problem with release times , 2010 .

[20]  Adam Janiak,et al.  Complexity results for single-machine scheduling with positional learning effects , 2008, J. Oper. Res. Soc..

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

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

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

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

[25]  M. Selim Akturk,et al.  Theory and Methodology a New Dominance Rule to Minimize Total Weighted Tardiness with Unequal Release Dates , 1998 .

[26]  Wen-Chiung Lee,et al.  Single-machine scheduling problems with a learning effect , 2008 .