scientific article; zbMATH DE number 227414

MaRDI QIDQ5286847zbMATH OpenFDO

Authors Alekos Triantafyllakis, Spyros G. Tzafestas

Publication date 1 September 1993

zbMATH Keywords

heuristic algorithmstask schedulinggeometric progressionlongest processing time

Mathematics Subject Classification ID

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

Recommendations

• Scheduling Independent Tasks on Uniform Processors
• Update on the asymptotic optimality of LPT
• Tighter bound for MULTIFIT scheduling on uniform processors
• Parametric bounds for LPT scheduling on uniform processors
• Performance of the LPT algorithm in multiprocessor scheduling

Cited in

(1)

• A binary-rounding heuristic for multi-period variable-task-duration assignment problems

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