| Article ID: | iaor20043074 |
| Country: | Netherlands |
| Volume: | 149 |
| Issue: | 2 |
| Start Page Number: | 344 |
| End Page Number: | 354 |
| Publication Date: | Sep 2003 |
| Journal: | European Journal of Operational Research |
| Authors: | Baptiste Philippe |
| Keywords: | programming: dynamic |
We study unit execution time open-shops with integer release dates. This paper shows that, in this environment, the minimum weighted number of late jobs can be computed in polynomial time by dynamic programming. The complexity status of the corresponding problem