A note on LPT scheduling
From MaRDI portal
Publication:5906502
DOI10.1016/0167-6377(93)90024-BzbMath0803.90075MaRDI QIDQ5906502
Publication date: 12 April 1994
Published in: Operations Research Letters (Search for Journal in Brave)
heuristics; worst-case performance; identical parallel machines; parallel-machine scheduling; largest processing-time-first
90B35: Deterministic scheduling theory in operations research
Related Items
PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS, A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem, The \(k\)-partitioning problem, The longest processing time rule for identical parallel machines revisited, A note on the Coffman-Sethi bound for LPT scheduling, A note on posterior tight worst-case bounds for longest processing time schedules, A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem, Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems
Cites Work