Open‐shop scheduling problems with dominated machines

I. Adiri and N. Aizikowitz (Hefetz)

Naval Research Logistics (NRL), 1989, vol. 36, issue 3, 273-281

Abstract: This article deals with special cases of open‐shop scheduling where n jobs have to be processed by m, m ⩾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.

Date: 1989
References: View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
https://doi.org/10.1002/nav.3220360305

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:36:y:1989:i:3:p:273-281

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().