Approximation Algorithms For Scheduling On Uniform Processors

DOI10.1080/03155986.1993.11732210zbMATH Open0774.90044OpenAlexW2397272157MaRDI QIDQ4202255FDOQ4202255

Authors: F. David Fracchia, Lawrence V. Saxton 

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

Recommendations

• Approximation for scheduling on uniform nonsimultaneous parallel machines
• Approximation algorithms for multiprocessor scheduling under uncertainty
• scientific article; zbMATH DE number 1979517
• Approximation schemes for scheduling on uniformly related and identical parallel machines
• Publication:4938775
• Approximation schemes for scheduling on parallel machines
• Approximation algorithms for scheduling unrelated parallel machines
• Approximation algorithms for general parallel task scheduling
• Scheduling imprecise computation tasks on uniform processors

zbMATH Keywords

approximation schemesmaximum completion timeuniform processorsscheduling independent tasks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (17)

• A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
• Approximation for scheduling on uniform nonsimultaneous parallel machines
• Time optimal linear schedules for algorithms with uniform dependencies
• Title not available (Why is that?)
• On time optimal implementation of uniform recurrences onto array processors via quadratic programming
• Fast approximation algorithms for uniform machine scheduling with processing set restrictions
• An approximation result for a duo-processor task scheduling problem
• An EPTAS for scheduling jobs on uniform processors: using an MILP relaxation with a constant number of integral variables
• Approximation algorithms for scheduling arithmetic expressions on pipelined machines
• Title not available (Why is that?)
• An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables
• A unified approach to approximating resource allocation and scheduling
• Scheduling imprecise computation tasks on uniform processors
• Title not available (Why is that?)
• An efficient load distribution strategy for a distributed linear network of processors with communication delays
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• Title not available (Why is that?)

This page was built for publication: Approximation Algorithms For Scheduling On Uniform Processors

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