An experimental study of algorithms for weighted completion time scheduling

DOI10.1007/S00453-001-0103-XzbMath0994.68175OpenAlexW1971700228MaRDI QIDQ1600998

Ivan D. Baev, Alexandre Eichenberger, Waleed M. Meleis

Publication date: 17 June 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-001-0103-x

zbMATH Keywords

combinatorial scheduling algorithmsweighted completion time scheduling problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Machine scheduling performance with maintenance and failure ⋮ Parallel machine scheduling with precedence constraints and setup times

This page was built for publication: An experimental study of algorithms for weighted completion time scheduling