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

Baruch Mor

Journal of the Operational Research Society, 2018, vol. 69, issue 4, 589-602

Abstract: 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.

Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1057/s41274-017-0253-0 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tjorxx:v:69:y:2018:i:4:p:589-602

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjor20

DOI: 10.1057/s41274-017-0253-0

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald

More articles in Journal of the Operational Research Society from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().