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

The Research and Application of a Dynamic Dispatching Rule Selection Approach Based on BPSO-SVM for Semiconductor Production Line

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

Author

Listed:
  • Kuo Tian

    (Tongji University)

  • Yu-min Ma

    (Tongji University)

  • Fei Qiao

    (Tongji University)

Abstract

Reasonable choice of scheduling strategies to optimize the process of production scheduling is an effective way to improve the economic benefit and market competitiveness of manufacturing enterprises. This paper proposes a BPSO-SVM-based dynamic scheduling rule selection approach for semiconductor production line. This approach combines with feature selection algorithm based on semiconductor production attributes and dispatching rule classification algorithm. It finds appropriate feature subsets and SVM parameters by feature selection algorithm and finds real-time optimal scheduling rules effectively under one better performance according to the status of the production line in a SVM classification model by classification algorithm. Finally, the approach is verified on Mini-fab, a typical model of semiconductor production line.

Suggested Citation

  • Kuo Tian & Yu-min Ma & Fei Qiao, 2013. "The Research and Application of a Dynamic Dispatching Rule Selection Approach Based on BPSO-SVM for Semiconductor Production 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 487-495, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-37270-4_47
    DOI: 10.1007/978-3-642-37270-4_47
    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_47. 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.