Performance Guarantees for Scheduling Algorithms

DOI10.1287/opre.26.1.3zbMath0371.90068OpenAlexW2040877664MaRDI QIDQ4147833

Michael R. Garey, Ronald L. Graham, David S. Johnson

Publication date: 1978

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.26.1.3

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Heuristics for parallel machine scheduling with delivery times, Scheduling with incompatible jobs, A PARALLEL SCHEDULING ALGORITHM FOR PARALLEL APPLICATIONS, On the complexity of scheduling jobs on dedicated resources to minimize set-up costs, On the asymptotic probabilistic analysis of scheduling problems in the presence of precedence constraints, Worst case performance for lot sizing heuristics, An algorithm for flow time minimization and its asymptotic makespan properties, A heuristic for preemptive scheduling with set-up times, Heuristics for scheduling unrelated parallel machines, Performance of the LPT algorithm in multiprocessor scheduling, ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation, NP-Complete operations research problems and approximation algorithms, Parallel bundle-based decomposition for large-scale structured mathematical programming problems, Rate-monotonic scheduling for hard-real-time systems, Heuristic methods and applications: A categorized survey, Parallel machine scheduling with splitting jobs, A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem, Analysis of a linear programming heuristic for scheduling unrelated parallel machines, Performance enhancements to tabu search for the early/tardy scheduling problem