Scheduling jobs to minimize total cost

Research output: Contribution to journalArticlepeer-review

11 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)111-119
Number of pages9
JournalEuropean Journal of Operational Research
Volume74
Issue number1
DOIs
StatePublished - 7 Apr 1994

Keywords

  • Deterministic scheduling
  • Maximum flow problem
  • Min-cost flow problem

Fingerprint

Dive into the research topics of 'Scheduling jobs to minimize total cost'. Together they form a unique fingerprint.

Cite this