A note on minimizing the sum of quadratic completion times on two identical parallel machines
type: Item
instance of: scholarly article
title: A note on minimizing the sum of quadratic completion times on two identical parallel machines
zbMATH Open document ID: 1248.68111
published in: Information Processing Letters
publication date: 2012-10-23T00:00:00Z
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 6098078
zbMATH Keywords: parallel machines
zbMATH Keywords: scheduling
zbMATH Keywords: quadratic completion times
author: F. Della Croce
author: C. Koulamas
MaRDI profile type: Publication
full work available at URL: j.ipl.2012.06.011
OpenAlex ID: W2066806043
cites work: Scheduling independent tasks to reduce mean finishing time
cites work: Q4658190
cites work: Q4039929
cites work: Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
cites work: Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs
cites work: The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
cites work: Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
DOI: 10.1016/J.IPL.2012.06.011
description: scientific article; zbMATH DE number 6098078