A heuristic for the two‐machine no‐wait openshop scheduling problem

Jeffrey B. Sidney and Chelliah Sriskandarajah

Naval Research Logistics (NRL), 1999, vol. 46, issue 2, 129-145

Abstract: In this paper the problem of minimizing makespan in a two‐machine openshop is examined. A heuristic algorithm is proposed, and its worst case performance ratio and complexity are analyzed. The average case performance is evaluated using an empirical study. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 129–145, 1999

Date: 1999
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1002/(SICI)1520-6750(199903)46:23.0.CO;2-3

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:46:y:1999:i:2:p:129-145

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 ().