Worst Case Analysis of Two Scheduling Algorithms

DOI10.1137/0206037zbMath0374.90031OpenAlexW2040558879WikidataQ63353536 ScholiaQ63353536MaRDI QIDQ4152013

No author found.

Publication date: 1977

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0206037

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Deterministic scheduling theory in operations research (90B35) Algorithms in computer science (68W99)

Related Items

UET scheduling with unit interprocessor communication delays, Multiprocessor scheduling with interprocessor communication delays, Unnamed Item, Performance of Coffman-Graham schedules in the presence of unit communication delays, An iterative algorithm for scheduling UET tasks with due dates and release times., Speeding-up parallel computation of large smooth-degree isogeny using precedence-constrained scheduling, Scheduling loosely connected task graphs., Coffman-Graham scheduling of UET task systems with 0-1 resources, A state-of-the-art review of parallel-machine scheduling research, Online scheduling of equal-processing-time task systems, Quasi-PTAS for scheduling with precedences using LP hierarchies, PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES, Precedence constrained scheduling in \((2-\frac{7}{3p+1})\) optimal, An EPTAS for scheduling fork-join graphs with communication delay, Polynomial time approximation algorithms for machine scheduling: Ten open problems, Approximation scheduling algorithms: a survey, A (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints Using LP Hierarchies, Scheduling preemptive jobs with precedence constraints on parallel machines, Optimal multiprocessor task scheduling using dominance and equivalence relations