Notes on max flow time minimization with controllable processing times

DOI10.1007/s00607-003-0029-zzbMath1036.68013OpenAlexW2055782123MaRDI QIDQ1422222

Monaldo Mastrolilli

Publication date: 5 February 2004

Published in: Computing (Search for Journal in Brave)

Full work available at URL: http://doc.rero.ch/record/314200/files/607_2003_Article_29.pdf

zbMATH Keywords

parallel machinesSchedulingapproximation algorithmscontrollable processing times

Mathematics Subject Classification ID

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

Related Items (3)

Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach ⋮ A survey of scheduling with controllable processing times ⋮ Preemptive scheduling on uniform parallel machines with controllable job processing times

This page was built for publication: Notes on max flow time minimization with controllable processing times