Minimizing total completion time on uniform machines with deadline constraints

Document Type

Article

Publication Date

1-1-2006

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, d̄j | Σ Cj. It is well known that a generalization of this problem with regard to its machine environment results in an NP-hard problem. © 2006 ACM.

Identifier

33745238676 (Scopus)

Publication Title

ACM Transactions on Algorithms

External Full Text Location

https://doi.org/10.1145/1125994.1126000

e-ISSN

15496333

ISSN

15496325

First Page

95

Last Page

115

Issue

1

Volume

2

This document is currently not available here.

Share

COinS