A discrete Jaya algorithm for permutation flow-shop scheduling problem
- 1 January 2020
- journal article
- research article
- Published by Growing Science in International Journal of Industrial Engineering Computations
- Vol. 11 (3), 415-428
- https://doi.org/10.5267/j.ijiec.2019.12.001
Abstract
Jaya algorithm has recently been proposed, which is simple and efficient meta-heuristic optimization technique and has received a great attention in the world of optimization. It has been successfully applied to some thermal, design and manufacturing associated optimization problems. This paper aims to analyze the performance of Jaya algorithm for permutation flow-shop scheduling problem which is a well-known NP-hard optimization problem. The objective is to minimize the makespan. First, to make Jaya algorithm adaptive to the problem, a random priority is allocated to each job in a permutation sequence. Second, a job priority vector is converted into job permutation vector by means of Largest Order Value (LOV) rule. An exhaustive comparative study along with statistical analysis is performed by comparing the results with public benchmarks and other competitive heuristics. The key feature of Jaya algorithm of simultaneous movement towards the best solution and going away from the worst solution enables it to avoid being trapped in the local optima. Furthermore, the uniqueness of Jaya algorithm compared with any other evolutionary based optimization technique is that it is totally independent of specific parameters. This substantially reduces the computation effort and numerical complexity. Computational results reveal that Jaya algorithm is efficient in most cases and has considerable potential for permutation flow-shop scheduling problems. (C) 2020 by the authors; licensee Growing Science, CanadaKeywords
This publication has 26 references indexed in Scilit:
- A hybrid backtracking search algorithm for permutation flow-shop scheduling problemComputers & Industrial Engineering, 2015
- Testing the performance of teaching–learning based optimization (TLBO) algorithm on combinatorial problems: Flow shop and job shop scheduling casesInformation Sciences, 2014
- A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problemInformation Sciences, 2011
- An efficient flow-shop scheduling algorithm based on a hybrid particle swarm optimization modelExpert Systems with Applications, 2009
- New MILP models for the permutation flowshop problemJournal of the Operational Research Society, 2008
- An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffersComputers & Operations Research, 2008
- A hybrid differential evolution method for permutation flow-shop schedulingThe International Journal of Advanced Manufacturing Technology, 2007
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problemEuropean Journal of Operational Research, 2007
- Flowshop-scheduling problems with makespan criterion: a reviewInternational Journal of Production Research, 2005
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobsEuropean Journal of Operational Research, 2004