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

DOI10.1080/00207540701486082zbMATH Open1158.90357OpenAlexW2131737760MaRDI QIDQ3623397FDOQ3623397

Authors:

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

Recommendations

• Scheduling a dynamic flexible flow line with sequence-dependent setup times: a simulation analysis
• Impact of sequence-dependent setup time on job shop scheduling performance
• Workshop scheduling using practical (inaccurate) data Part 1: The performance of heuristic scheduling rules in a dynamic job shop environment using a rolling time horizon approach
• Comparison of Scheduling Rules in a Flow Shop with Multiple Processors: A Simulation
• New dispatching rules for shop scheduling: A step forward

zbMATH Keywords

simulationsequence-dependent setupscheduling rulesregression metamodelsdynamic job shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

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

Cited In (8)

• Scheduling a dynamic flexible flow line with sequence-dependent setup times: a simulation analysis
• Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times
• The third comprehensive survey on scheduling problems with setup times/costs
• Optimization of setup times in the furniture industry
• Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time
• Metamodel-based simulation optimization considering a single stochastic constraint
• Heuristics for no-wait flowshops with makespan subject to mean completion time
• Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times

This page was built for publication: Simulation-based metamodels for scheduling a dynamic job shop with sequence-dependent setup times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3623397)