Application of Branch and Bound Technique for 3-Stage Flow Shop Scheduling Problem with Transportation Time

Deepak Gupta


This paper provides a branch and bound technique to solve the three stage flow shop scheduling problem including transportation time. Algorithm is given to find optimal or near optimal sequence, minimizing the total elapsed time. This approach is very simple and easy to understand and, also provide an important tool for decision makers to design a schedule for three stage flow-shop scheduling problems. The method is clarified with the help of numerical illustration. Copyright ©

Keywords: Flow shop scheduling, Branch and Bound, Transportation time, Optimal sequence

Full Text: PDF
Download the IISTE publication guideline!

To list your conference here. Please contact the administrator of this platform.

Paper submission email:

ISSN (Paper)2224-6096 ISSN (Online)2225-0581

Please add our address "" into your email contact list.

This journal follows ISO 9001 management standard and licensed under a Creative Commons Attribution 3.0 License.

Copyright ©