A Functional Equation and its Application to Resource Allocation and Sequencing Problems

E. L. Lawler and J. M. Moore
Additional contact information
E. L. Lawler: The University of Michigan, currently visiting the University of California at Berkeley
J. M. Moore: Esso Mathematics and Systems, Incorporated

Management Science, 1969, vol. 16, issue 1, 77-84

Abstract: A functional equation, similar to that formulated for the knapsack problem, is applied to the solution of a problem of resource allocation in critical path scheduling, and to a variety of single-machine sequencing problems with deadlines and loss functions. Among these are: minimization of the weighted number of tardy jobs, maximization of weighted earliness, minimization of tardiness with respect to common relative and absolute deadlines, and minimization of weighted tardiness with respect to a common deadline. Extensions to multiple-machine sequencing problems are discussed, and the sequencing of two machines in series is treated in detail.

Date: 1969
References: Add references at CitEc
Citations: View citations in EconPapers (75)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.16.1.77 (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:16:y:1969:i:1:p:77-84

Access Statistics for this article

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