IDEAS home Printed from https://ideas.repec.org/a/ids/ijisen/v35y2020i1p80-99.html
   My bibliography  Save this article

Using GRASP approach and path relinking to minimise total number of tardy jobs on a single batch processing machine

Author

Listed:
  • Panteha Alipour
  • Purushothaman Damodaran
  • Christine Nguyen

Abstract

This paper considers scheduling a single batch processing machine such that the total number of tardy jobs is minimised. The machine can simultaneously process several jobs as a batch as long as the machine capacity is not violated. The batch processing time is equal to the largest processing time among those jobs in the batch. As the problem under study is NP-hard solving a mathematical formulation optimality is computationally intensive. A greedy randomised adaptive search procedure (GRASP) is proposed with the assumption of arbitrary job sizes, arbitrary processing times and arbitrary due dates. A novel construction phase for the GRASP approach is proposed to improve the solution quality. In addition, a path relinking procedure is proposed for solving large-sized problems effectively. The performance of the proposed GRASP approach is evaluated by comparing its results to a commercial solver and a construction heuristic. Experimental studies suggest that GRASP is superior compared to the commercial solver and the construction heuristic.

Suggested Citation

  • Panteha Alipour & Purushothaman Damodaran & Christine Nguyen, 2020. "Using GRASP approach and path relinking to minimise total number of tardy jobs on a single batch processing machine," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 35(1), pages 80-99.
    • Handle: RePEc:ids:ijisen:v:35:y:2020:i:1:p:80-99
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=106852
    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.

    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:ijisen:v:35:y:2020:i:1:p:80-99. 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=188 .

    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.