On the complexity of open shop scheduling with time lags
From MaRDI portal
Publication:6173710
DOI10.1007/s10951-022-00769-zzbMath1518.90025arXiv2107.08102MaRDI QIDQ6173710
Publication date: 13 July 2023
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.08102
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Complexity results for flow-shop and open-shop scheduling problems with transportation delays
- 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
- A note on scheduling coupled tasks for minimum total completion time
- Two-machine open shop scheduling with special transportation times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
This page was built for publication: On the complexity of open shop scheduling with time lags