An Algorithm for Solving the Job-Shop Problem

J. Carlier and E. Pinson
Additional contact information
J. Carlier: Université de Technologie de Compiègne
E. Pinson: Institut de Mathématiques Appliquées d'Angers

Management Science, 1989, vol. 35, issue 2, 164-176

Abstract: In this paper, we propose a branch and bound method for solving the job-shop problem. It is based on one-machine scheduling problems and is made more efficient by several propositions which limit the search tree by using immediate selections. It solved for the first time the famous 10 \times 10 job-shop problem proposed by Muth and Thompson in 1963.

Keywords: job shop scheduling; branch-and-bound; computational experiments (search for similar items in EconPapers)
Date: 1989
References: Add references at CitEc
Citations: View citations in EconPapers (77)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.35.2.164 (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:35:y:1989:i:2:p:164-176

Access Statistics for this article

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