An Algorithm for Solving the Job-Shop Problem

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.

MoreLess

Year of publication:	1989
Authors:	Carlier, J. ; Pinson, E.
Published in:	Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 35.1989, 2, p. 164-176
Publisher:	Institute for Operations Research and the Management Sciences - INFORMS
Subject:	job shop scheduling \| branch-and-bound \| computational experiments

More details

Extent:	application/pdf
Type of publication:	Article
Other identifiers:	10.1287/mnsc.35.2.164 [DOI]
Source:	RePEc - Research Papers in Economics

Persistent link: https://ebvufind01.dmz1.zbw.eu/10009204214