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

Data Mining Based Approach for Jobshop Scheduling

In: Proceedings of 2013 4th International Asia Conference on Industrial Engineering and Management Innovation (IEMI2013)

Author

Listed:
  • Yan-hong Wang

    (Shenyang University of Technology)

  • Ye-hong Zhang

    (Shenyang University of Technology)

  • Yi-hao Yu

    (Shenyang University of Technology)

  • Cong-yi Zhang

    (Tianjin University)

Abstract

In manufacturing system, there usually have been some unpredictable dynamic events, which would make the production scheme invalid. Therefore, it’s necessary to inject some new vitality to traditional scheduling algorithms. To harness the power of complex real-world data in manufacturing processes, a jobshop scheduling algorithm basing on data mining technique is presented. This approach is explored in view of seeking knowledge that is assumed to be embedded in the historical production database. Under the proposed scheduling system framework, C4.5 program is used as a data mining algorithm for the induction of rule-set. A rule-based scheduling algorithm is elaborated on the basis of the elaborated data mining solutions. The objective is to explore the patterns in data generated by conventional intellectualized scheduling algorithm and hence to obtain a rule-set capable of approximating the efficient solutions in a dynamic job shop scheduling environment. Simulation results indicate the superiority of the suggested approach.

Suggested Citation

  • Yan-hong Wang & Ye-hong Zhang & Yi-hao Yu & Cong-yi Zhang, 2014. "Data Mining Based Approach for Jobshop Scheduling," Springer Books, in: Ershi Qi & Jiang Shen & Runliang Dou (ed.), Proceedings of 2013 4th International Asia Conference on Industrial Engineering and Management Innovation (IEMI2013), edition 127, pages 761-771, Springer.
  • Handle: RePEc:spr:sprchp:978-3-642-40060-5_73
    DOI: 10.1007/978-3-642-40060-5_73
    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-40060-5_73. 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.