Simulation-based metamodels for scheduling a dynamic job shop with sequence-dependent setup times

DOI10.1080/00207540701486082zbMath1158.90357MaRDI QIDQ3623397

No author found.

Publication date: 20 April 2009

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540701486082

zbMATH Keywords

simulation; sequence-dependent setup; scheduling rules; regression metamodels; dynamic job shop scheduling

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times, Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time, Optimization of setup times in the furniture industry, Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times, Scheduling a dynamic flexible flow line with sequence-dependent setup times: a simulation analysis

Cites Work

• Schedule generation schemes for the jop-shop problem with sequence-dependent setup times: dominance properties and computational analysis
• Job shop scheduling with separable sequence-dependent setups
• A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
• Metamodels in manufacturing: a review
• Impact of sequence-dependent setup time on job shop scheduling performance
• Survey of scheduling research involving setup times