Notes on max flow time minimization with controllable processing times

DOI10.1007/S00607-003-0029-ZMaRDI QIDQ1422222zbMATH OpenOpenAlexFDO

Authors 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

approximation algorithmscontrollable processing timesparallel machinesScheduling

Mathematics Subject Classification ID

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

Recommendations

• Pre-emptive scheduling problems with controllable processing times
• A two-machine flow shop scheduling problem with controllable job processing times
• Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
• Approximation schemes for parallel machine scheduling problems with controllable processing times
• Preemptive scheduling on uniform parallel machines with controllable job processing times

Cited in

(6)

• Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach
• A survey of scheduling with controllable processing times
• On Minimizing Flow Time on Processors with Variable Unit Processing Time
• A tabu search algorithm for unspecified parallel machine scheduling with shift consideration
• Pre-emptive scheduling problems 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1422222)