Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-algorithm

DOI10.1007/BF02238297zbMath0729.90053OpenAlexW1546966627MaRDI QIDQ806667

Hans Kellerer

Publication date: 1991

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02238297

zbMATH Keywords

worst case analysisnonpreemptive schedulingidentical parallel processorssimilar processing times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

List scheduling for jobs with arbitrary release times and similar lengths ⋮ Performance of the LPT algorithm in multiprocessor scheduling ⋮ The optimal on-line parallel machine scheduling

Cites Work

• Unnamed Item
• Bounds on Schedules for Independent Tasks with Similar Execution Times
• An Application of Bin-Packing to Multiprocessor Scheduling
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-algorithm