Valid inequalities for a time-indexed formulation

DOI10.1016/J.ORL.2015.02.011zbMath1408.90121OpenAlexW2067443608MaRDI QIDQ1785357

Frits C. R. Spieksma, Lotte Berghman

Publication date: 28 September 2018

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

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/488184

zbMATH Keywords

valid inequalitiesunrelated parallel machinesseparation

Mathematics Subject Classification ID

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

Related Items (1)

Modeling single machine preemptive scheduling problems for computational efficiency

Cites Work

• Unnamed Item
• Unnamed Item
• Time-dependent scheduling
• A concise survey of scheduling with time-dependent processing times
• A polyhedral approach to single-machine scheduling problems.
• On index priority sequencing rules for scheduling with time-dependent job processing times
• A state-of-the-art review on scheduling with learning effects
• Scheduling with time dependent processing times: Review and extensions
• Fast Separation Algorithms for Three-Index Assignment Problems
• Time-Indexed Formulations for Machine Scheduling Problems: Column Generation

This page was built for publication: Valid inequalities for a time-indexed formulation