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

DOI10.1007/BF02238297zbMATH Open0729.90053OpenAlexW1546966627MaRDI QIDQ806667FDOQ806667

Authors: Hans Kellerer 

Publication date: 1991

Published in: Computing (Search for Journal in Brave)

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

Recommendations

• Performance of the LPT algorithm in multiprocessor scheduling
• scientific article; zbMATH DE number 34575
• A note on LPT scheduling
• scientific article; zbMATH DE number 1530325
• The exact LPT-bound for maximizing the minimum completion time

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)

Cites Work

• Bounds on Multiprocessing Timing Anomalies
• An Application of Bin-Packing to Multiprocessor Scheduling
• Title not available (Why is that?)
• Bounds on Schedules for Independent Tasks with Similar Execution Times

Cited In (9)

• List scheduling for jobs with arbitrary release times and similar lengths
• Performance of the LPT algorithm in multiprocessor scheduling
• Title not available (Why is that?)
• Title not available (Why is that?)
• The exact LPT-bound for maximizing the minimum completion time
• Some Results on Liu’s Conjecture
• The optimal on-line parallel machine scheduling
• An LPT-bound for a parallel multiprocessor scheduling problem
• An improved LS algorithm for the problem of scheduling multi groups of jobs on multi processors at the same speed

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

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