An Algorithm for Solving the Job-Shop Problem

1989807 citationsJournal Article

Authors

Jacques Carlier · Université de Technologie de Compiègne

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 × 10 job-shop problem proposed by Muth and Thompson in 1963.

Topics & Keywords

Scheduling and Optimization Algorithms Optimization and Search Problems Advanced Manufacturing and Logistics Optimization

UN Sustainable Development Goals

Decent work and economic growth

Publication Details

Published in: Management Science

Volume 35, Issue 2, pp. 164-176

DOI: 10.1287/mnsc.35.2.164

Field-Weighted Citation Impact: 15.45