Approximation Algorithms For Scheduling On Uniform Processors

DOI10.1080/03155986.1993.11732210zbMath0774.90044OpenAlexW2397272157MaRDI QIDQ4202255

Lawrence V. Saxton, F. David Fracchia

Publication date: 1 September 1993

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.1993.11732210

zbMATH Keywords

approximation schemesmaximum completion timeuniform processorsscheduling independent tasks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

An efficient load distribution strategy for a distributed linear network of processors with communication delays