Hybrid Flow Shop Scheduling: Heuristic Solutions and LP-Based Lower Bounds
From MaRDI portal
Publication:5232862
DOI10.1007/978-3-642-20009-0_77zbMath1421.90062OpenAlexW130251370MaRDI QIDQ5232862
Publication date: 13 September 2019
Published in: Operations Research Proceedings (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20009-0_77
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- An optimization-based heuristic for the robotic cell problem
- List scheduling in a parallel machine environment with precedence constraints and setup times
- A supermodular relaxation for scheduling with release dates
- Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds
- Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
- A flexible flowshop problem with total flow time minimization
- A note on weighted completion time minimization in a flexible flow shop
This page was built for publication: Hybrid Flow Shop Scheduling: Heuristic Solutions and LP-Based Lower Bounds