Branch and bound algorithm for identical parallel machine scheduling problem to maximise system availability Online publication date: Mon, 06-Jul-2020
by Asmaa Khoudi; Ali Berrichi
International Journal of Manufacturing Research (IJMR), Vol. 15, No. 3, 2020
Abstract: In the majority of production scheduling studies, the objective is to minimise a criterion which is generally, function of completion times of production jobs. However, for some manufacturing systems, the reliability/availability of machines can be the most important performance criteria towards decision makers. In this paper, we deal with a production scheduling problem on identical parallel machines and the objective is to find the best assignment of jobs on machines maximising the system availability. We assume that the production system can be subject to potentially costly failures then PM actions are performed at the end of production jobs. We have proposed a branch and bound algorithm, dominance rules and an efficient upper bound to solve the proposed model optimally. Computational experiments are carried out on randomly generated test problems and results show the efficiency of the proposed upper bound and dominance rules. [Submitted 23 December 2016; Accepted 27 October 2018]
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Manufacturing Research (IJMR):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook