IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v13y2012i3p281-294.html
   My bibliography  Save this article

Optimum process plan selection via branch-and-bound algorithm in an automated manufacturing environment

Author

Listed:
  • Maghsud Solimanpur
  • Hossein Sattari
  • Amir Musa Abazari

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.

Suggested Citation

  • Maghsud Solimanpur & Hossein Sattari & Amir Musa Abazari, 2012. "Optimum process plan selection via branch-and-bound algorithm in an automated manufacturing environment," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 13(3), pages 281-294.
    • Handle: RePEc:ids:ijores:v:13:y:2012:i:3:p:281-294
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=45665
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijores:v:13:y:2012:i:3:p:281-294. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.