Minimizing total completion time on uniform machines with deadline constraints

Authors:
Teofilo F. Gonzalez;Joseph Y.-T. Leung;Michael Pinedo
Affiliations:
University of California, Santa Barbara, Santa Barbara, CA;New Jersey Institute of Technology, Newark, NJ;Stern School of Business, New York University, New York, NY
Venue:
ACM Transactions on Algorithms (TALG)
Year:
2006

Citing 8
Cited 0

Preemptive scheduling of uniform machines by ordinary network flow techniques

Management Science
Minimizing mean flow time with release time constraint

Theoretical Computer Science
Minimizing mean flow time with release time and deadline constraints

Journal of Algorithms
Preemptive Scheduling of Uniform Processor Systems

Journal of the ACM (JACM)
Scheduling Independent Tasks with Due Times on a Uniform Processor System

Journal of the ACM (JACM)
Optimal scheduling of independent tasks on heterogeneous computing systems

ACM '74 Proceedings of the 1974 annual conference - Volume 1
Minimizing Total Completion Time on Parallel Machines with Deadline Constraints

SIAM Journal on Computing
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consider n independent jobs and m uniform machines in parallel. Each job has a processing requirement and a deadline. All jobs are available for processing at time t = 0. Job j must complete its processing before or at its deadline and preemptions are allowed. A set of jobs is said to be feasible if there exists a schedule that meets all the deadlines. We present a polynomial-time algorithm that given a feasible set of jobs, constructs a schedule that minimizes the total completion time ∑Cj. In the classical α | β | γ scheduling notation, this problem is referred to as Qm | prmt, &dmacr;j | ∑Cj. It is well known that a generalization of this problem with regard to its machine environment results in an NP-hard problem.