Optimum process plan selection via branch-and-bound algorithm in an automated manufacturing environment Online publication date: Sun, 11-Jan-2015
by Maghsud Solimanpur; Hossein Sattari; Amir Musa Abazari
International Journal of Operational Research (IJOR), Vol. 13, No. 3, 2012
Abstract: Due to the accessibility of alternative machines, tools, fixtures and other auxiliary devices, process plan selection problem (PPSP) is one of the most important decision-making problems in manufacturing environments. Many studies have recently attempted this issue and proposed some models for optimum PPSP. In this paper, first, PPSP is formulated as a non-linear mathematical programming model with binary variables. Then a proposed branch-and-bound (B&B) algorithm is developed to find a global optimum solution for this problem. The objective function of the proposed model is to minimise the sum of total cost associated with the processing times and processing steps and dissimilarity cost between the selected plans. The effectiveness of the proposed B&B algorithm is illustrated by comparing its performance with that of some published approaches and Lingo solutions, by using several randomly generated problems. The results show that the proposed algorithm obtains very promising solutions.
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 Operational Research (IJOR):
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