SCHEDULING UNIT TIME OPEN SHOPS TO MINIMIZE THE WEIGHTED NUMBER OF LATE JOBS

Autor(en): BRUCKER, P
JURISCH, B
TAUTENHAHN, T
WERNER, F
Stichwörter: DYNAMIC PROGRAMMING; OPEN SHOP; Operations Research & Management Science; UNIT PROCESSING TIMES
Erscheinungsdatum: 1993
Herausgeber: ELSEVIER SCIENCE BV
Journal: OPERATIONS RESEARCH LETTERS
Volumen: 14
Ausgabe: 5
Startseite: 245
Seitenende: 250
Zusammenfassung: 
We present a polynomial algorithm for the problem of scheduling an open shop with unit time operations for a fixed number of machines such that the weighted number of late jobs is minimized. The algorithm is based on dynamic programming. The complexity of this problem was unknown for open shops with more than two machines.
ISSN: 01676377
DOI: 10.1016/0167-6377(93)90088-X

Show full item record

Google ScholarTM

Check

Altmetric