Abstract
The Jaya algorithm is a novel, simple, and efficient meta-heuristic optimization technique and has received a successful application in the various fields of engineering and sciences. In the present paper, we apply the Jaya algorithm to permutation flow shop scheduling problem (PFSP) with the multi-objective of minimization of maximum completion time (makespan) and tardiness cost under due date constraints. PFSP is a well-known NP-hard and discrete combinatorial optimization problem. Firstly, to retrieve a job sequence, a random preference is allocated to each job in a permutation schedule. Secondly, a job preference vector is transformed into a job permutation vector by means of largest order value (LOV) rule. To deal with the multi-objective criteria, we apply a multi-attribute model (MAM) based on Apriori approach. The correctness of the Jaya algorithm is verified by comparing the results with the total enumeration method and simulated annealing (SA) algorithm. Computational results reveal that the proposed optimization technique is well efficient in solving multi-objective discrete combinatorial optimization problems such as the flow shop scheduling problem in the present study.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Rinnooy Kan, A.H.G.: Machine scheduling problems : classification, complexity and computations. Nijhoff (1976)
Arora, D., Agarwal, G.: Meta-heuristic approaches for flowshop scheduling problems: a review. Int. J. Adv. Oper. Manag. 8, 1 (2016). https://doi.org/10.1504/IJAOM.2016.076203
Yenisey, M.M., Yagmahan, B.: Multi-objective permutation flow shop scheduling problem: literature review, classification and current trends. Omega (United Kingdom) 45, 119–135 (2014). https://doi.org/10.1016/j.omega.2013.07.004
Yagmahan, B., Yenisey, M.M.: A multi-objective ant colony system algorithm for flow shop scheduling problem. Expert Syst. Appl. 37, 1361–1368 (2010). https://doi.org/10.1016/j.eswa.2009.06.105
Minella, G., Ruiz, R., Ciavotta, M.: Restarted Iterated Pareto Greedy algorithm for multi-objective flowshop scheduling problems. Comput. Oper. Res. 38, 1521–1533 (2011). https://doi.org/10.1016/j.cor.2011.01.010
Sun, Y., Zhang, C., Gao, L., Wang, X.: Multi-objective optimization algorithms for flow shop scheduling problem: a review and prospects. Int. J. Adv. Manuf. Technol. 55, 723–739 (2011). https://doi.org/10.1007/s00170-010-3094-4
Venkata, Rao R.: Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems. Int. J. Ind. Eng. Comput. 7, 19–34 (2016). https://doi.org/10.5267/j.ijiec.2015.8.004
Rao, R.V., Saroj, A.: Economic optimization of shell-and-tube heat exchanger using Jaya algorithm with maintenance consideration. Appl. Therm. Eng. 116, 473–487 (2017). https://doi.org/10.1016/j.applthermaleng.2017.01.071
Rao, R.V., More, K.C., Taler, J., Ocłoń, P.: Dimensional optimization of a micro-channel heat sink using Jaya algorithm. Appl. Therm. Eng. 103, 572–582 (2016). https://doi.org/10.1016/J.APPLTHERMALENG.2016.04.135
Rao, R.V., Rai, D.P., Balic, J.: A multi-objective algorithm for optimization of modern machining processes. Eng. Appl. Artif. Intell. 61, 103–125 (2017). https://doi.org/10.1016/j.engappai.2017.03.001
Radhika, S., Ch, S.R., Krishna, N., Karteeka Pavan, K.: Multi-objective optimization of master production scheduling problems using Jaya algorithm 1729–32 (2016)
Rao, R.V., Saroj, A.: Multi-objective design optimization of heat exchangers using elitist-Jaya algorithm. Energy Syst (2016). https://doi.org/10.1007/s12667-016-0221-9
Buddala, R., Mahapatra, S.S.: Improved teaching–learning-based and Jaya optimization algorithms for solving flexible flow shop scheduling problems. J. Ind. Eng. Int. 1–16 (2017). https://doi.org/10.1007/s40092-017-0244-4
Gao, K., Sadollah, A., Zhang, Y., Su, R.: Discrete Jaya algorithm for flexible job shop scheduling problem with new job insertion. In: 14th International Conference on Control Automation Robot Vis 13–5 (2016)
Xia, T., Xi, L., Zhou, X., Lee, J.: Dynamic maintenance decision-making for series-parallel manufacturing system based on MAM-MTW methodology. Eur. J. Oper. Res. 221, 231–240 (2012). https://doi.org/10.1016/j.ejor.2012.03.027
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science (New York,) 220(4598), 671–680 (1983)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Mishra, A.K., Shrivastava, D., Bundela, B., Sircar, S. (2020). An Efficient Jaya Algorithm for Multi-objective Permutation Flow Shop Scheduling Problem. In: Venkata Rao, R., Taler, J. (eds) Advanced Engineering Optimization Through Intelligent Techniques. Advances in Intelligent Systems and Computing, vol 949. Springer, Singapore. https://doi.org/10.1007/978-981-13-8196-6_11
Download citation
DOI: https://doi.org/10.1007/978-981-13-8196-6_11
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-8195-9
Online ISBN: 978-981-13-8196-6
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)