Minimising makespan in a no-wait flow shop with two batch processing machines: a grasp algorithm

Jairo Maya, Shanthi Muthuswamy, Mario C. Vélez-Gallego and Miguel Rojas-Santiago

International Journal of Industrial and Systems Engineering, 2014, vol. 17, issue 2, 152-169

Abstract: In a flow shop with two batch processing machines (BPMs) one of the key objectives is to minimise the makespan. In this study jobs with different sizes were batched together, without exceeding the machine capacity, and processed in the BPMs. Job ready times were also taken into consideration hence, a batch cannot be started unless all the jobs in the batch are ready and available. Also, the batches cannot wait between two machines (i.e., no-wait). The problem under study is NP-hard. A greedy randomised adaptive search procedure (GRASP) algorithm has been developed for this problem. Experiments were conducted to study up to 200 job instances. The solution quality of the GRASP algorithm was compared with the results of a mathematical model developed using CPLEX and a particle swarm optimisation algorithm. The experimental study highlights the advantages, in terms of solution quality of using GRASP to solve large-scale problems.

Keywords: no-wait flow shops; batch processing machines; BPMs; GRASP; greedy randomised adaptive search; makespan; particle swarm optimisation; PSO; mathematical modelling. (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.inderscience.com/link.php?id=61991 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijisen:v:17:y:2014:i:2:p:152-169

Access Statistics for this article

More articles in International Journal of Industrial and Systems Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().