Convex resource allocation for minimizing the makespan in a single machine with job release dates

Research output: Contribution to journalArticlepeer-review

32 Scopus citations

Abstract

We consider the problem of scheduling jobs on a single machine where job-processing times are controllable through the allocation of a common limited resource. The release dates are known and the job-processing time is described by a convex decreasing resource consumption function. Our objective is to simultaneously determine the optimal job permutation and the resource allocation, such that the maximal completion time is minimized. We provide an O(n) time optimization algorithm for the case of identical job release dates, and an O(n2) time optimization algorithm for the case of non-identical job release dates.

Original languageEnglish
Pages (from-to)1481-1489
Number of pages9
JournalComputers and Operations Research
Volume31
Issue number9
DOIs
StatePublished - 1 Aug 2004

Keywords

  • Convex resource allocation
  • Release dates and optimization
  • Single machine scheduling

ASJC Scopus subject areas

  • Computer Science (all)
  • Modeling and Simulation
  • Management Science and Operations Research

Fingerprint

Dive into the research topics of 'Convex resource allocation for minimizing the makespan in a single machine with job release dates'. Together they form a unique fingerprint.

Cite this