A Batch Scheduling Problem with Two Agents

In this paper, we consider a two-agent batch scheduling problem on a single machine such that the processing times of agent 1 and the due date of agent 2 in the same batch are identical. The objective is to minimize the total completion time of agent 1 with a constraint on the maximum tardiness of agent 2. First, we propose the optimality conditions. Then, we show that the problem is strongly NP-hard. Finally, we prove the problem remains NP-hard even for the case with one batch of agent 2, and develop a pseudo-polynomial algorithm and an approximation algorithm for this case.

[1]  Lixin Tang,et al.  Two-agent group scheduling with deteriorating jobs on a single machine , 2010 .

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

[3]  Chris N. Potts,et al.  Rescheduling for New Orders , 2004, Oper. Res..

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

[5]  Meral Azizoglu,et al.  Dynamic programming algorithms for scheduling parallel machines with family setup times , 2001, Comput. Oper. Res..

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

[7]  Claudio Arbib,et al.  A competitive scheduling problem and its relevance to UMTS channel assignment , 2004, Networks.

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

[9]  T. C. Edwin Cheng,et al.  Parallel Machine Scheduling with Batch Setup Times , 1994, Oper. Res..

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

[11]  Warren B. Powell,et al.  Exact algorithms for scheduling multiple families of jobs on parallel machines , 2003 .

[12]  S. T. Webster,et al.  The complexity of scheduling job families about a common due date , 1997, Oper. Res. Lett..

[13]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[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]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

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

[18]  Avraham Shtub,et al.  Grouping methods for printed circuit board assembly , 1991 .

[19]  Byung-Cheon Choi,et al.  Approximation algorithms for multi-agent scheduling to minimize total weighted completion time , 2009, Inf. Process. Lett..

[20]  Oded Maimon,et al.  Group set-up for printed circuit board assembly , 1989 .

[21]  T. C. Edwin Cheng,et al.  Scheduling Groups of Unit Length Jobs on Two Identical Parallel Machines , 1999, Inf. Process. Lett..