Scheduling Problems with Two Competing Agents 1: Placing Last an Eligible B-Job, Else a Least-Cost A-Job, Minimizes One Agent's Maximum Cost Under a Bound on the Other'sResearch Paper
Classical scheduling theory optimizes one objective for one decision maker. Many shop floors are shared: two departments, two customers or two firms submit jobs to the same machine, and each cares only about how its own jobs are treated. Agnetis, Mirchandani, Pacciarelli and Pacifici, Scheduling Problems with Two Competing Agents (Operations Research 52(2),…