An approximation result for a duo-processor task scheduling problem

DOI10.1016/S0020-0190(96)00196-2zbMath1336.68020OpenAlexW1978236645MaRDI QIDQ286992

Stefano Giordani, Paolo Dell'Olmo, 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 complexityschedulingparallel processingcoloringapproximation algorithms

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)

Related Items

An approximation result for the interval coloring problem on claw-free chordal graphs, An approximation result for a duo-processor task scheduling problem, Graph models for scheduling systems with machine saturation property, Complexity and approximation results for scheduling multiprocessor tasks on a ring., An approximation result for a periodic allocation problem

Cites Work

• An approximation result for a duo-processor task scheduling problem
• The complexity of scheduling independent two-processor tasks on dedicated processors
• Scheduling Problems with a Singular Solution
• Nonpreemptive scheduling of independent tasks with prespecified processor allocations
• Unnamed Item
• Unnamed Item