Abstract
We consider a two-machine open shop problem where the jobs have release dates and due dates, and where all single operations have unit processing times. The goal is to minimize the weighted number of late jobs. We derive a polynomial time algorithm for this problem, thereby answering an open question posed in a recent paper by Brucker et al.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Brucker P, Jurisch B, Jurisch M (1993) Open shop problems with unit time operations. ZOR 37:59–73
Brucker P, Jurisch B, Tautenhahn T, Werner F (1993) Scheduling unit-time open shops to minimize the weighted number of late jobs. OR Letters, to appear
Gonzalez T (1982) Unit execution time shop problems. Math Oper Res 7:57–66
Graham RE, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in the deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287–326
Kubiak W, Sriskandarajah C, Zaras K (1991) A note on the complexity of openshop scheduling problems. INFOR 29:284–294
Liu CY, Bulfin RL (1988) Scheduling open shops with unit execution times to minimize functions of due dates. Oper Res 25:792–798
Lovász, Plummer MD (1986) Matching Theory. Akadémiai Kiadó North Holland, Amsterdam
Author information
Authors and Affiliations
Additional information
This research was supported by the Christian Doppler Laboratorium für Diskrete Optimierung.
Rights and permissions
About this article
Cite this article
Galambos, G., Woeginger, G.J. Minimizing the weighted number of late jobs in UET open shops. ZOR - Methods and Models of Operations Research 41, 109–114 (1995). https://doi.org/10.1007/BF01415068
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01415068