Scheduling to minimize release‐time resource consumption and tardiness penalties

Chung‐Lun Li*, Edward C. Sewell, T. C.E. Cheng

*Corresponding author for this work

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

12 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. © 1995 John Wiley & Sons, Inc. Copyright © 1995 Wiley Periodicals, Inc., A Wiley Company
Original languageEnglish
Pages (from-to)949-966
JournalNaval Research Logistics (NRL)
Volume42
Issue number6
DOIs
Publication statusPublished - Sept 1995
Externally publishedYes

Bibliographical note

Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

Fingerprint

Dive into the research topics of 'Scheduling to minimize release‐time resource consumption and tardiness penalties'. Together they form a unique fingerprint.

Cite this