Scheduling to minimize release‐time resource consumption and tardiness penalties

Research output: Journal article publicationJournal articleAcademic researchpeer-review

11 Citations (Scopus)

Abstract

We consider the problem of scheduling a set of jobs with a common due‐date 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 resource consumption and the total tardiness. While the problem is strongly NP‐hard in general, we discuss two different special cases for which special properties are identified and used to develop efficient pseudo‐polynomial time algorithms.
Original languageEnglish
Pages (from-to)949-966
Number of pages18
JournalNaval Research Logistics (NRL)
Volume42
Issue number6
DOIs
Publication statusPublished - 1 Jan 1995

ASJC Scopus subject areas

  • Modelling and Simulation
  • Ocean Engineering
  • Management Science and Operations Research

Cite this