Two-dedicated-machine scheduling problem with precedence relations to minimize makespan
From MaRDI portal
Publication:2448211
DOI10.1007/s11590-013-0671-0zbMath1292.90113MaRDI QIDQ2448211
Alexandre Dolgui, Evgeny R. Gafarov
Publication date: 30 April 2014
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-013-0671-0
90B35: Deterministic scheduling theory in operations research
Cites Work
- Maximization problems in single machine scheduling
- Scheduling incompatible tasks on two machines
- A note on the two-stage hybrid flow shop problem with dedicated machines
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- Unknown Input Observers Designed by Eigenstructure Assignment