A tabu method for a two-agent single-machine scheduling with deterioration jobs

In recent 10 years, the multi-agent idea applied in scheduling issues has received continuing attention. However, the study of the multi-agent scheduling with deteriorating jobs is relatively limited. In light of this, this paper deliberates upon a two-agent single-machine scheduling problem with deteriorating jobs. Taking the proposed model, the actual processing time of a job from both the first agent and the second agent is modeled as a linearly increasing function of its starting time. The goal of this paper is to minimize the total weighted number of tardy jobs of the first agent subject to the condition that the maximum lateness of the second agent is allowed to have an upper bound. The complexity of the model concerned in the paper is claimed as an NP-hard one. Following that, several dominance rules and a lower bound are proposed to be applied in a branch-and-bound algorithm for the optimal solution, and a tabu algorithm is applied to find near-optimal solutions for the problem. The simulation results obtained from all the proposed algorithms are also reported.

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

[2]  Wen-Chiung Lee,et al.  Two-agent scheduling with learning consideration , 2011, Comput. Ind. Eng..

[3]  Chin-Chia Wu,et al.  Single-machine scheduling of proportionally deteriorating jobs by two agents , 2011, J. Oper. Res. Soc..

[4]  T. C. Edwin Cheng,et al.  Multi-agent scheduling on a single machine with max-form criteria , 2008, Eur. J. Oper. Res..

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

[6]  Zhi-Long Chen,et al.  A note on single-processor scheduling with time-dependent execution times , 1995, Oper. Res. Lett..

[7]  Débora P. Ronconi,et al.  Tabu search for total tardiness minimization in flowshop scheduling problems , 1999, Comput. Oper. Res..

[8]  Der-Chiang Li,et al.  Solving a two-agent single-machine scheduling problem considering learning effect , 2012, Comput. Oper. Res..

[9]  Alessandro Agnetis,et al.  Multi-agent single machine scheduling , 2007, Ann. Oper. Res..

[10]  Shijie Sun,et al.  Single-Machine Scheduling Problems with Two Agents Competing for Makespan , 2010, LSMS/ICSEE.

[11]  P. S. Sundararaghavan,et al.  Single machine scheduling with start time dependent processing times: Some solvable cases , 1994 .

[12]  Jen-Shiang Chen,et al.  Minimizing makespan in reentrant flow-shops using hybrid tabu search , 2007 .

[13]  T.C.E. Cheng,et al.  Two-agent single-machine scheduling with release times and deadlines , 2013 .

[14]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[15]  Chin-Chia Wu,et al.  Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties , 2012, Inf. Sci..

[16]  Lixin Tang,et al.  Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine , 2008, COCOON.

[17]  Gur Mosheiov,et al.  Single machine batch scheduling with two competing agents to minimize total flowtime , 2011, Eur. J. Oper. Res..

[18]  Wen-Chiung Lee,et al.  A single-machine scheduling problem with two-agent and deteriorating jobs , 2010 .

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

[20]  Weiping Shang,et al.  A note on the scheduling with two families of jobs , 2005, J. Sched..

[21]  Chin-Chia Wu,et al.  A study of the single-machine two-agent scheduling problem with release times , 2013, Appl. Soft Comput..

[22]  T. C. Edwin Cheng,et al.  Two-agent scheduling with position-based deteriorating jobs and learning effects , 2011, Appl. Math. Comput..

[23]  Jatinder N. D. Gupta,et al.  Single facility scheduling with nonlinear processing times , 1988 .

[24]  Lixin Tang,et al.  Two-agent single-machine scheduling with position-dependent processing times , 2010 .

[25]  Yunqiang Yin,et al.  A branch-and-bound procedure for a single-machine earliness scheduling problem with two agents , 2013, Appl. Soft Comput..

[26]  T. C. Edwin Cheng,et al.  Two-agent single-machine scheduling with assignable due dates , 2012, Appl. Math. Comput..

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

[28]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[29]  Adam Janiak,et al.  Scheduling Problems with Learning and Ageing Effects: A Survey , 2011 .

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

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

[32]  Gur Mosheiov,et al.  Scheduling problems with two competing agents to minimized weighted earliness-tardiness , 2013, Comput. Oper. Res..

[33]  Chin-Chia Wu,et al.  An investigation on a two-agent single-machine scheduling problem with unequal release dates , 2012, Comput. Oper. Res..

[34]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

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

[36]  Shuenn-Ren Cheng,et al.  A Single-Machine Two-Agent Scheduling Problem by GA Approach , 2012, Asia Pac. J. Oper. Res..

[37]  Jonathan Cole Smith,et al.  A Multiple-Criterion Model for Machine Scheduling , 2003, J. Sched..

[38]  Yulin Zhang,et al.  Single machine scheduling problem with two synergetic agents and piece-rate maintenance , 2013 .

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

[40]  Chin-Chia Wu,et al.  Ant colony algorithms for a two-agent scheduling with sum-of processing times-based learning and deteriorating considerations , 2012, J. Intell. Manuf..

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

[42]  T. C. Edwin Cheng,et al.  A note on the complexity of the problem of two-agent scheduling on a single machine , 2006, J. Comb. Optim..

[43]  Alessandro Agnetis,et al.  Scheduling Problems with Two Competing Agents , 2004, Oper. Res..

[44]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[45]  T. C. Edwin Cheng,et al.  Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs , 2006, Theor. Comput. Sci..

[46]  T. C. Edwin Cheng,et al.  Two-agent singe-machine scheduling with release times to minimize the total weighted completion time , 2013, Comput. Oper. Res..