Recent developments in the job‐shop scheduling problem

G. L. Thompson

Naval Research Logistics Quarterly, 1960, vol. 7, issue 4, 585-589

Abstract: The job‐shop scheduling problem is a large‐scale combinatorial problem of great practical significance. First, a discussion of the size of the combinatorial problem involved will be given. Then, the various methods of attacks for solving this problem will be discussed and criticized by the use of examples. These methods include principally the integral linear programming, the heuristic, the loading rule, the simulation, and the Monte Carlo methods. The latter method, in the form devised by Giffler and Thompson, will be described in detail, and some computational results will he presented.

Date: 1960
References: Add references at CitEc
Citations:

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

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:7:y:1960:i:4:p:585-589

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 ().