An effective heuristic for minimising makespan on unrelated parallel machines
DOI10.1057/PALGRAVE.JORS.2600547zbMATH Open1140.90360OpenAlexW2030940780MaRDI QIDQ3157751FDOQ3157751
Author name not available (Why is that?)
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
Approximation methods and heuristics in mathematical programming (90C59) Queues and service in operations research (90B22) Reliability, availability, maintenance, inspection in operations research (90B25)
Cited In (11)
- Exact makespan minimization of unrelated parallel machines
- Dispatching problems for parallel machines in the TFT‐LCD assembly process
- An efficient approximation algorithm for minimizing makespan on uniformly related machines.
- Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times
- A comparative study of solution representations for the unrelated machines environment
- Scheduling unrelated parallel machines with sequence-dependent setups
- Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
- 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
- Iterated greedy local search methods for unrelated parallel machine scheduling
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
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)
