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

Scheduling batch processing machines in a no-wait flow shop using ACO to minimise the makespan

Author

Listed:
  • Miguel Rojas-Santiago
  • Shanthi Muthuswamy
  • Purushothaman Damodaran
  • Mario C. Velez-Gallego

Abstract

This paper considers a two-stage flow shop scheduling problem with a batch processing machine (BPM) in each stage. The processing time of the batch on the first machine is equal to the longest processing job in the batch, and the batch processing time on the second machine is equal to the sum of processing times of all the jobs in the batch. The jobs cannot wait between the two stages. The problem under study with the makespan objective is NP-hard. An ant colony optimisation (ACO) algorithm combined with batch forming and local search heuristics is proposed and its solution is compared with: a particle swarm optimisation (PSO) algorithm; a greedy randomised adaptive search procedure (GRASP) algorithm; and a commercial solver used to solve the mixed-integer linear formulation. The experimental study helps to highlight the advantages, in terms of solution quality and run time, of using ACO to solve large-scale problems.

Suggested Citation

  • Miguel Rojas-Santiago & Shanthi Muthuswamy & Purushothaman Damodaran & Mario C. Velez-Gallego, 2017. "Scheduling batch processing machines in a no-wait flow shop using ACO to minimise the makespan," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 27(3), pages 390-411.
    • Handle: RePEc:ids:ijisen:v:27:y:2017:i:3:p:390-411
    as

    Download full text from publisher

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

    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:27:y:2017:i:3:p:390-411. 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.