Comparability graph augmentation for some multiprocessor scheduling problems

DOI10.1016/S0166-218X(96)00037-6zbMath0865.68006OpenAlexW1998806582MaRDI QIDQ5961606

No author found.

Publication date: 21 April 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

comparability graphperfect graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

An approximation result for the interval coloring problem on claw-free chordal graphs ⋮ Orienting graphs to optimize reachability ⋮ An approximation result for a periodic allocation problem

Cites Work

• The complexity of scheduling independent two-processor tasks on dedicated processors
• Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths
• Scheduling multiprocessor tasks on three dedicated processors
• Complexity of scheduling multiprocessor tasks with prespecified processors allocations
• Efficiency and effectiveness of normal schedules on three dedicated processors
• Nonpreemptive scheduling of independent tasks with prespecified processor allocations
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Comparability graph augmentation for some multiprocessor scheduling problems