Minimizing flow time on a constant number of machines with preemption
type: Item
instance of: scholarly article
title: Minimizing flow time on a constant number of machines with preemption
zbMATH Open document ID: 1140.90389
author: N. Bansal
published in: Operations Research Letters
publication date: 2005-06-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 2173507
zbMATH Keywords: Flow time
zbMATH Keywords: Approximation schemes
zbMATH Keywords: Multiple machines
zbMATH Keywords: Preemption
zbMATH Keywords: Scheduling
MaRDI profile type: Publication
full work available at URL: j.orl.2004.07.008
OpenAlex ID: W2147877827
cites work: Minimizing the flow time without migration
cites work: Q4250192
cites work: Approximation schemes for preemptive weighted flow time
cites work: Minimizing mean flow time with release time constraint
cites work: Q4198056
cites work: Q3840371
cites work: Improved approximation schemes for scheduling unrelated parallel machines
cites work: Q4228496
cites work: Approximation algorithms for scheduling unrelated parallel machines
cites work: Q4526975
cites work: Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
cites work: Polynomial time approximation algorithms for machine scheduling: Ten open problems
DOI: 10.1016/J.ORL.2004.07.008
description: scientific article; zbMATH DE number 2173507