Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine

Research output: Contribution to journalArticlepeer-review

52 Scopus citations

Abstract

In this paper we extend the classical single-machine scheduling problem with the maximal lateness criterion to the case where the job processing times are controllable by allocating common limited resources. For the single resource problem we determine the optimal job sequence and resource allocation in O(n3) time, while for the two-resource problem the optimal solution is obtained in O(n3log(1/ε)) time, where ε is a given accuracy. For both cases, we assume a convex resource consumption function.

Original languageEnglish
Pages (from-to)1303-1315
Number of pages13
JournalComputers and Operations Research
Volume31
Issue number8
DOIs
StatePublished - 1 Jul 2004

Keywords

  • Optimization
  • Single-machine scheduling
  • Two-resource allocation

Fingerprint

Dive into the research topics of 'Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine'. Together they form a unique fingerprint.

Cite this