OPEN-SHOP SCHEDULING WITH RELEASE DATES TO MINIMIZE MAXIMUM LATENESS

Authors
KELLERER H TAUTENHAHN T WOEGINGER G
Citation
H. Kellerer et al., OPEN-SHOP SCHEDULING WITH RELEASE DATES TO MINIMIZE MAXIMUM LATENESS, Naval research logistics, 42(1), 1995, pp. 141-145
Citations number
13
Categorie Soggetti
Operatione Research & Management Science","Operatione Research & Management Science","Engineering, Marine
Journal title
Naval research logistics → ACNP
ISSN journal
0894069X
Volume
42
Issue
1
Year of publication
1995
Pages
141 - 145
Database
ISI
SICI code
0894-069X(1995)42:1<141:OSWRDT>2.0.ZU;2-X
Abstract
We present the first polynomial-time algorithm for an open-shop proble m with unit execution times, arbitrary release dates, and due dates. T he objective is to minimize maximum lateness. (C) 1995 John Wiley & So ns, Inc.