A biogeography-based optimisation algorithm for a realistic no-wait hybrid flow shop with unrelated parallel machines to minimise mean tardiness
- 19 January 2016
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Integrated Manufacturing
- Vol. 29 (9) , 1007-1024
Abstract
This paper explores a no-wait hybrid flow shop scheduling problem (NWHFSSP) with realistic assumptions, including unrelated parallel machines at each stage, machine eligibility, sequence-dependent set-up times and different ready times, in order to minimise the mean tardiness. The largest position value rule is proposed to transmute continuous vectors of each solution into job permutations. Also, a novel biogeography-based optimisation (BBO) algorithm is developed to solve the aforementioned problem. To evaluate the effect of various parameters on the performance of the proposed BBO algorithm, response surface methodology (RSM) is employed. Production scenarios for small-scale and large-scale problems are created and tested for the validation purposes. Computational experiment results indicate that the proposed BBO outperforms all of the tested algorithms in terms of four measures, namely, mean relative percentage deviation (RPD), standard deviation of RPD, best RPD and worst RPD. It is shown that BBO produces the best solutions among the tested algorithms in terms of not only the four RPD measures but also computation time.Keywords
This publication has 68 references indexed in Scilit:
- No-wait flexible flowshop with uniform parallel machines and sequence-dependent setup time: a hybrid meta-heuristic approachJournal of Intelligent Manufacturing, 2013
- Pareto Optimal Reconfiguration of Power Distribution Systems Using a Genetic Algorithm Based on NSGA-IIEnergies, 2013
- Considering direct interaction of artificial ant colony foraging simulation and animationJournal of Experimental & Theoretical Artificial Intelligence, 2012
- A comparative analysis of PSO, HPSO, and HPSO-TVAC for data clusteringJournal of Experimental & Theoretical Artificial Intelligence, 2011
- No-wait scheduling of a two-machine flow-shop to minimise the makespan under non-availability constraints and different release datesInternational Journal of Production Research, 2011
- Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffersComputers & Industrial Engineering, 2009
- A comparison of sequencing rules in static and dynamic hybrid flow systemsInternational Journal of Production Research, 1997
- A polynomial approximation scheme for problem F2/rj/CmaxOperations Research Letters, 1997
- A No-Wait Flowshop Scheduling Heuristic to Minimize MakespanJournal of the Operational Research Society, 1994
- On the resources allocation problemInternational Journal of Production Research, 1992