IDEAS home Printed from https://ideas.repec.org/a/ids/eujine/v7y2013i5p529-557.html
   My bibliography  Save this article

Minimising the total weighted tardiness for non-identical parallel batch processing machines with job release times and non-identical job sizes

Author

Listed:
  • Fuh-Der Chou

Abstract

This paper investigates a scheduling problem of non-identical parallel batch processing machines (PBPMs) with job release times and non-identical job sizes, in which jobs come from compatible product families, to minimise the total weighted tardiness (TWT). Only a few studies on PBPM problems aimed at minimising the TWT are concerned with compatible product families. A mixed integer programming (MIP) model is formulated, and a multi-MIP approach is proposed based on this model. Given the computational difficulty in directly solving the multi-MIP approach, several heuristics are developed based on dispatching rules, dynamic programming methods, and simulated annealing (SA) algorithms. Computational results reveal that the proposed SA algorithms can obtain the optimal solutions for 99.8% of the tested small-scale (n = 10) problems and they significantly outperform the dispatching rule heuristics because the solution space is enlarged by the composite list and swapping method. [Received 11 May 2011; Revised 9 September 2011; Revised 31 December 2011; Accepted 16 January 2012]

Suggested Citation

  • Fuh-Der Chou, 2013. "Minimising the total weighted tardiness for non-identical parallel batch processing machines with job release times and non-identical job sizes," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 7(5), pages 529-557.
    • Handle: RePEc:ids:eujine:v:7:y:2013:i:5:p:529-557
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=57380
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Nascimento, Paulo Jorge & Silva, Cristóvão & Antunes, Carlos Henggeler & Moniz, Samuel, 2024. "Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems," European Journal of Operational Research, Elsevier, vol. 317(1), pages 92-110.
    2. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    3. Husseinzadeh Kashan, Ali & Ozturk, Onur, 2022. "Improved MILP formulation equipped with valid inequalities for scheduling a batch processing machine with non-identical job sizes," Omega, Elsevier, vol. 112(C).
    4. Chung-Ho Su & Jen-Ya Wang, 2022. "A Branch-and-Bound Algorithm for Minimizing the Total Tardiness of Multiple Developers," Mathematics, MDPI, vol. 10(7), pages 1-24, April.

    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:ids:eujine:v:7:y:2013:i:5:p:529-557. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=210 .

    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.