| Article ID: | iaor19952100 |
| Country: | Germany |
| Volume: | 41 |
| Start Page Number: | 109 |
| End Page Number: | 114 |
| Publication Date: | Oct 1995 |
| Journal: | Mathematical Methods of Operations Research (Heidelberg) |
| Authors: | Woeginger G.J., Galambos G. |
The authors 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. The authors derive a polynomial time algorithm for this problem, thereby answering an open question posed in a recent paper by Brucker et al.