On Scheduling Problems with Deferral Costs

Eugene L. Lawler
Additional contact information
Eugene L. Lawler: The University of Michigan, Ann Arbor

Management Science, 1964, vol. 11, issue 2, 280-288

Abstract: A class of scheduling problems involving deferral costs has been formulated by McNaughton, who has described a simple method of solution for the linear, single-processor case. In this report dynamic programming and linear programming techniques are applied to nonlinear and multiple-processor problems. A dynamic programming solution of the nonlinear, single processor problem is possible, provided the number of jobs is small. Transportation methods of linear programming can be used to solve large nonlinear, multiple-processor problems, provided the processing times for the jobs are equal. Approximate and/or partial solutions are possible for other cases.

Date: 1964
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.11.2.280 (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:11:y:1964:i:2:p:280-288

Access Statistics for this article

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