Scheduling tasks on unrelated machines: large neighborhood improvement procedures
From MaRDI portal
Publication:5960733
DOI10.1023/A:1011960407575zbMath0987.68614MaRDI QIDQ5960733
Publication date: 2001
Published in: Journal of Heuristics (Search for Journal in Brave)
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68W25: Approximation algorithms
Related Items
Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem, A survey of very large-scale neighborhood search techniques, Looking ahead with the pilot method, Search tree based approaches for parallel machine scheduling, Iterated greedy local search methods for unrelated parallel machine scheduling, A faster combinatorial approximation algorithm for scheduling unrelated parallel machines