Scheduling unit time open shops to minimize the weighted number of late jobs

Authors:
Peter Brucker;Bernd Jurisch;Thomas Tautenhahn;Frank Werner
Affiliations:
Universität Osnabrück, Osnabrück, Germany;Universität Osnabrück, Osnabrück, Germany;Technische Universität Otto von Guericke, Magdeburg, Germany;Technische Universität Otto von Guericke, Magdeburg, Germany
Venue:
Operations Research Letters
Year:
1993

Citing 2
Cited 1

Scheduling open shops with unit execution times to minimize functions of due dates

Operations Research
Open Shop Scheduling to Minimize Finish Time

Journal of the ACM (JACM)

Minimizing the total completion time in a unit-time open shop with release times

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a polynomial algorithm for the problem of scheduling an open shop with unit time operations for a fixed number of machines such that the weighted number of late jobs is minimized. The algorithm is based on dynamic programming. The complexity of this problem was unknown for open shops with more than two machines.