A note on minimizing the sum of quadratic completion times on two identical parallel machines

DOI10.1016/j.ipl.2012.06.011zbMath1248.68111OpenAlexW2066806043MaRDI QIDQ456107

Frederico Della Croce, Christos P. Koulamas

Publication date: 23 October 2012

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.06.011

zbMATH Keywords

schedulingparallel machinesquadratic completion times

Mathematics Subject Classification ID

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

Related Items (1)

A note on minimizing the sum of quadratic completion times on two identical parallel machines

Cites Work

• Unnamed Item
• Unnamed Item
• A note on minimizing the sum of quadratic completion times on two identical parallel machines
• Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
• Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
• The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
• Scheduling independent tasks to reduce mean finishing time

This page was built for publication: A note on minimizing the sum of quadratic completion times on two identical parallel machines