Optimal Sequencing of a Single Machine Subject to Precedence Constraints

E. L. Lawler
Additional contact information
E. L. Lawler: University of California, Berkeley

Management Science, 1973, vol. 19, issue 5, 544-546

Abstract: Suppose n jobs are each to be processed by a single machine, subject to arbitrary given precedence constraints. Associated with each job j is a known processing time a j , and a monotone nondecreasing cost function c j (t), giving the cost that is incurred by the completion of that job at time t. The problem is to find a sequence which will minimize the maximum of the incurred costs. An efficient computational procedure is given for this problem, generalizing and simplifying previous results of the present author and J. M. Moore.

Date: 1973
References: Add references at CitEc
Citations: View citations in EconPapers (74)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.19.5.544 (application/pdf)

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:inm:ormnsc:v:19:y:1973:i:5:p:544-546

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().