Permutation, no-wait, no-idle flow shop problems
From MaRDI portal
Publication:4971620
DOI10.1515/acsc-2015-0012zbMath1458.90329OpenAlexW2461523618MaRDI QIDQ4971620
Publication date: 12 October 2020
Published in: Archives of Control Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/acsc-2015-0012
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (1)
Cites Work
- The no-wait flow-shop paradox
- The flow shop problem with no-idle constraints: a review and approximation
- A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem
- Benchmarks for basic scheduling problems
- The Three-Machine No-Wait Flow Shop is NP-Complete
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme
This page was built for publication: Permutation, no-wait, no-idle flow shop problems