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

Clarifying Cutting and Sewing Processes with Due Windows Using an Effective Ant Colony Optimization

Author

Listed:
  • Rong-Hwa Huang
  • Shun-Chi Yu

Abstract

The cutting and sewing process is a traditional flow shop scheduling problem in the real world. This two-stage flexible flow shop is often commonly associated with manufacturing in the fashion and textiles industry. Many investigations have demonstrated that the ant colony optimization (ACO) algorithm is effective and efficient for solving scheduling problems. This work applies a novel effective ant colony optimization (EACO) algorithm to solve two-stage flexible flow shop scheduling problems and thereby minimize earliness, tardiness, and makespan. Computational results reveal that for both small and large problems, EACO is more effective and robust than both the particle swarm optimization (PSO) algorithm and the ACO algorithm. Importantly, this work demonstrates that EACO can solve complex scheduling problems in an acceptable period of time.

Suggested Citation

  • Rong-Hwa Huang & Shun-Chi Yu, 2013. "Clarifying Cutting and Sewing Processes with Due Windows Using an Effective Ant Colony Optimization," Mathematical Problems in Engineering, Hindawi, vol. 2013, pages 1-12, March.
    • Handle: RePEc:hin:jnlmpe:182598
    DOI: 10.1155/2013/182598
    as

    Download full text from publisher

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