A scatter search approach to sequence-dependent setup times job shop scheduling
DOI10.1080/00207540701805646zbMath1198.90192OpenAlexW2059018539MaRDI QIDQ3055324
Yih-Long Chang, Andrew Manikas
Publication date: 7 November 2010
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540701805646
schedulingmanufacturing systemsproduction planningproduction managementoperational researchoperations managementquality managementoperations planningoperations strategyproduction modelling
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Practical job shop scheduling
- Genetic algorithms and tabu search: Hybrids for optimization
- An efficient genetic algorithm for job shop scheduling with tardiness objectives.
- Using genetic algorithms and heuristics for job shop scheduling with sequence-dependent setup times
- An experimental evaluation of a scatter search for the linear ordering problem
- A hybrid genetic algorithm for the job shop scheduling problem
- DNA Sequencing—Tabu and Scatter Search Combined
- Context-Independent Scatter and Tabu Search for Permutation Problems
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Job Shop Scheduling by Simulated Annealing
- A genetic algorithm based procedure for more realistic job shop scheduling problems
- A new multi-objective optimization method for master production scheduling problems using simulated annealing
- Cyclic lot scheduling with sequence-dependent set-ups: a heuristic for disassembly processes
- Constraint Propagation Based Scheduling of Job Shops
This page was built for publication: A scatter search approach to sequence-dependent setup times job shop scheduling