On the Job-Shop Scheduling Problem

Alan Manne

Operations Research, 1960, vol. 8, issue 2, 219-223

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 noninterference 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 [Bowman, E. H. 1959. The schedule-sequencing problem. Opns Res. 7 621--624; Wagner, H. 1959. An integer linear-programming model for machine scheduling. Naval Res. Log. Quart. (June).], and on these grounds may be worth some computer experimentation.

Date: 1960
References: Add references at CitEc
Citations: View citations in EconPapers (41)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.8.2.219 (application/pdf)

Related works:
Working Paper: On the Job Shop Scheduling Problem (1959)
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:oropre:v:8:y:1960:i:2:p:219-223

Access Statistics for this article

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