b9000A 1/4 approximate algorithm for P2/tree/Cmax

DOI10.1016/S0166-218X(96)00038-8MaRDI QIDQ5961607zbMATH OpenFDO

Authors Giorgio Gallo, Fulvio Piccinonno

Publication date 25 February 1997

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

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

zbMATH Keywords

heuristic algorithmprecedence relationtotal completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 3900151
• Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length
• An approximation algorithm for scheduling trees of malleable tasks
• Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints
• Approximate algorithms for the \(P\parallel C_{\max}\) problem

Cites work

• A New Algorithm for Preemptive Scheduling of Trees
• Bounds for Certain Multiprocessing Anomalies
• scientific article; zbMATH DE number 44978 (Why is no real title available?)
• Nonpreemptive LP-Scheduling on Homogeneous Multiprocessor Systems
• Scheduling chain-structured tasks to minimize makespan and mean flow time

This page was built for publication: b9000A 1/4 approximate algorithm for P2/tree/Cmax

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