Scheduling to minimize release‐time resource consumption and tardiness penalties

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

Naval Research Logistics (NRL), 1995, vol. 42, issue 6, 949-966

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.

Date: 1995
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199509)42:63.0.CO;2-3

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:42:y:1995:i:6:p:949-966

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().