Preemptive scheduling to minimize mean weighted flow time
type: Item
instance of: scholarly article
title: Preemptive scheduling to minimize mean weighted flow time
zbMATH Open document ID: 0695.68029
DOI: 10.1016/0020-0190(90)90229-Q
author: Joseph Y.-T. Leung
author: Gilbert H. Young
published in: Information Processing Letters
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03D15
zbMATH DE Number: 4139283
zbMATH Keywords: NP-completeness
zbMATH Keywords: NP-hardness
zbMATH Keywords: preemptive scheduling
zbMATH Keywords: mean weighted flow time
MaRDI profile type: Publication
cites work: Scheduling independent tasks to reduce mean finishing time
cites work: Minimizing mean flow time with error constraint
cites work: Q4170510
cites work: Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time
cites work: Some simple scheduling algorithms
cites work: Q3217922
cites work: Q3929047
description: scientific article; zbMATH DE number 4139283