IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v47y2015i12p1363-1378.html
   My bibliography  Save this article

Balanceable assembly lines with dynamic tool sharing and best matching decisions—a collaborative assembly framework

Author

Listed:
  • Mohsen Moghaddam
  • Shimon Y. Nof

Abstract

A Collaborative Assembly Framework (CAF), inspired by the design principles of the Collaborative Control Theory, is developed in this article to enhance the extent of balancing of assembly lines. The notion of the CAF lies in the dynamic utilization of idle resources to eliminate bottlenecks. The CAF is composed of two modules: the first one, the Tool Sharing Protocol (TShP), makes dynamic tool-sharing decisions among fully loaded (i.e., bottleneck) and partially loaded Work Stations (WSs), and the second one, the Best Matching Protocol (BMP), dynamically matches tasks and WSs (BMP-1) and partially and fully loaded WSs for tool sharing (BMP-2). A Multi-Objective Mixed-Integer Programming model is developed for mathematical representation and a Fuzzy Goal Programming approach is applied for optimization purposes. The objectives are to minimize (i) the number of WSs, (ii) cycle time, and (iii) the total collaboration cost. The developed CAF is proven to guarantee the relative extent of balancing of assembly lines, depending on pairwise tool compatibility and tool-sharing performance. Numerical experiments on a set of small-sized case studies repeated and expanded from previous research show the superiority of the CAF over the existing non-collaborative approaches in terms of line efficiency, utilization, and balancing.

Suggested Citation

  • Mohsen Moghaddam & Shimon Y. Nof, 2015. "Balanceable assembly lines with dynamic tool sharing and best matching decisions—a collaborative assembly framework," IISE Transactions, Taylor & Francis Journals, vol. 47(12), pages 1363-1378, December.
  • Handle: RePEc:taf:uiiexx:v:47:y:2015:i:12:p:1363-1378
    DOI: 10.1080/0740817X.2015.1027456
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2015.1027456
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/0740817X.2015.1027456?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    More about this item

    Statistics

    Access and download statistics

    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:taf:uiiexx:v:47:y:2015:i:12:p:1363-1378. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.