A tabu search algorithm to minimize the makespan for the unrelated parallel machines scheduling problem with setup times

MaRDI QIDQ5449463zbMATH OpenFDO

Authors Magdy Helal, Ghait Rabadi, Ameer al-Salem

Publication date 11 March 2008

zbMATH Keywords

schedulingtabu searchsetup timesunrelated parallel machines

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Tabu Search Heuristics for Parallel Machine Scheduling with Sequence-Dependent Setup and Ready Times
• Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
• Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times
• An effective heuristic for minimising makespan on unrelated parallel machines
• Scheduling unrelated parallel machines with sequence-dependent setups

Cited in

(12)

• Decomposition methods for the parallel machine scheduling problem with setups
• An effective heuristic for minimising makespan on unrelated parallel machines
• Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
• Using PBIL to minimize makespan for parallel machines scheduling problem with job sequence dependent setup time
• A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
• Enhanced salp swarm algorithm based on firefly algorithm for unrelated parallel machine scheduling with setup times
• Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times
• The third comprehensive survey on scheduling problems with setup times/costs
• A genetic algorithm for the steel continuous casting with inter-sequence dependent setups and dedicated machines
• Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
• ABC-based manufacturing scheduling for unrelated parallel machines with machine-dependent and job sequence-dependent setup times
• Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines

This page was built for publication: A tabu search algorithm to minimize the makespan for the unrelated parallel machines scheduling problem with setup times

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