Minimizing mean weighted execution time loss on identical and uniform processors
type: Item
instance of: scholarly article
title: Minimizing mean weighted execution time loss on identical and uniform processors
zbMATH Open document ID: 0626.90037
DOI: 10.1016/0020-0190(87)90145-1
author: Jacek Blazewicz
author: Gerd Finke
published in: Information Processing Letters
publication date: 1987-01-01T00:00:00Z
review text: The problem of minimizing mean weighted execution time loss is formulated within a real-time process control system framework. The authors propose a strongly polynomial algorithm based on a network flow technique, which minimizes the above criterion for an arbitrary number of identical as well as uniform processors. The upper bounds on the numbers of preemptions in both cases are also given.
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 4018749
zbMATH Keywords: deadlines
zbMATH Keywords: mean weighted execution time loss
zbMATH Keywords: strongly polynomial algorithm
zbMATH Keywords: network flow technique
Wikidata QID: Q57387920
MaRDI profile type: Publication
full work available at URL: 0020-0190(87)90145-1
OpenAlex ID: W1982759900
cites work: Q4136574
cites work: Q3680271
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
cites work: Preemptive Scheduling of Uniform Processor Systems
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Some simple scheduling algorithms
cites work: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
cites work: Q3929047
cites work: An \(O(IVI^3)\) algorithm for finding maximum flows in networks
cites work: Scheduling with deadlines and loss functions
cites work: Towards a Genuinely Polynomial Algorithm for Linear Programming
cites work: Q3678944
description: scientific article; zbMATH DE number 4018749