Scheduling with resource‐dependent release dates—a comparison of two different resource consumption functions

Chung‐Lun Li

Naval Research Logistics (NRL), 1994, vol. 41, issue 6, 807-819

Abstract: We consider the problem of scheduling a set of jobs 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 with a control on the completion times of the jobs. Four different variants of the problem are studied: (i) minimization of the total resource consumption subject to a common deadline for all jobs, (ii) minimization of the total resource consumption subject to a constraint on the total completion time of the jobs, (iii) minimization of the weighted total resource consumption and maximum job completion time, and (iv) minimization of the weighted total resource consumption and the total job completion time. We compare the common resource consumption function with the function where the resource consumed is proportional to the processing time of the job. We show that these two different resource consumption functions can give rise to very different solution methods and different computational complexities for the problem. © 1994 John Wiley & Sons, Inc.

Date: 1994
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199410)41:63.0.CO;2-8

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:41:y:1994:i:6:p:807-819

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 ().