 Scheduling batch processing machines in a no-wait flow shop using ACO to minimise the makespanMiguel Rojas-Santiago, Shanthi Muthuswamy, Purushothaman Damodaran and Mario C. Velez-Gallego International Journal of Industrial and Systems Engineering, 2017, vol. 27, issue 3, 390-411 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. Keywords: no-wait flow shop; batch processing machines; BPMs; ant colony optimisation; ACO; makespan. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:ijisen:v:27:y:2017:i:3:p:390-411 Access Statistics for this article More articles in International Journal of Industrial and Systems Engineering from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.