Portal de Periódicos da CAPES

Flow-Shop Scheduling with the Branch-and-Bound Method

1967; Institute for Operations Research and the Management Sciences; Volume: 15; Issue: 3 Linguagem: Inglês

10.1287/opre.15.3.473

1526-5463

Graham McMahon, P. G. Burton,

Assembly Line Balancing Optimization

The branch-and-bound technique has been applied to the three machine flow shop problem where the objective is to minimize makespan. A new method of obtaining the bound has been developed. Rules for ordering the machines and listing the jobs prior to application of the algorithm have been proposed. Computational results are given for a large number of job sets up to 10 jobs, and for a few cases up to 45 jobs.