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

Authors
BRUCKER P JURISCH B TAUTENHAHN T WERNER F
Citation
P. Brucker et al., SCHEDULING UNIT TIME OPEN SHOPS TO MINIMIZE THE WEIGHTED NUMBER OF LATE JOBS, Operations research letters, 14(5), 1993, pp. 245-250
Citations number
6
Categorie Soggetti
Operatione Research & Management Science","Operatione Research & Management Science
Journal title
Operations research letters → ACNP
ISSN journal
01676377
Volume
14
Issue
5
Year of publication
1993
Pages
245 - 250
Database
ISI
SICI code
0167-6377(1993)14:5<245:SUTOST>2.0.ZU;2-J
Abstract
We present a polynomial algorithm for the problem of scheduling an ope n shop with unit time operations for a fixed number of machines such t hat the weighted number of late jobs is minimized. The algorithm is ba sed on dynamic programming. The complexity of this problem was unknown for open shops with more than two machines.