IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-37270-4_41.html
   My bibliography  Save this book chapter

Ant Colony Algorithm-Based Mixed-Model Assembly Line

In: The 19th International Conference on Industrial Engineering and Engineering Management

Author

Listed:
  • Yong-feng Xiong

    (Nanjing University of Science & Technology)

  • Wen-sheng Yang

    (Nanjing University of Science & Technology)

Abstract

The existenceFoundation item: This work is supported by National High-Tech. R&D Program of China under Grant NO. 2011AA040603, Natural Science Foundation of China under Grant NO. 70871060 and the Fundamental Research Funds for the Central Universities of China NO. NUST 2011XQTR10. of common tasks among models is a major feature of the mixed-model assembly line, traditional research were always done without precedence conflicts, so that the problem is simplified. However, the different production processes for different products often lead to conflicts in the actual production. The problem considered in this paper is how some common tasks can be duplicated to improve a mixed-model assembly line considering the precedence conflicts among common tasks for different products. Model was subjected to the constraint of precedence, assignment and cycle time; the objective function combined the efficiency with the smoothing index which can effectively distinguish the same number of workstations solutions. In addition, an ant colony algorithm with hybrid search mechanism is designed. Finally, the proposed mathematical models are illustrated and validated by means of a numerical illustration.

Suggested Citation

  • Yong-feng Xiong & Wen-sheng Yang, 2013. "Ant Colony Algorithm-Based Mixed-Model Assembly Line," Springer Books, in: Ershi Qi & Jiang Shen & Runliang Dou (ed.), The 19th International Conference on Industrial Engineering and Engineering Management, edition 127, chapter 0, pages 423-436, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-37270-4_41
    DOI: 10.1007/978-3-642-37270-4_41
    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:sprchp:978-3-642-37270-4_41. 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.