A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects

This study considers an NP-hard problem of minimizing the total tardiness on a single machine with arbitrary release dates and position-dependent learning effects. A mixed-integer programming (MIP ) model is first formulated to find the optimal solution for small-size problem instances. Some new dominance rules are then presented which provide a sufficient condition for finding local optimality. The branch-and-bound (B& B) strategy incorporating with several dominance properties and a lower bound is proposed to derive the optimal solution for medium- to-large-size problem instances, and four marriage-in-honey-bees optimization algorithms (MBO) are developed to derive near-optimal solutions for the problem. To show the effectiveness of the proposed algorithms, 3600 situations with 20 and 25 jobs, are randomly generated for experiments.

[1]  Ali R. Yildiz,et al.  Cuckoo search algorithm for the selection of optimal machining parameters in milling operations , 2012, The International Journal of Advanced Manufacturing Technology.

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

[3]  Ali R. Yildiz,et al.  A new hybrid particle swarm optimization approach for structural design optimization in the automotive industry , 2012 .

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

[5]  M. Duran Toksari,et al.  A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs , 2011, Comput. Oper. Res..

[6]  Ling-Huey Su,et al.  Minimizing total tardiness on a single machine with unequal release dates , 2008, Eur. J. Oper. Res..

[7]  Ali R. Yildiz,et al.  Hybrid Taguchi-differential evolution algorithm for optimization of multi-pass turning operations , 2013, Appl. Soft Comput..

[8]  Wlodzimierz Szwarc,et al.  Solution of the single machine total tardiness problem , 1999 .

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

[10]  A. Kan.  Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

[11]  İsmail Durgun,et al.  Structural Design Optimization of Vehicle Components Using Cuckoo Search Algorithm , 2012 .

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

[13]  Suh-Jenq Yang,et al.  Single-machine scheduling simultaneous with position-based and sum-of-processing-times-based learning considerations under group technology assumption , 2011 .

[14]  Hussein A. Abbass,et al.  MBO: marriage in honey bees optimization-a Haplometrosis polygynous swarming approach , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

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

[16]  Mouloud Koudil,et al.  Using Bees to Solve a Data-Mining Problem Expressed as a Max-Sat One , 2005, IWINAC.

[17]  Ali R. Yildiz,et al.  Comparison of evolutionary-based optimization algorithms for structural design optimization , 2013, Eng. Appl. Artif. Intell..

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

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

[20]  Chin-Chia Wu,et al.  Minimizing the makespan on a single machine with learning and unequal release times , 2010, Comput. Ind. Eng..

[21]  Ali R. Yildiz,et al.  A new hybrid differential evolution algorithm for the selection of optimal machining parameters in milling operations , 2013, Appl. Soft Comput..

[22]  Christos Koulamas,et al.  The single-machine total tardiness scheduling problem: Review and extensions , 2010, Eur. J. Oper. Res..

[23]  Junjie Li,et al.  Structural inverse analysis by hybrid simplex artificial bee colony algorithms , 2009 .

[24]  Wen-Chiung Lee,et al.  Single-machine scheduling with general sum-of-processing-time-based and position-based learning effects , 2011 .

[25]  Qing Lu,et al.  On decomposition of the total tardiness problem , 1995, Oper. Res. Lett..

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

[27]  T. C. Edwin Cheng,et al.  Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects , 2008, Inf. Sci..

[28]  Ali R. Yildiz,et al.  A comparative study of population-based optimization algorithms for turning operations , 2012, Inf. Sci..

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

[30]  Kiran Solanki,et al.  Multi-objective optimization of vehicle crashworthiness using a new particle swarm based approach , 2012 .

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

[32]  Hussein A. Abbass,et al.  A True Annealing Approach to the Marriage in Honey-Bees Optimization Algorithm , 2003, Int. J. Comput. Intell. Appl..

[33]  Suh-Jenq Yang,et al.  Single-machine group scheduling problems under the effects of deterioration and learning , 2010, Comput. Ind. Eng..

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

[35]  Ali R. Yildiz,et al.  Optimization of cutting parameters in multi-pass turning using artificial bee colony-based approach , 2013, Inf. Sci..

[36]  Adam Janiak,et al.  A note on the learning effect in multi-agent optimization , 2011, Expert Syst. Appl..

[37]  C. Chu.  A branch-and-bound algorithm to minimize total tardiness with different release dates , 1992 .

[38]  Ji-Bo Wang,et al.  Single machine scheduling with a learning effect and discounted costs , 2010 .

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

[40]  Ali R. Yildiz,et al.  A new hybrid artificial bee colony algorithm for robust optimal design and manufacturing , 2013, Appl. Soft Comput..

[41]  Alok Singh,et al.  An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem , 2009, Appl. Soft Comput..

[42]  Hamilton Emmons,et al.  One-Machine Sequencing to Minimize Certain Functions of Job Tardiness , 1969, Oper. Res..

[43]  Philippe Baptiste,et al.  A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates , 2004, Eur. J. Oper. Res..

[44]  Ji-Bo Wang,et al.  Single machine multiple common due dates scheduling with learning effects , 2010, Comput. Math. Appl..

[45]  H. Abbass.  A single queen single worker honey–bees approach to 3-SAT , 2001 .

[46]  C. Chu,et al.  Some new efficient methods to solve the n/1/ri/ϵTi scheduling problem , 1992 .

[47]  Chris N. Potts,et al.  A decomposition algorithm for the single machine total tardiness problem , 1982, Oper. Res. Lett..

[48]  Dehua Xu,et al.  Notes on "some single-machine scheduling problems with general position-dependent and time-dependent learning effects" , 2011, Inf. Sci..

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

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

[51]  Mouloud Koudil,et al.  Using artificial bees to solve partitioning and scheduling problems in codesign , 2007, Appl. Math. Comput..

[52]  Ali R. Yildiz,et al.  A novel hybrid immune algorithm for global optimization in design and manufacturing , 2009 .

[53]  Adam Janiak,et al.  Experience-Based Approach to Scheduling Problems With the Learning Effect , 2009, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[54]  Francisco J. Rodríguez,et al.  An artificial bee colony algorithm for the maximally diverse grouping problem , 2013, Inf. Sci..

[55]  Ji-Bo Wang,et al.  A revision of machine scheduling problems with a general learning effect , 2011, Math. Comput. Model..

[56]  Radoslaw Rudek,et al.  Computational complexity and solution algorithms for flowshop scheduling problems with the learning effect , 2011, Comput. Ind. Eng..

[57]  Dervis Karaboga,et al.  Artificial bee colony programming for symbolic regression , 2012, Inf. Sci..

[58]  Ali Rıza Yıldız,et al.  A novel particle swarm optimization approach for product design and manufacturing , 2008 .

[59]  Kazuhiro Saitou,et al.  Topology Synthesis of Multicomponent Structural Assemblies in Continuum Domains , 2011 .

[60]  F. D. Croce,et al.  The two-machine total completion time flow shop problem , 1996 .

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