scientific article; zbMATH DE number 1810114

MaRDI QIDQ3147950zbMATH OpenFDO

Authors Zhiyi Tan, Yong He

Publication date 30 September 2002

zbMATH Keywords

approximation algorithmsemi on-line schedulingworst-case ratio

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Ordinal on-line scheduling for maximizing the minimum machine completion time
• scientific article; zbMATH DE number 1932350
• Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times
• Ordinal algorithms for parallel machine scheduling
• scientific article; zbMATH DE number 1475019

Cited in

(7)

• Ordinal on-line scheduling for maximizing the minimum machine completion time
• Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times
• Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data
• Ordinal algorithms for parallel machine scheduling
• scientific article; zbMATH DE number 1696639 (Why is no real title available?)
• scientific article; zbMATH DE number 1757946 (Why is no real title available?)
• LPT online strategy for parallel-machine scheduling with kind release times

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