Scheduling chains to minimize mean flow time

DOI10.1016/S0020-0190(97)00037-9zbMath1337.68128MaRDI QIDQ290213

Paolo Dell'Olmo, Moshe Dror, Wiesław X. Kubiak

Publication date: 1 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

computational complexitycombinatorial problemsanalysis of algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Single-machine scheduling with precedence constraints and position-dependent processing times, `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders, Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints, A review of four decades of time-dependent scheduling: main results, new topics, and open problems, Inequality-sum: a global constraint capturing the objective function, REAL-TIME DISPATCHING: SCHEDULING STABILITY AND PRECEDENCE, Single-machine scheduling problems with precedence constraints and simple linear deterioration

Cites Work

• Unnamed Item
• Unnamed Item
• New results on the completion time variance minimization
• Scheduling chain-structured tasks to minimize makespan and mean flow time
• Scheduling independent tasks to reduce mean finishing time