Two-agent scheduling problems on a single-machine to minimize the total weighted late work

In this paper, two-agent scheduling problems are presented. The different agents share a common processing resource, and each agent wants to minimize a cost function depending on its jobs only. The objective functions we consider are the total weighted late work and the maximum cost. The problem is to find a schedule that minimizes the objective function of agent A, while keeping the objective function of agent B cannot exceed a given bound U. Some different scenarios are presented by depending on the objective function of each agent. We address the complexity of those problems, and present the optimal polynomial time algorithms or pseudo-polynomial time algorithm to solve the scheduling problems, respectively.

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

[2]  Jacek Blazewicz,et al.  Scheduling preemptible tasks on parallel processors with information loss , 1984 .

[3]  Joseph Y.-T. Leung,et al.  Scheduling two agents with controllable processing times , 2010, Eur. J. Oper. Res..

[4]  Malgorzata Sterna,et al.  A survey of scheduling problems with late work criteria , 2011 .

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

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

[7]  Chris N. Potts,et al.  Single Machine Scheduling to Minimize Total Weighted Late Work , 1995, INFORMS J. Comput..

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

[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]  Wen-Chiung Lee,et al.  A single-machine scheduling problem with two-agent and deteriorating jobs , 2010 .

[11]  Dvir Shabtay,et al.  Single machine scheduling with two competing agents and equal job processing times , 2015, Eur. J. Oper. Res..

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

[13]  Mohammad Ranjbar,et al.  Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays , 2014 .

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

[15]  Jose M. Framiñan,et al.  A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems , 2014, Eur. J. Oper. Res..

[16]  F. Jolai,et al.  Optimal methods for batch processing problem with makespan and maximum lateness objectives , 2010 .

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

[18]  Xiwen Lu,et al.  Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan , 2016, J. Comb. Optim..

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

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

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

[22]  Chris N. Potts,et al.  Single Machine Scheduling to Minimize Total Late Work , 1992, Oper. Res..

[23]  Joseph Y.-T. Leung,et al.  Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .

[24]  T. C. Edwin Cheng,et al.  Two-agent scheduling in a flowshop , 2016, Eur. J. Oper. Res..