On the Job Shop Scheduling Problem

Alan Manne

No 73, Cowles Foundation Discussion Papers from Cowles Foundation for Research in Economics, Yale University

Abstract: This is a proposal for the application of discrete linear programming to the typical job shop scheduling problem -- one that involves both sequencing restrictions and also non-interference constraints for individual pieces of equipment. Thus far, no attempt has been made to establish the computational feasibility of the approach in the case of large-scale realistic problems. This formulation seems, however, to involve considerably fewer variables than two other recent proposals and on these grounds may be worth some computer experimentation.

Pages: 7 pages
Date: 1959
Note: CFP 145.
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Published in Operations Research (March-April 1960), 8(2): 219-223

Downloads: (external link)
https://cowles.yale.edu/sites/default/files/files/pub/d00/d0073.pdf (application/pdf)
Our link check indicates that this URL is bad, the error code is: 404 Not Found

Related works:
Journal Article: On the Job-Shop Scheduling Problem (1960)
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:cwl:cwldpp:73

Ordering information: This working paper can be ordered from
Cowles Foundation, Yale University, Box 208281, New Haven, CT 06520-8281 USA
The price is None.

Access Statistics for this paper

More papers in Cowles Foundation Discussion Papers from Cowles Foundation for Research in Economics, Yale University Yale University, Box 208281, New Haven, CT 06520-8281 USA. Contact information at EDIRC.
Bibliographic data for series maintained by Brittany Ladd ().