Minmax common due-window assignment and scheduling on a single machine with two competing agents

• Published in: The Journal of the Operational Research Society Vol. 69; no. 4; pp. 589 - 602
• Main Author: Mor, Baruch
• Format: Journal Article
• Language: English
• Published: Taylor & Francis 03.04.2018; Taylor & Francis, Ltd
• Subjects: common due-date; minmax; Multi-agent scheduling; single machine
• ISSN: 0160-5682; 1476-9360
• DOI: 10.1057/s41274-017-0253-0

We study the classical method of common due-date assignment and focus on minmax objective functions. In due-date assignment problems, the objective is to find the optimal due-date and job sequence that minimize the total earliness, tardiness and due-date-related costs. We extend the single-agent problem to a setting involving two competing agents and to a setting of multi-agent. In the two-agent setting (herein agents A and B), the scheduler needs to minimize the maximum cost of the agent A, subject to an upper bound on the maximal cost of the agent B. In the general model of multi-agent scheduling, the scheduler needs to minimize the cost among all A-type agents, subject to an agent-dependent upper bound on the maximal cost of the B-type agents. We further generalize the problems to the method of common due-window assignment. For all studied problems, we introduce efficient polynomial time solutions.