Application and validation of NSGA-II for designing batch production in mass customised steel industry
DOI:
https://doi.org/10.22399/ijcesen.1176Keywords:
NSGA II Algorithm, Mass customization, AHP, Makespan, Tardiness costAbstract
In recent pandemic situation the work orders from various customers are not stable due to the fact that the money flow is not happening as it was earlier. The work is based on unstable demand from customers of mass customized medium scale steel products manufacturing and leading exporters of precision components such as guide bush, steel collet, and feed finger. The industry considered for this work located in Coimbatore, South India follows a batch production system. Due to uncertainty in today’s market the industry is unable to deliver the orders within the due date. Poor production planning is found out to be one of the reasons for not being able to keep up to the deadlines. The Non Dominated Sorting Genetic Algorithm (NSGA II) is applied to produce a set of solutions with makespan and tardiness cost. Then the Analytical Hierarchy Process (AHP) has been used to validate the results obtained.
References
[1]Vladimir Rankovic, Zora Arsovski, Slavko Arsovski, Zoran Kalinic, Igor Milanovic and Dragana Rejman-Petrovic, “Multiobjective Supplier Selection Using Genetic Algorithm: A Comparison Between Weighted Sum And Spea Methods”, International Journal for Quality research, (2011), Vol.5, No. 4.
[2]Dalessandro Soares Vianna, Igor Carlos Pulini and Carlos Bazilio Martins, “Using Multiobjective Genetic Algorithm and Multicriteria Analysis for the Production Scheduling of a Brazilian Garment Company”, InTech, (2013), DOI: http://dx.doi.org/10.5772/53701.
[3]Wilfried Jakob and Christian Blume, “Pareto Optimization or Cascaded Weighted Sum: A Comparison of Concepts”, Algorithms,( 2014), 7, 166-185; doi:10.3390/a7010166.
[4]Metiaf, Ali & Elkazzaz, Fathy & Hong, Wu & Abozied, Mohammed. Multi-objective Optimization of Supply Chain Problem Based NSGA-II-Cuckoo Search Algorithm. IOP Conference Series: Materials Science and Engi-neering. (2018), 435. 012030. 10.1088/1757-899X/435/1/012030.
[5]Ebrahimiarjestan, Mina; Wang, Guoxin: Determining decoupling points in a supply chain networks using NSGA II algorithm, Journal of Industrial Engineering and Management (JIEM), ISSN 2013-0953, OmniaScience, Barce-lona, (2017) Vol. 10, Iss. 2, pp. 352-372, http://dx.doi.org/10.3926/jiem.2158.
[6]Kalyanmoy Deb, Amrit Pratap, Sameer Agarwal, and T. Meyarivan, A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II, Ieee Transactions On Evolutionary Computation, (2002),Vol. 6, No. 2 pp. 1- 38
[7]Haldurai, T. Madhubala and R. Rajalakshmi, 2016, A Study on Genetic Algorithm and its Applications, International Journal of Computer Sciences and Engineering, (2016), Vol.-4(10), E-ISSN: 2347-2693.
[8]M. Abbas, A. Abbas and W. A. Khan, , Scheduling job shop – A case study, IOP Conf. Series: Materials Science and Engineering (2016),146, 012052.
[9]Ming Huang, Dongsheng Guo, Xu Liang And Xiuyan Liang, An Improved Ant Colony Algorithm to Solve the Single Objective Flexible Job-shop Scheduling Problem, IEEE 8th International Conference on Computer Science and Network Technology (2020), (ICCSNT), 978-1-7281-8123-3/20.
[10]P. Mohapatra, A. Nayak, S.K. Kumar and M.K. Tiwari , Multi-objective process planning and scheduling using controlled elitist non-dominated sorting genetic algorithm, International Journal of Production Research, (2015), Vol. 53, No. 6, 1712–1735
[11]Pandian, R. & Šoltysová, Zuzana. Management of mass customized orders using flexible schedules to minimize delivery times. Polish Journal of Management Studies. (2018), 18. 252-261. 10.17512/pjms.2018.18.1.19.
[12]Pisut Pongchairerk, A Two-Level Metaheuristic Algorithm for the Job-Shop Scheduling Problem, Hindawi Complexity, (2019), Volume 2019,
[13]Srinivas, N. and Deb, K. Multi-Objective function optimization using non-dominated sorting genetic algorithms, Evolutionary Computation, (1995) 2(3):221–248.
[14]Yi Feng, Mengru Liu, Zhile Yang, Wei Feng and Dongsheng Yang , , A Grasshopper Optimization Algorithm for the Flexible Job Shop Scheduling Problem, 35th Youth Academic Annual Conference of Chinese Association of Automation (2020) | 978-1-7281-7684-0/20
[15]Modrak, V., & Pandian, R. S. Operations Management Research and Cellular Manufacturing Systems: Innovative Methods and Approaches. Business Science Reference. (2012). IGI Global, USA
[16]Modrák, V.,and Pandian, R. S. Flow shop scheduling algorithm to minimize completion time for n-jobs m-machines problem. Tehnički vjesnik, (2010). 17(3), 273-278.
[17]Saaty T. L. (1990): How to make a decision:The analytic hierarchy process. In: European Journal of Operational Research, 48, p. 9-26
[18]Tatjana Atanasova–Pachemska, Martin Lapevski and Riste Timovski. Analytical Hierarchical Process (AHP) method application in the process of selection and evaluation, International Scientific Conference, 21 – 22 No-vember 2014, Gabrovo
[19]Saaty, T. L. Theory and applications of the analytic network process: Decision making with benefits, opportu-nities, costs, and risks. (2005), RWS Publications, Pittsburgh
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 International Journal of Computational and Experimental Science and Engineering

This work is licensed under a Creative Commons Attribution 4.0 International License.