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

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 pro...

Full description

Saved in:
Bibliographic Details
Published inThe Journal of the Operational Research Society Vol. 69; no. 4; pp. 589 - 602
Main Author Mor, Baruch
Format Journal Article
LanguageEnglish
Published Taylor & Francis 03.04.2018
Taylor & Francis, Ltd
Subjects
Online AccessGet full text

Cover

Loading…