Scheduling tasks on unrelated machines: large neighborhood improvement procedures

DOI10.1023/A:1011960407575zbMath0987.68614MaRDI QIDQ5960733

Francis Sourd

Publication date: 2001

Published in: Journal of Heuristics (Search for Journal in Brave)

zbMATH Keywords

schedulingenumeration treeimprovement proceduresunrelated machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (6)

A faster combinatorial approximation algorithm for scheduling unrelated parallel machines ⋮ Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem ⋮ Search tree based approaches for parallel machine scheduling ⋮ A survey of very large-scale neighborhood search techniques ⋮ Iterated greedy local search methods for unrelated parallel machine scheduling ⋮ Looking ahead with the pilot method

This page was built for publication: Scheduling tasks on unrelated machines: large neighborhood improvement procedures