Scheduling to minimize the total resource consumption with a constraint on the sum of completion times

Research output: Journal article publicationJournal articleAcademic researchpeer-review

20 Citations (Scopus)

Abstract

We consider the problem of scheduling a set of jobs on a single machine where the release time of a job is related to the amount of resource consumed. The objective is to minimize the total amount of resource consumed subject to a constraint on the sum of completion times of the jobs. We show that the problem is NP-hard in general and can be solved efficiently when the resource consumption function is linear. The parallel machine case is also discussed.
Original languageEnglish
Pages (from-to)381-388
Number of pages8
JournalEuropean Journal of Operational Research
Volume80
Issue number2
DOIs
Publication statusPublished - 19 Jan 1995
Externally publishedYes

Keywords

  • Release dates
  • Resource allocation
  • Scheduling
  • Sequencing

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Modelling and Simulation
  • Statistics, Probability and Uncertainty
  • Applied Mathematics
  • Transportation

Cite this