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

A Multi-stage and Parallel-Machine Scheduling Problem for Solar Cell Industry

In: Proceedings of 2012 3rd International Asia Conference on Industrial Engineering and Management Innovation (IEMI2012)

Author

Listed:
  • Li-chih Wang

    (Tunghai University)

  • Chen-yang Cheng

    (Tunghai University)

  • Tzu-li Chen

    (Fu Jen Catholic University)

  • Yin-yann Chen

    (National Formosa University)

  • Chung-chun Wang

    (Tunghai University)

Abstract

This paper studies a multi-stage and parallel-machines scheduling problem which is similar to the traditional hybrid flow shop scheduling (HFS) in the solar cell industry. The multi-stage and parallel-machines scheduling problem in the solar cell industry simultaneously determines the optimal production sequence, multiprocessor task scheduling and machine configurations through dynamically allocating all jobs to multiple machines. We formulate this problem as a mixed integer linear programming model considering the practical characteristics and constraints. A hybrid-coded genetic algorithm is developed to find a near-optimal solution. Preliminary computational study indicates that the developed algorithm not only provides good quality solutions.

Suggested Citation

  • Li-chih Wang & Chen-yang Cheng & Tzu-li Chen & Yin-yann Chen & Chung-chun Wang, 2013. "A Multi-stage and Parallel-Machine Scheduling Problem for Solar Cell Industry," Springer Books, in: Runliang Dou (ed.), Proceedings of 2012 3rd International Asia Conference on Industrial Engineering and Management Innovation (IEMI2012), edition 127, chapter 0, pages 201-212, Springer.
  • Handle: RePEc:spr:sprchp:978-3-642-33012-4_21
    DOI: 10.1007/978-3-642-33012-4_21
    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-33012-4_21. 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.