scientific article; zbMATH DE number 1783868

MaRDI QIDQ4546239zbMATH OpenFDO

Authors Gaurav Singh, Yakov Zinder

Publication date 19 August 2002

zbMATH Keywords

makespan minimizationHu's algorithmscheduling unit execution time jobstight upper bound for the Brucker-Garey-Johnson algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Performance of critical path type algorithms with communication delay
• Performance of critical path type algorithms for scheduling on parallel processors
• The worst-case analysis of the Garey-Johnson algorithm
• scientific article; zbMATH DE number 4072371
• Tight performance bounds of CP-scheduling on out-trees

Cited in

(5)

• Performance of critical path type algorithms with communication delay
• scientific article; zbMATH DE number 1094170 (Why is no real title available?)
• Performance of critical path type algorithms for scheduling on parallel processors
• scientific article; zbMATH DE number 4072371 (Why is no real title available?)
• The worst-case analysis of the Garey-Johnson algorithm

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 Q4546239)