Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation

• Published in: Engineering optimization Vol. 51; no. 7; pp. 1251 - 1267
• Main Author: Mor, Baruch
• Format: Journal Article
• Language: English
• Published: Abingdon Taylor & Francis 03.07.2019; Taylor & Francis Ltd
• Subjects: common due-window; convex resource allocation; Job shops; minmax; position-dependent workloads; Production scheduling; Resource allocation; Scheduling; Single-machine scheduling; Upper bounds; Windows (intervals)

In this article, the common due-window (CON DW) assignment and scheduling problem on a single machine is studied. The minmax CON DW problem is extended by considering convex resource allocation. In extended problems, the scheduler needs to find, in addition to the optimal job sequence, the start tim...