Algorithms for dynamic scheduling of unit execution time tasks

DOI10.1016/S0377-2217(02)00236-9zbMath1012.90010MaRDI QIDQ1869578

Klaus H. Ecker, Andrei Tchernykh, Antonio Rodriguez-Diaz

Publication date: 10 April 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

schedulinglist schedulingUETworst case analysison-line scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Complexity and performance of numerical algorithms (65Y20)

Related Items

Min\_c: heterogeneous concentration policy for energy-aware scheduling of jobs with resource contention ⋮ PHEFT: pessimistic image processing workflow scheduling for DSP clusters

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling subject to resource constraints: Classification and complexity
• The MOSIX distributed operating system. Load balancing for UNIX
• Scheduling of resource tasks
• Optimal scheduling for two-processor systems
• Generating Experimental Data for Computational Testing with Machine Scheduling Applications
• Scheduling Interval-Ordered Tasks
• Nonpreemptive LP-Scheduling on Homogeneous Multiprocessor Systems
• Two-Processor Scheduling with Start-Times and Deadlines
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A New Insight into the Coffman–Graham Algorithm
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies