Scheduling Problems with Two Competing Agents 8: When Both Agents Minimize a Maximum of Regular Costs, There Are at Most n_A·n_B + 1 Nondominated PairsResearch Paper
In many production and service settings a single resource is shared by several parties, each judging the outcome only by how its own work is treated. Multi-agent scheduling studies this situation. Agnetis, Mirchandani, Pacciarelli and Pacifici (Oper. Res. 52(2), 2004) introduced the two-agent single-machine model in which two agents, A and B, each own a set…