scientific article; zbMATH DE number 962288

MaRDI QIDQ5690638zbMATH OpenFDO

Authors Paolo Dell'Olmo, Maria Grazia Speranza

Publication date 7 January 1997

zbMATH Keywords

makespanprecedence constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Nonpreemptive scheduling of independent tasks with prespecified processor allocations
• Review of properties of different precedence graphs for scheduling problems
• Multiprocessor scheduling under precedence constraints: polyhedral results
• Scheduling Multiprocessor Tasks to Minimize Schedule Length

Cited in

(16)

• A polynomial algorithm for recognizing the \(\mathcal A\)-order class
• Efficiency and effectiveness of normal schedules on three dedicated processors
• Scheduling loosely connected task graphs.
• Scheduling groups of tasks with precedence constraints on three dedicated processors.
• Review of properties of different precedence graphs for scheduling problems
• Multiprocessor scheduling under precedence constraints: polyhedral results
• Optimal preemptive scheduling in multiprocessor systems with incomplete communication graph
• A Simplified Anomaly and Reduction for Precedence Constrained Multiprocessor Scheduling
• Application of digraph theory to process scheduling
• scientific article; zbMATH DE number 4154199 (Why is no real title available?)
• scientific article; zbMATH DE number 1264424 (Why is no real title available?)
• scientific article; zbMATH DE number 2080870 (Why is no real title available?)
• A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs
• A Precedence Graph Algorithm for the Shop Scheduling Problem
• Almost nonpreemptive schedules
• A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints

This page was built for publication:

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