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

A simulated annealing approach to minimise makespan in a hybrid flowshop with a batch processing machine

Author

Listed:
  • Santha Raja Kumari Upadhyayula
  • Shanthi Muthuswamy
  • Purushothaman Damodaran

Abstract

A two-stage hybrid flowshop with a batch processing machine (BPM) in stage 1 and a set of discrete processing machines in stage 2 is considered in this research. Job sizes and their processing times are given. The BPM can process multiple jobs simultaneously as long as the total size of all jobs does not exceed its capacity, and the processing time is dictated by the longest processing job in the batch. In stage 2, the jobs have to be processed one at a time. The objective is to minimise the makespan. As the problem under study is NP-hard, a simulated annealing (SA) algorithm was designed. A mathematical formulation was also developed and a commercial solver was used to solve the problem instances. An experimental study was conducted to compare SA with the solver. The study highlights the efficiency of SA in solving larger problem instances with good quality solution in shorter computational time.

Suggested Citation

  • Santha Raja Kumari Upadhyayula & Shanthi Muthuswamy & Purushothaman Damodaran, 2022. "A simulated annealing approach to minimise makespan in a hybrid flowshop with a batch processing machine," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 40(4), pages 513-532.
    • Handle: RePEc:ids:ijisen:v:40:y:2022:i:4:p:513-532
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=122825
    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. Zhang, Hongbin & Yang, Yu & Wu, Feng, 2024. "Scheduling a set of jobs with convex piecewise linear cost functions on a single-batch-processing machine," Omega, Elsevier, vol. 122(C).

    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:513-532. 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.