Two-agent single machine scheduling with forbidden intervals

We consider the resumable version of the two-agent single machine scheduling problems with forbidden intervals in which the jobs cannot be processed. The goal is to minimize the sum of the objective functions of the two agents. Polynomial and pseudo-polynomial time algorithms are presented for various combinations of regular scheduling objective functions.

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

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

[3]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..

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

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

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

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

[8]  Xiwen Lu,et al.  Approximation schemes for two-agent scheduling on parallel machines , 2013, Theor. Comput. Sci..

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

[10]  Chung-Yee Lee,et al.  Machine Scheduling with Availability Constraints , 2004, Handbook of Scheduling.

[11]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[12]  T. C. Edwin Cheng,et al.  Fixed interval scheduling: Models, applications, computational complexity and algorithms , 2007, Eur. J. Oper. Res..

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

[14]  Günter Schmidt,et al.  Scheduling with limited machine availability , 2000, Eur. J. Oper. Res..

[15]  Qi Feng,et al.  A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives , 2013 .

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

[17]  Joseph Y.-T. Leung,et al.  Competitive Two-Agent Scheduling and Its Applications , 2010, Oper. Res..

[18]  Jinjiang Yuan,et al.  Unbounded parallel-batching scheduling with two competitive agents , 2012, J. Sched..

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

[20]  Lin Chen,et al.  Approximation schemes for two-machine flow shop scheduling with two agents , 2012, J. Comb. Optim..

[21]  Chengbin Chu,et al.  A survey of scheduling with deterministic machine availability constraints , 2010, Comput. Ind. Eng..

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

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

[24]  Michael Pinedo,et al.  Current trends in deterministic scheduling , 1997, Ann. Oper. Res..

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

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