TY - JOUR

T1 - Scheduling jobs to minimize total cost

AU - Chen, Y. L.

PY - 1994/4/7

Y1 - 1994/4/7

N2 - The problem of preemptively scheduling a set of independent jobs with release times and deadlines to a set of parallel identical processors is a well-known scheduling problem. In this paper, we extend this famous problem by adding the consideration that the processing requirement of each job is not a fixed quantity but is a linear function of cost. We assume that the more cost we pay, the less processing requirement there is. Under this new assumption, our goal is to use the minimum cost to complete all jobs subject to their processing conditions. Two polynomial algorithms are developed for this new variant of scheduling problem.

AB - The problem of preemptively scheduling a set of independent jobs with release times and deadlines to a set of parallel identical processors is a well-known scheduling problem. In this paper, we extend this famous problem by adding the consideration that the processing requirement of each job is not a fixed quantity but is a linear function of cost. We assume that the more cost we pay, the less processing requirement there is. Under this new assumption, our goal is to use the minimum cost to complete all jobs subject to their processing conditions. Two polynomial algorithms are developed for this new variant of scheduling problem.

KW - Deterministic scheduling

KW - Maximum flow problem

KW - Min-cost flow problem

UR - http://www.scopus.com/inward/record.url?scp=0028410081&partnerID=8YFLogxK

U2 - 10.1016/0377-2217(94)90208-9

DO - 10.1016/0377-2217(94)90208-9

M3 - 期刊論文

AN - SCOPUS:0028410081

VL - 74

SP - 111

EP - 119

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 1

ER -