Branch and bound technique for two stage flow shop scheduling model with equipotential machines at every stage

Deepak Gupta and Sonia Goel

International Journal of Operational Research, 2022, vol. 44, issue 4, 462-472

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.

Keywords: scheduling; elapsed time; equipotential machines; operating cost. (search for similar items in EconPapers)
Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=125132 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:44:y:2022:i:4:p:462-472

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().