Scheduling Unrelated Parallel Machines Computational Results

DOI10.1007/11764298_18MaRDI QIDQ5307544zbMATH OpenOpenAlexFDO

Authors Burkhard Monien, Andreas Woclaw

Publication date 14 September 2007

Published in Experimental Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11764298_18

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Automata, Languages and Programming
• A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
• Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
• Improved approximation schemes for scheduling unrelated parallel machines
• Approximation algorithms for scheduling unrelated parallel machines

Cited in

(2)

• Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
• Iterated greedy local search methods for unrelated parallel machine scheduling

This page was built for publication: Scheduling Unrelated Parallel Machines Computational Results

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