IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/4536426.html
   My bibliography  Save this article

Minimizing the Cycle Time in Two-Sided Assembly Lines with Assignment Restrictions: Improvements and a Simple Algorithm

Author

Listed:
  • Zixiang Li
  • Qiuhua Tang
  • Liping Zhang

Abstract

The two-sided assembly line balancing problem type-II (TALBP-II) is of major importance for the reconfiguration of the two-sided assembly lines which are widely utilized to assemble large-size high-volume products. The TALBP-II is NP-hard, and some assignment restrictions in real applications make this problem much more complex. This paper provides an integer programming model for solving the TALBP-II with assignment restrictions optimally and utilizes a simple and effective iterated greedy (IG) algorithm to address large-size problems. This algorithm utilizes a new local search by considering precedence relationships between tasks in order to reduce the computational time. In particular, a priority-based decoding scheme is developed to handle these assignment restrictions and reduce sequence-dependent idle times by adjusting the priority values. Experimental comparison among the proposed decoding scheme and other published ones demonstrates the efficiency of the priority-based decoding. A comprehensive computational comparison among the IG algorithm and other eight recent algorithms proves effectiveness of the proposed IG algorithm.

Suggested Citation

  • Zixiang Li & Qiuhua Tang & Liping Zhang, 2016. "Minimizing the Cycle Time in Two-Sided Assembly Lines with Assignment Restrictions: Improvements and a Simple Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2016, pages 1-15, June.
    • Handle: RePEc:hin:jnlmpe:4536426
    DOI: 10.1155/2016/4536426
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2016/4536426.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2016/4536426.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2016/4536426?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
    ---><---

    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:hin:jnlmpe:4536426. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.