A note on on-line scheduling with precedence constraints on identical machines

DOI10.1016/S0020-0190(00)00141-1MaRDI QIDQ1607065zbMATH OpenFDO

Authors Leah Epstein

Publication date 25 July 2002

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0020-0190(00)00141-1

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1182764
• On-line scheduling with precedence constraints
• scientific article; zbMATH DE number 1617256
• Lower bounds for on-line single-machine scheduling.
• A lower bound for on-line scheduling on uniformly related machines

Cites work

• A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
• A New Algorithm for Preemptive Scheduling of Trees
• Algorithms for Scheduling Tasks on Unrelated Processors
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Efficient scheduling of tasks without full use of processor resources
• scientific article; zbMATH DE number 3466528 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 6472635 (Why is no real title available?)
• Nearly on Line Scheduling of a Uniform Processor System with Release Times
• Online algorithms. The state of the art
• Optimal online scheduling of parallel jobs with dependencies
• Scheduling on identical machines: How good is LPT in an on-line setting?
• Scheduling Parallel Machines On-Line
• Scheduling uniform machines on-line requires nondecreasing speed ratios

Cited in

(9)

• On-line scheduling with precedence constraints
• Lower bounds for on-line single-machine scheduling.
• Rescaling limits of complex rational maps
• scientific article; zbMATH DE number 1617256 (Why is no real title available?)
• The on-line preemptive scheduling on parallel machines which have nonsimultaneous machine available times
• scientific article; zbMATH DE number 1182764 (Why is no real title available?)
• scientific article; zbMATH DE number 1834660 (Why is no real title available?)
• Online Scheduling of Precedence Constrained Tasks
• A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints

This page was built for publication: A note on on-line scheduling with precedence constraints on identical machines

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