Scheduling malleable tasks with interdependent processing rates: comments and observations

DOI10.1016/j.dam.2007.08.008zbMath1278.90144OpenAlexW2105845347WikidataQ59592388 ScholiaQ59592388MaRDI QIDQ2476250

Moshe Dror, James B. Orlin, Edmund Kieran Burke

Publication date: 18 March 2008

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

Full work available at URL: https://doi.org/10.1016/j.dam.2007.08.008

zbMATH Keywords

parallel machinesmalleable tasks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A unified view of parallel machine scheduling with interdependent processing rates

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling malleable tasks on parallel processors to minimize the makespan
• Scheduling multiprocessor tasks -- An overview
• On a methodology for discrete-continuous scheduling
• Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation
• Bounds on Multiprocessing Timing Anomalies
• Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions