Article ID: | iaor2003197 |
Country: | United Kingdom |
Volume: | 29 |
Issue: | 12 |
Start Page Number: | 1621 |
End Page Number: | 1640 |
Publication Date: | Oct 2002 |
Journal: | Computers and Operations Research |
Authors: | Uzsoy Reha, Wang Cheng-Shuo |
Keywords: | heuristics, programming: dynamic |
We consider the problem of minimizing maximum lateness on a batch processing machine in the presence of dynamic job arrivals. The batch processing machine can process up to