Bounds on Schedules for Independent Tasks with Similar Execution Times

DOI10.1145/322234.322241MaRDI QIDQ3900980zbMATH OpenOpenAlexFDO

Authors James O. Achugbue, Francis Y. L. Chin

Publication date 1981

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/322234.322241

zbMATH Keywords

list schedulingmultiprocessingworst case performance boundsminimal length schedules

Mathematics Subject Classification ID

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

Cited in

(4)

• List scheduling algorithms to minimize the makespan on identical parallel machines
• A state-of-the-art review of parallel-machine scheduling research
• Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-algorithm
• Semi-online scheduling with bounded job sizes on two uniform machines

This page was built for publication: Bounds on Schedules for Independent Tasks with Similar Execution Times

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