Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling

DOI10.1007/978-3-642-12200-2_11zbMath1283.68114OpenAlexW1539436202MaRDI QIDQ3557013

Cyriel Rutten, Tjark Vredeveld, Diego Recalde, Petra Schuurman

Publication date: 27 April 2010

Published in: LATIN 2010: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://cris.maastrichtuniversity.nl/en/publications/e29945e8-9f9a-4c9f-8c88-3c3701984780

zbMATH Keywords

local searcheligibility constraintsperformance guaranteerestricted machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

Exponential size neighborhoods for makespan minimization scheduling ⋮ Performance guarantees for scheduling algorithms under perturbed machine speeds ⋮ Symmetry exploitation for online machine covering with bounded migration ⋮ Performance guarantees of local search for minsum scheduling problems

This page was built for publication: Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling