Branch and bound technique for two stage flow shop scheduling model with equipotential machines at every stage
by Deepak Gupta; Sonia Goel
International Journal of Operational Research (IJOR), Vol. 44, No. 4, 2022

Abstract: Among the different jobs in manufacturing industries job scheduling is one of the most significant at the performance judgment level to facilitate organisation to attain competitiveness. Scheduling consist in allotment of limited resources to jobs over time in order to achieve one or more optimisation objectives. Scheduling has been mostly investigated in case of single machine at each stage or several machine at one stage and sole machine at rest of the stages. This study proposes an exact branch and bound algorithm to schedule n-jobs on two machines with parallel equipotential machines at every phase. The purpose of this work is to find best possible schedule of jobs with the intention to diminish the entire elapsed time and allocate in an optimal mode the lead time of the jobs to parallel equipotential machines of both the type so that total cost of doing all the jobs is minimised.

Online publication date: Wed, 31-Aug-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com