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

Minimising makespan of batch processing machine with unequal ready times

Author

Listed:
  • Leena Ghrayeb
  • Shanthi Muthuswamy
  • Purushothaman Damodaran

Abstract

This research considers scheduling a single batch processing machine at a contract electronics manufacturer. The processing times, ready times and the sizes of the jobs are given and the total size of the batch should not exceed the machine capacity. The batch ready time is equal to the latest ready time of all the jobs in the batch. The objective is to minimise the makespan. The commercial solver used to solve the mathematical formulation proposed requires long run times. Consequently, several heuristics and lower bounding procedures are proposed. Through an experimental study, it is shown that one of the lower bounds is within 40% of the best known integer solution from CPLEX for the 200-job instances. The heuristics are very effective in finding good quality solutions with short run times. For smaller problem instances, the quality of the heuristic solution is within 10% of the best known solution from CPLEX.

Suggested Citation

  • Leena Ghrayeb & Shanthi Muthuswamy & Purushothaman Damodaran, 2022. "Minimising makespan of batch processing machine with unequal ready times," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 40(4), pages 496-512.
    • Handle: RePEc:ids:ijisen:v:40:y:2022:i:4:p:496-512
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=122823
    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:40:y:2022:i:4:p:496-512. 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.