Running time of local search algorithms for a scheduling problem on the parallel machines

MaRDI QIDQ5263787zbMATH OpenFDO

Authors Yu. Yu. Velikanova

Publication date 17 July 2015

Full work available at URL http://mathnet.ru/eng/da702

zbMATH Keywords

lower boundneighborhoodupper boundlocal search algorithmrunning time of the algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search
• Local search for multiprocessor scheduling: how many moves does it take to a local optimum?
• scientific article; zbMATH DE number 1757968
• Performance guarantees of local search for multiprocessor scheduling
• Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling

Cited in

(3)

• Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling
• Local search for multiprocessor scheduling: how many moves does it take to a local optimum?
• Performance guarantees of local search for multiprocessor scheduling

This page was built for publication: Running time of local search algorithms for a scheduling problem on the parallel machines

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