If you need an accessible version of this item please contact JSTOR User Support

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

E. L. Lawler and J. M. Moore
Management Science
Vol. 16, No. 1, Theory Series (Sep., 1969), pp. 77-84
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/2628367
Page Count: 8
  • Download PDF
  • Cite this Item

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support
A Functional Equation and Its Application to Resource Allocation and Sequencing Problems
Preview not available

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.

Page Thumbnails

  • Thumbnail: Page 
77
    77
  • Thumbnail: Page 
78
    78
  • Thumbnail: Page 
79
    79
  • Thumbnail: Page 
80
    80
  • Thumbnail: Page 
81
    81
  • Thumbnail: Page 
82
    82
  • Thumbnail: Page 
83
    83
  • Thumbnail: Page 
84
    84