×

Open-shop scheduling problems with dominated machines. (English) Zbl 0676.90031

Summary: This article deals with special cases of open-shop scheduling where n jobs have to be processed by m, \(m\geq 3\), machines to minimize the schedule length. The main result obtained is an O(n) algorithm for the three-machine problem with a dominated machine.

MSC:

90B35 Deterministic scheduling theory in operations research
68Q25 Analysis of algorithms and problem complexity
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] and , ”Open-Shop Scheduling Problems with Dominated Machines,” Mimeograph Series No. 383, Faculty of Industrial Engineering and Management, Technion, 1987.
[2] and , ”Subproblems of Openshop–More than Two Machines–Schedule Length Problems,” Mimeograph Series No. 260, Faculty of Industrial Engineering and Management, Technion, 1980.
[3] Gonzalez, JACM 23 pp 665– (1976)
[4] Graham, Annals of Discrete Mathematics 5 pp 287– (1979)
[5] Hefetz, Naval Research Logistics Quarterly 29 pp 535– (1982)
[6] Monma, RAIRO 17 pp 105– (1983)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.