IDEAS home Printed from https://ideas.repec.org/a/taf/nmcmxx/v24y2018i2p170-181.html
   My bibliography  Save this article

Minimizing total earliness and tardiness on re-entrant batch processing machine with time windows

Author

Listed:
  • Wenyou Jia
  • Hao Chen
  • Li Liu
  • You Li

Abstract

The time window (TW) generalizes the concept of due date. The semiconductor wafer fabrication system is currently one of the most complex production processes, which has typical re-entrant batch processing machine (RBPM). RBPM is a bottleneck. This paper addresses a scheduling of RBPM with job-dependent TWs. According to a general modelling, an improved and new job-family-oriented modelling of the decomposition method that is based on the slack mixed integer linear programming is proposed. First, the complicated scheduling problem of RBPM is divided into sub-problems, which are executed circularly. Then, each one consists of updating, sequencing and dispatching. The objective is to minimize the total earliness and tardiness for job-dependent TWs. In order to evaluate the proposed modelling, the experiments are implemented on the real-time scheduling simulation platform and optimization toolkit ILOG CPLEX. The results show that the improved modelling obtains better solutions in less computation time.

Suggested Citation

  • Wenyou Jia & Hao Chen & Li Liu & You Li, 2018. "Minimizing total earliness and tardiness on re-entrant batch processing machine with time windows," Mathematical and Computer Modelling of Dynamical Systems, Taylor & Francis Journals, vol. 24(2), pages 170-181, March.
    • Handle: RePEc:taf:nmcmxx:v:24:y:2018:i:2:p:170-181
    DOI: 10.1080/13873954.2017.1394327
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/13873954.2017.1394327
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/13873954.2017.1394327?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:taf:nmcmxx:v:24:y:2018:i:2:p:170-181. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/NMCM20 .

    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.