Polynomial algorithm for parallel machine mean flow time scheduling problem with release dates

Authors:
Peter Brucker;Svetlana A. Kravchenko
Affiliations:
Fachbereich Mathematik/Informatik, Universität Osnabrück, Osnabrück, Germany;United Institute of Informatics Problems, Minsk, Belarus
Venue:
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Year:
2005

Citing 7
Cited 1

Preemptive scheduling of equal length jobs on two machines to minimize mean flow time

Operations Research
Preemptive scheduling to minimize mean weighted flow time

Information Processing Letters
Minimizing mean flow time with release time constraint

Theoretical Computer Science
On the complexity of minimizing the number of late jobs in unit time open shop

Discrete Applied Mathematics
Scheduling Algorithms

Scheduling Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Minimizing the total completion time in a unit-time open shop with release times

Operations Research Letters

Preemptive scheduling on uniform machines to minimize mean flow time

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we give a polynomial algorithm for the problem P | ri, pi=p, pmtn | ∑ Ci. This result is applied to derive a polynomial algorithm for the problem O | ri, pij=1| ∑ Ci.