The single-machine total tardiness problem with unequal release times and a linear deterioration

Recently, machine scheduling problems with deteriorating jobs have received more attention from the scheduling research community. In this paper we consider a single-machine scheduling problem with a linear deteriorating effect and unequal release times. The objective is to minimize the total tardiness. We propose a branch-and-bound algorithm incorporating with several dominance properties and two lower bounds to search for the optimal solution. In addition, we propose a marriage in honey-bees optimization algorithm (MBO) to provide a near-optimal solution. The computational experiment is also conducted to evaluate the impacts of the parameters over the performances of the proposed algorithms.

[1]  Chuanli Zhao,et al.  Rescheduling problems with deteriorating jobs under disruptions , 2010 .

[2]  P. Liu,et al.  Two-agent single-machine scheduling problems under increasing linear deterioration , 2011 .

[3]  Xue-Ru Wang,et al.  Single-machine scheduling with convex resource dependent processing times and deteriorating jobs , 2013 .

[4]  Sid Browne,et al.  Scheduling Deteriorating Jobs on a Single Processor , 1990, Oper. Res..

[5]  Marshall L. Fisher,et al.  A dual algorithm for the one-machine scheduling problem , 1976, Math. Program..

[6]  Bahram Alidaee,et al.  Scheduling with time dependent processing times: Review and extensions , 1999, J. Oper. Res. Soc..

[7]  Christos Koulamas,et al.  The Total Tardiness Problem: Review and Extensions , 1994, Oper. Res..

[8]  Adam Janiak,et al.  Batching work and rework processes with limited deterioration of reworkables , 2006, Comput. Oper. Res..

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

[10]  Bertrand M. T. Lin,et al.  A concise survey of scheduling with time-dependent processing times , 2004, Eur. J. Oper. Res..

[11]  Ji-Bo Wang,et al.  Group scheduling with independent setup times, ready times, and deteriorating job processing times , 2011, The International Journal of Advanced Manufacturing Technology.

[12]  Zhao Chuan.  Scheduling Problems under Linear Deterioration , 2003 .

[13]  Ji-Bo Wang,et al.  Two single-machine scheduling problems with the effects of deterioration and learning , 2010 .

[14]  Tapan Sen,et al.  A state-of-art survey of static scheduling research involving due dates , 1984 .

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

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

[17]  Gur Mosheiov,et al.  Scheduling jobs with step-deterioration; minimizing makespan on a single- and multi-machine , 1995 .

[18]  Ji-Bo Wang,et al.  Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs , 2012, Int. J. Syst. Sci..

[19]  Adam Janiak,et al.  Minimizing maximum lateness under linear deterioration , 2000, Eur. J. Oper. Res..

[20]  Chris N. Potts,et al.  A survey of algorithms for the single machine total weighted tardiness scheduling problem , 1990, Discret. Appl. Math..

[21]  Gur Mosheiov,et al.  Scheduling jobs under simple linear deterioration , 1994, Comput. Oper. Res..

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

[23]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[24]  Chin-Chia Wu,et al.  Simulated-annealing heuristics for the single-machine scheduling problem with learning and unequal job release times , 2011 .

[25]  Ping Ji,et al.  Scheduling jobs with chain precedence constraints and deteriorating jobs , 2011, J. Oper. Res. Soc..

[26]  Chris N. Potts,et al.  An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem , 2002, INFORMS J. Comput..

[27]  Colin R. Reeves,et al.  Heuristics for scheduling a single machine subject to unequal job release times , 1995 .

[28]  Dehua Xu,et al.  Some single-machine scheduling problems with general effects of learning and deterioration , 2011, Comput. Math. Appl..

[29]  Dan Wang,et al.  Minimizing makespan in a two-machine flow shop with effects of deterioration and learning , 2011, Optimization Letters.

[30]  T.C.E. Cheng,et al.  Scheduling start time dependent jobs to minimize the total weighted completion time , 2002, J. Oper. Res. Soc..

[31]  Gur Mosheiov,et al.  V-Shaped Policies for Scheduling Deteriorating Jobs , 1991, Oper. Res..

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

[33]  Sushil K. Gupta,et al.  Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem , 1990 .

[34]  T. C. Edwin Cheng,et al.  Scheduling Problems with the Effects of deterioration and Learning , 2007, Asia Pac. J. Oper. Res..

[35]  Suh-Jenq Yang,et al.  Minimizing the makespan on single-machine scheduling with aging effect and variable maintenance activities , 2010 .

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

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

[38]  Chuanli Zhao,et al.  A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity , 2012, Comput. Oper. Res..

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

[40]  Cheng Wang,et al.  Single-machine due-window assignment problem with learning effect and deteriorating jobs , 2011 .

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

[42]  Ji-Bo Wang,et al.  Minimizing makespan in three-machine flow shops with deteriorating jobs , 2013, Comput. Oper. Res..

[43]  Ji-Bo Wang,et al.  Flow shop makespan minimization scheduling with deteriorating jobs under dominating machines , 2012 .

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

[45]  Abalfazl Zareei,et al.  Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs , 2010 .

[46]  T. C. Edwin Cheng,et al.  Three scheduling problems with deteriorating jobs to minimize the total completion time , 2002, Inf. Process. Lett..

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

[48]  T.C.E. Cheng,et al.  Common due-window assignment and scheduling of linear time-dependent deteriorating jobs and a deteriorating maintenance activity , 2012 .

[49]  Adam Janiak,et al.  Minimizing the total weighted completion time of deteriorating jobs , 2002, Inf. Process. Lett..

[50]  Stanislaw Gawiejnowicz,et al.  Time-Dependent Scheduling , 2008, Monographs in Theoretical Computer Science. An EATCS Series.