Graph models for scheduling systems with machine saturation property

DOI10.1007/S00186-005-0016-6zbMath1137.90486OpenAlexW2139977112MaRDI QIDQ883067

Paolo Dell'Olmo, Monica Gentili

Publication date: 31 May 2007

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-005-0016-6

zbMATH Keywords

Polynomial algorithmsMakespanIntersection graphsMultiprocessor task scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An approximation result for a duo-processor task scheduling problem
• Applications of edge coverings by cliques
• Efficiency and effectiveness of normal schedules on three dedicated processors
• On the fractional intersection number of a graph
• A characterization of perfect graphs

This page was built for publication: Graph models for scheduling systems with machine saturation property