Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis
From MaRDI portal
Publication:817121
DOI10.1007/s10479-005-2443-4zbMath1091.90014OpenAlexW1622655664MaRDI QIDQ817121
Pierre-Dimitri Ayache, Christian Artigues, Pierre Lopez
Publication date: 7 March 2006
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-005-2443-4
scheduling theorysequence-dependent setup timesjob-shoppriority rulesdominance propertiesschedule generation scheme
Related Items
Group-shop scheduling with sequence-dependent set-up and transportation times, Multi-objective evolutionary algorithm for solving energy-aware fuzzy job shop problems, Application of quantum approximate optimization algorithm to job shop scheduling problem, A memetic algorithm for restoring feasibility in scheduling with limited makespan, Optimization of setup times in the furniture industry, A branch and bound method for the job-shop problem with sequence-dependent setup times, A survey of scheduling problems with setup times or costs, Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times, A competent memetic algorithm for complex scheduling, Parallel machine scheduling with precedence constraints and setup times, Simulation-based metamodels for scheduling a dynamic job shop with sequence-dependent setup times, Computing lower and upper bounds for a large-scale industrial job shop scheduling problem
Cites Work
- Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
- Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
- Practical job shop scheduling
- Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times
- List scheduling in a parallel machine environment with precedence constraints and setup times
- List scheduling revisited
- A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Impact of sequence-dependent setup time on job shop scheduling performance
- On the application of insertion techniques for job shop problems with setup times
- An Exact Method for Solving the Multi-Processor Flow-Shop
- Survey of scheduling research involving setup times
- Algorithms for Solving Production-Scheduling Problems
