An almost optimal heuristic for preemptive \(C_{\text{max}}\) scheduling of dependent tasks on parallel identical machines
From MaRDI portal
Publication:596461
DOI10.1023/B:ANOR.0000030689.69422.e1zbMath1056.90033MaRDI QIDQ596461
Joanna Józefowska, Marek Mika, Grzegorz Waligóra, Rafal Rózycki, Jan Weglarz
Publication date: 10 August 2004
Published in: Annals of Operations Research (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Queues and service in operations research (90B22)
Related Items (3)
Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results ⋮ Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan
This page was built for publication: An almost optimal heuristic for preemptive \(C_{\text{max}}\) scheduling of dependent tasks on parallel identical machines
