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

DOI10.1016/S0167-6377(03)00004-XzbMath1033.90040MaRDI QIDQ1400347

Peter L. Jackson, Ganesh Janakiraman, Woonghee Tim Huh, Nidhi Sawhney

Publication date: 13 August 2003

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

Branch and boundLower boundCyclic schedulingFlow time

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Optimal Supervisory Control of Discrete Event Systems: Cyclicity and Interleaving of Tasks

Cites Work

• The one-machine sequencing problem
• Combinatorial optimization models for production scheduling in automated manufacturing systems
• The complexity of scheduling jobs in repetitive manufacturing systems
• On scheduling cycle shops: Classification, complexity and approximation
• The complexity of cyclic shop scheduling problems
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Cyclic Schedules for Job Shops with Identical Jobs
• The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
• An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays

This page was built for publication: Minimizing flow time in cyclic schedules for identical jobs with acyclic precedence: The bottleneck lower bound.