An effective heuristic for minimising makespan on unrelated parallel machines

DOI10.1057/PALGRAVE.JORS.2600547MaRDI QIDQ3157751zbMATH OpenOpenAlexFDO

Authors

Publication date 19 January 2005

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2600547

zbMATH Keywords

heuristicsschedulingtabu searchunrelated machines

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Queues and service in operations research (90B22) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
• A tabu search algorithm to minimize the makespan for the unrelated parallel machines scheduling problem with setup times
• A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search
• Heuristics for scheduling unrelated parallel machines
• scientific article; zbMATH DE number 605173

Cited in

(13)

• A tabu search algorithm to minimize the makespan for the unrelated parallel machines scheduling problem with setup times
• A comparative study of solution representations for the unrelated machines environment
• Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
• scientific article; zbMATH DE number 605173 (Why is no real title available?)
• An efficient approximation algorithm for minimizing makespan on uniformly related machines.
• Iterated greedy local search methods for unrelated parallel machine scheduling
• Scheduling unrelated parallel machines with sequence-dependent setups
• Dispatching problems for parallel machines in the TFT‐LCD assembly process
• Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
• Exact makespan minimization of unrelated parallel machines
• Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
• Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration
• Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times

This page was built for publication: An effective heuristic for minimising makespan on unrelated parallel machines

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