Sequencing many jobs on a multi‐purpose facility

John A. Buzacott and Sujit K. Dutta

Naval Research Logistics Quarterly, 1971, vol. 18, issue 1, 75-82

Abstract: Suppose a given set of jobs has to be processed on a multi‐purpose facility which has various settings or states. There is a choice of states in which to process a job and the cost of processing depends on the state. In addition, there is also a sequence‐dependent changeover cost between states. The problem is then to schedule the jobs, and pick an optimum setting for each job, so as to minimize the overall operating costs. A dynamic programming model is developed for obtaining an optimal solution to the problem. The model is then extended using the method of successive approximations with a view to handling large‐dimensioned problems. This extension yields good (but not necessarily optimal) solutions at a significant computational saving over the direct dynamic programming approach.

Date: 1971
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800180106

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:navlog:v:18:y:1971:i:1:p:75-82

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().