Note: Open‐shop scheduling with release dates to minimize maximum lateness

Hans Kellerer, Thomas Tautenhahn and Gerhard Woeginger

Naval Research Logistics (NRL), 1995, vol. 42, issue 1, 141-145

Abstract: We present the first polynomial‐time algorithm for an open‐shop problem with unit execution times, arbitrary release dates, and due dates. The objective is to minimize maximum lateness. © 1995 John Wiley & Sons, Inc.

Date: 1995
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199502)42:13.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:42:y:1995:i:1:p:141-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 ().