A cutting plane algorithm for a single machine scheduling problem
From MaRDI portal
Publication:1590043
DOI10.1016/S0377-2217(99)00493-2zbMath0990.90051OpenAlexW1993738071MaRDI QIDQ1590043
Publication date: 19 December 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00493-2
valid inequalitiessingle machine schedulingbranch and bound/cutting plane algorithmmixed \(0-1\) programming problem
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items
A survey of scheduling problems with setup times or costs ⋮ Interdependent integrated network design and scheduling problems with movement of machines
Cites Work
- Unnamed Item
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- A time indexed formulation of non-preemptive single machine scheduling problems
- The CLWS heuristic for single machine scheduling problem
- Uncapacitated Lot-Sizing Problems with Start-Up Costs
- Stable, distributed, real-time scheduling of flexible manufacturing/assembly/diassembly systems
- Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs