The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan
From MaRDI portal
Publication:1043332
DOI10.1016/j.ejor.2009.07.030zbMath1176.90236OpenAlexW2056671020MaRDI QIDQ1043332
Djamal Rebaine, Alix Munier Kordon
Publication date: 7 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.07.030
Related Items (4)
From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns ⋮ OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Minimizing flowtime for paired tasks
Cites Work
- Unnamed Item
- A heuristic for the two-machine open-shop scheduling problem with transportation times
- Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
- On-line two-machine open shop scheduling with time lags
- Two-machine open shop scheduling with special transportation times
- Open shop scheduling with delays
This page was built for publication: The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan
