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

A Bottleneck Detection Algorithm for Complex Product Assembly Line Based on Maximum Operation Capacity

Author

Listed:
  • Dongping Zhao
  • Xitian Tian
  • Junhao Geng

Abstract

Because of the complex constraints in complex product assembly line, existing algorithms not always detect bottleneck correctly and they have a low convergence rate. In order to solve this problem, a hybrid algorithm of adjacency matrix and improved genetic algorithm (GA) was proposed. First, complex assembly network model (CANM) was defined based on operation capacity of each workstation. Second, adjacency matrix was proposed to convert bottleneck detection of complex assembly network (CAN) into a combinatorial optimization problem of max-flow. Third, an improved GA was proposed to solve this max-flow problem by retaining the best chromosome. Finally, the min-cut sets of CAN were obtained after calculation, and bottleneck workstations were detected according to the analysis of min-cut sets. A case study shows that this algorithm can detect bottlenecks correctly and its convergence rate is high.

Suggested Citation

  • Dongping Zhao & Xitian Tian & Junhao Geng, 2014. "A Bottleneck Detection Algorithm for Complex Product Assembly Line Based on Maximum Operation Capacity," Mathematical Problems in Engineering, Hindawi, vol. 2014, pages 1-9, May.
    • Handle: RePEc:hin:jnlmpe:258173
    DOI: 10.1155/2014/258173
    as

    Download full text from publisher

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