| Article ID: | iaor20041025 |
| Country: | Netherlands |
| Volume: | 31 |
| Issue: | 5 |
| Start Page Number: | 366 |
| End Page Number: | 374 |
| Publication Date: | Sep 2003 |
| Journal: | Operations Research Letters |
| Authors: | Jackson Peter L., Huh Woonghee Tim, Janakiraman Ganesh, Sawhney Nidhi |
This paper studies minimizing the flow time of a cyclic schedule for repeated identical jobs, where one job is started/completed in each cycle, subject to the schedule achieving maximum throughput. We propose a branch and bound method for a single machine problem, and use this method to derive an improved lower bound for the multiple machine problem.