An effective heuristic for minimising makespan on unrelated parallel machines

DOI10.1057/PALGRAVE.JORS.2600547zbMath1140.90360OpenAlexW2030940780MaRDI QIDQ3157751

No author found.

Publication date: 19 January 2005

Published in: 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)

Related Items (9)

Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem ⋮ A comparative study of solution representations for the unrelated machines environment ⋮ Scheduling unrelated parallel machines with sequence-dependent setups ⋮ Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times ⋮ Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems ⋮ Dispatching problems for parallel machines in the TFT‐LCD assembly process ⋮ Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration ⋮ Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach ⋮ Iterated greedy local search methods for unrelated parallel machine scheduling

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