SPT optimality (mostly) via linear programming

DOI10.1016/j.orl.2022.12.007zbMath1525.90194MaRDI QIDQ6161291

David B. Shmoys, Woo-Hyung Cho, Shane G. Henderson

Publication date: 27 June 2023

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

zbMATH Keywords

linear programmingschedulinggantt charts

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Structure of a simple scheduling polyhedron
• On the facial structure of scheduling polyhedra
• Single-Machine Scheduling Polyhedra with Precedence Constraints
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: SPT optimality (mostly) via linear programming