A dynamic heuristic for the stochastic unrelated parallel machine scheduling problem

MaRDI QIDQ5437769zbMATH OpenFDO

Authors Jean-Paul Arnaout, Ghaith Rabadi, Ji Hyon Mun

Publication date 28 January 2008

zbMATH Keywords

heuristicssetup timesimulationstochastic timesunrelated parallel machine

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Scheduling unrelated parallel batch processing machines with non-identical job sizes
• Stochastic Scheduling on Unrelated Machines
• A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times
• Unrelated machine scheduling with stochastic processing times
• Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times

Cited in

(7)

• An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes
• A three-stage optimization algorithm for the stochastic parallel machine scheduling problem with adjustable production rates
• An exact branch-and-price algorithm for scheduling rescue units during disaster response
• A survey of scheduling problems with setup times or costs
• An adaptive scheduling algorithm for a parallel machine problem with rework processes
• Processing time generation schemes for parallel machine scheduling problems with various correlation structures
• A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity

This page was built for publication: A dynamic heuristic for the stochastic unrelated parallel machine scheduling problem

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