Job-Shop Scheduling with Mixed Blocking Constraints between Operations
From MaRDI portal
Publication:5357765
DOI10.1007/978-3-319-18167-7_29zbMath1370.90119MaRDI QIDQ5357765
Christophe Sauvey, Wajdi Trabelsi, Nathalie Sauer
Publication date: 12 September 2017
Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-18167-7_29
90C35: Programming involving graphs or networks
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Uses Software
Cites Work
- Scheduling trains as a blocking parallel-machine job shop scheduling problem
- An efficient algorithm for the job-shop problem with two jobs
- Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems
- Deterministic job-shop scheduling: Past, present and future
- A generalized permutation approach to job shop scheduling with genetic algorithms
- Optimal two- and three-stage production schedules with setup times included
- Outline for a Logical Theory of Adaptive Systems