Premium
Note: Open‐shop scheduling with release dates to minimize maximum lateness
Author(s) -
Kellerer Hans,
Tautenhahn Thomas,
Woeginger Gerhard
Publication year - 1995
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(199502)42:1<141::aid-nav3220420111>3.0.co;2-3
Subject(s) - scheduling (production processes) , computer science , open shop , mathematical optimization , job shop scheduling , due date , operations research , flow shop scheduling , mathematics , schedule , operating system
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.