Minimizing flow time in cyclic schedules for identical jobs with acyclic precedence: the bottleneck lower bound |
| |
| Authors: | Woonghee Tim Huh Ganesh JanakiramanPeter L Jackson Nidhi Sawhney |
| |
| Institution: | a School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY 14853, USA
b Carmen Systems AB, Odinsgaton 9, Goteborg 411 03, Sweden |
| |
| Abstract: | 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. |
| |
| Keywords: | Cyclic scheduling Flow time Branch and bound Lower bound |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
