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

• 저널Management Science · 35(2) · 164–176
• 토픽Scheduling and Optimization Algorithms · Industrial and Manufacturing Engineering
• DOI10.1287/mnsc.35.2.164
• 저자Jacques Carlier, Éric Pinson