| Article ID: | iaor20042040 |
| Country: | United Kingdom |
| Volume: | 30 |
| Issue: | 11 |
| Start Page Number: | 1745 |
| End Page Number: | 1749 |
| Publication Date: | Sep 2003 |
| Journal: | Computers and Operations Research |
| Authors: | Mosheiov Gur, Lann Avital |
| Keywords: | combinatorial analysis |
This note addresses the scheduling problem of minimizing the number of on-time jobs. We introduce an efficient