An approximation result for a duo-processor task scheduling problem

DOI10.1016/S0020-0190(96)00196-2MaRDI QIDQ286992zbMATH OpenOpenAlexFDO

Authors Paolo Dell'Olmo, Stefano Giordani, Maria Grazia Speranza

Publication date 26 May 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(96)00196-2

zbMATH Keywords

computational complexityapproximation algorithmsschedulingcoloringparallel processing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Recommendations

• scientific article; zbMATH DE number 1264424
• Scheduling multiprocessor tasks on three dedicated processors
• Approximation Algorithms For Scheduling On Uniform Processors
• Scheduling independent two processor tasks on a uniform duo-processor system
• General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• An approximation result for a duo-processor task scheduling problem
• Nonpreemptive scheduling of independent tasks with prespecified processor allocations
• Scheduling Problems with a Singular Solution
• The complexity of scheduling independent two-processor tasks on dedicated processors

Cited in

(8)

• An approximation result for the interval coloring problem on claw-free chordal graphs
• scientific article; zbMATH DE number 1264424 (Why is no real title available?)
• An approximation result for a duo-processor task scheduling problem
• Graph models for scheduling systems with machine saturation property
• Scheduling independent two processor tasks on a uniform duo-processor system
• An approximation result for a periodic allocation problem
• Complexity and approximation results for scheduling multiprocessor tasks on a ring.
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach

This page was built for publication: An approximation result for a duo-processor task scheduling problem

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