A note on a two-agent scheduling problem related to the total weighted late work

We revisit a two-agent scheduling problem in which a set of jobs belonging to two agents A and B (without common jobs) will be processed on a single machine for minimizing the total weighted late work of agent A subject to the maximum cost of agent B being bounded. Zhang and Wang (J Comb Optim 33:945–955, 2017) studied three versions of the problem: (i) the A-jobs having a common due date, (ii) the A-jobs having a common processing time, (iii) the general version. The authors presented polynomial-time algorithms for the first two versions and a pseudo-polynomial-time algorithm for the last one. However, their algorithm for the first version is invalid. Then we show the NP-hardness and provide a pseudo-polynomial-time algorithm for the first version with the cost of agent B being makespan, present a polynomial-time algorithm for an extension of the second version, and show that the third version is solvable in pseudo-polynomial-time by a new technique.

[1]  T.C.E. Cheng,et al.  CON/SLK due date assignment and scheduling on a single machine with two agents , 2016 .

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

[3]  Wang Yong,et al.  Two-agent scheduling problems on a single-machine to minimize the total weighted late work , 2017, J. Comb. Optim..

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

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

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

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

[8]  Dujuan Wang,et al.  A two-agent single-machine scheduling problem with late work criteria , 2017, Soft Comput..

[9]  T.C.E. Cheng,et al.  Due date assignment and scheduling on a single machine with two competing agents , 2016 .

[10]  Alessandro Agnetis,et al.  Multiagent Scheduling - Models and Algorithms , 2014 .

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

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

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

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

[15]  Jinjiang Yuan.  Complexities of Some Problems on Multi-agent Scheduling on a Single Machine , 2016 .

[16]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

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