IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-3-319-94830-0_12.html
   My bibliography  Save this book chapter

Process Sequencing Problem in Distributed Manufacturing Process Planning

In: Optimization Problems in Graph Theory

Author

Listed:
  • Dusan Sormaz

    (Russ College of Engineering and Technology, Ohio University)

  • Arkopaul Sarkar

    (Russ College of Engineering and Technology, Ohio University)

Abstract

Process Sequencing, a subtask of generative process planning, involves the task of selecting the best process plan, which can minimize the time and cost of manufacturing a part, subassembly or assembly, out of a set of alternative process plans. A network can represent a set of alternative process plans where nodes of the network represent machining processes, connected by precedence relationships. This chapter begins by introducing different strategies of generating the process planning network, respecting various manufacturing constraints. Next, we describe various graph search methods based on space search techniques, in order to find the best planning route in the process planning network. We also present a novel transformation from process sequencing problem to Generalized Traveling Salesman Problem. We end this chapter with some experimental results on network size and computation time along with performance analysis of different optimal process sequence search algorithms described in this chapter.

Suggested Citation

  • Dusan Sormaz & Arkopaul Sarkar, 2018. "Process Sequencing Problem in Distributed Manufacturing Process Planning," Springer Optimization and Its Applications, in: Boris Goldengorin (ed.), Optimization Problems in Graph Theory, pages 293-324, Springer.
    • Handle: RePEc:spr:spochp:978-3-319-94830-0_12
    DOI: 10.1007/978-3-319-94830-0_12
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:spochp:978-3-319-94830-0_12. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.