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

H. Kellerer, T. Tautenhahn, G.J. Woeginger

Research output: Contribution to journalArticleAcademicpeer-review

2 Citations (Scopus)
1 Downloads (Pure)

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
Original languageEnglish
Pages (from-to)141-145
JournalNaval Research Logistics
Volume42
Issue number1
DOIs
Publication statusPublished - 1995

Fingerprint Dive into the research topics of 'Note: Open shop scheduling with release dates to minimize maximum lateness'. Together they form a unique fingerprint.

Cite this