Job shop scheduling with separable sequence-dependent setups

DOI10.1023/A:1018918003761zbMath0890.90094OpenAlexW166042286MaRDI QIDQ1374429

In-Chan Choi, Osman Korkmaz

Publication date: 4 December 1997

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018918003761

zbMATH Keywords

shop schedulingpolynomial time heuristicseparable sequence-dependent setups

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Optimization of setup times in the furniture industry ⋮ A branch and bound method for the job-shop problem with sequence-dependent setup times ⋮ Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times ⋮ Scheduling job shop problems with sequence-dependent setup times ⋮ Simulation-based metamodels for scheduling a dynamic job shop with sequence-dependent setup times ⋮ A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem