Algorithms with Limited Number of Preemptions for Scheduling on Parallel Machines

DOI10.1007/978-3-642-29700-7_9zbMath1304.90094OpenAlexW2202869442MaRDI QIDQ2897985

Jueliang Hu, Zewei Weng, Yiwei Jiang

Publication date: 16 July 2012

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29700-7_9

zbMATH Keywords

approximation algorithmmakespanworst case ratio\(i\)-preemptive scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (1)

Parallel machine covering with limited number of preemptions

This page was built for publication: Algorithms with Limited Number of Preemptions for Scheduling on Parallel Machines