Minimizing flow time in cyclic schedules for identical jobs with acyclic precedence: the bottleneck lower bound

Authors:
Woonghee Tim Huh;Ganesh Janakiraman;Peter L. Jackson;Nidhi Sawhney
Affiliations:
School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY 14853, USA;School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY 14853, USA;School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY 14853, USA;Carmen Systems AB, Odinsgaton 9, Goteborg 411 03, Sweden
Venue:
Operations Research Letters
Year:
2003

Citing 3
Cited 0

The shifting bottleneck procedure for job shop scheduling

Management Science
Cyclic schedules for job shops with identical jobs

Mathematics of Operations Research
The one-machine problem with delayed precedence constraints and its use in job shop scheduling

Management Science

Quantified Score

Hi-index	0.00

Visualization

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.