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 ...

This algorithm utilizes a decomposition approach. It iterates between a linear programming transportation problem which optimally allocates previously set plant production quantities to various ...