A New Algorithm for Preemptive Scheduling of Trees

DOI10.1145/322186.322194MaRDI QIDQ3891759zbMATH OpenOpenAlexFDO

Authors Donald B. Johnson, Teofilo F. Gonzalez

Publication date 1980

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

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

zbMATH Keywords

preemptive scheduling of trees

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25)

Cited in

(13)

• A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations
• Nearly on line scheduling of preemptive independent tasks
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
• A note on on-line scheduling with precedence constraints on identical machines
• A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
• Scheduling chained multiprocessor tasks onto large multiprocessor system
• Makespan minimization with OR-precedence constraints
• Optimal preemptive scheduling on a fixed number of identical parallel machines
• Towards tight lower bounds for scheduling problems
• Open shop problems with unit time operations
• b9000A 1/4 approximate algorithm for P2/tree/Cmax
• Scheduling parallel jobs to minimize the makespan
• A state-of-the-art review of parallel-machine scheduling research

This page was built for publication: A New Algorithm for Preemptive Scheduling of Trees

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