Name
Abstract | ||
|---|---|---|
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}. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/s10878-015-9980-9 | J. Comb. Optim. |
Keywords | Field | DocType |
Game,Scheduling,Coordination mechanism,Nash Equilibrium,Price of anarchy | Social cost,Mathematical optimization,Mathematical economics,Job shop scheduling,Scheduling (computing),Price of stability,Upper and lower bounds,Game theoretic,Price of anarchy,Nash equilibrium,Mathematics | Journal |
Volume | Issue | ISSN |
33 | 2 | 1382-6905 |
Citations | PageRank | References |
1 | 0.35 | 20 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Q. Q. Nong | 1 | 47 | 6.24 |
| guo qiang fan | 2 | 1 | 0.35 |
| q z fang | 3 | 1 | 0.35 |