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

Authors:
Thomas Tautenhahn;Gerhard J. Woeginger
Affiliations:
-;-
Venue:
Operations Research Letters
Year:
1997

Citing 3
Cited 1

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

Operations Research
A preemptive open shop scheduling problem with one resource

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

Operations Research Letters

Polynomial algorithm for parallel machine mean flow time scheduling problem with release dates

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of minimizing the total completion time in a unit-time open shop with release times where the number of machines is constant. Brucker and Kramer (1994) proved that this problem is solvable in polynomial time. However, the time complexity of the algorithm presented there is a polynom of a very high degree and, thus, the algorithm is not practicable even for a small number of machines. We give an O(n^2) algorithm for the considered problem which is based on dynamic programming. The result is applied to solve a previously open problem with a special resource constraint raised by De Werra et al. (1991).