A coordination mechanism for a scheduling game with parallel-batching machines

In this paper we consider the scheduling problem with parallel-batching machines from a game theoretic perspective. There are m parallel-batching machines each of which can handle up to b jobs simultaneously as a batch. The processing time of a batch is the time required for processing the longest job in the batch, and all the jobs in a batch start and complete at the same time. There are n jobs. Each job is owned by a rational and selfish agent and its individual cost is the completion time of its job. The social cost is the largest completion time over all jobs, the makespan. We design a coordination mechanism for the scheduling game problem. We discuss the existence of pure Nash Equilibria and offer upper and lower bounds on the price of anarchy of the coordination mechanism. We show that the mechanism has a price of anarchy no more than $$2-\frac{2}{3b}-\frac{1}{3\max \{m,b\}}$$2-23b-13max{m,b}.

[1]  Christos H. Papadimitriou,et al.  Worst-case Equilibria , 1999, STACS.

[2]  Yuzhong Zhang,et al.  Approximation Algorithms in Batch Processing , 1999, ISAAC.

[3]  Xiaoqiang Cai,et al.  On‐line algorithms for minimizing makespan on batch processing machines , 2001 .

[4]  Yossi Azar,et al.  (Almost) optimal coordination mechanisms for unrelated machine scheduling , 2008, SODA '08.

[5]  Oscar H. Ibarra,et al.  Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors , 1977, JACM.

[6]  Reha Uzsoy,et al.  Minimizing makespan on a single batch processing machine with dynamic job arrivals , 1999 .

[7]  Marios Mavronicolas,et al.  Computing Nash Equilibria for Scheduling on Restricted Parallel Links , 2004, STOC '04.

[8]  Chris N. Potts,et al.  Scheduling with batching: A review , 2000, Eur. J. Oper. Res..

[9]  Yossi Azar,et al.  The competitiveness of on-line assignments , 1992, SODA '92.

[10]  Oscar H. Ibarra,et al.  Bounds for LPT Schedules on Uniform Processors , 1977, SIAM J. Comput..

[11]  Petra Schuurman,et al.  Performance Guarantees of Local Search for Multiprocessor Scheduling , 2007, INFORMS J. Comput..

[12]  Berthold Vöcking,et al.  Tight bounds for worst-case equilibria , 2002, SODA '02.

[13]  Johanne Cohen,et al.  Non-clairvoyant Scheduling Games , 2011, Theory of Computing Systems.

[14]  T. C. Edwin Cheng,et al.  The Single Machine Batching Problem with Family Setup Times to Minimize Maximum Lateness is Strongly NP-Hard , 2003, J. Sched..

[15]  Nicole Immorlica,et al.  Coordination mechanisms for selfish scheduling , 2005, Theor. Comput. Sci..

[16]  Reha Uzsoy,et al.  Efficient Algorithms for Scheduling Semiconductor Burn-In Operations , 1992, Oper. Res..

[17]  Yossi Azar,et al.  Tradeoffs in worst-case equilibria , 2006, Theor. Comput. Sci..

[18]  R. Uzsoy.  Scheduling a single batch processing machine with non-identical job sizes , 1994 .

[19]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[20]  Amos Fiat,et al.  On-line routing of virtual circuits with applications to load balancing and machine scheduling , 1997, JACM.

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

[22]  T. C. Edwin Cheng,et al.  Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs , 2003, J. Sched..

[23]  Gregory Dobson,et al.  Scheduling Independent Tasks on Uniform Processors , 1984, SIAM J. Comput..

[24]  Donald K. Friesen,et al.  Tighter Bounds for LPT Scheduling on Uniform Processors , 1987, SIAM J. Comput..

[25]  Elias Koutsoupias,et al.  Coordination mechanisms , 2009, Theor. Comput. Sci..

[26]  Ellis Horowitz,et al.  A linear time approximation algorithm for multiprocessor scheduling , 1979 .