Simulation of Job Sequencing for Stochastic Scheduling with a Genetic Algorithm
DOI:
https://doi.org/10.31181/060722075bKeywords:
Stochastic scheduling, Genetic algorithm, Sequencing, TardinessAbstract
Sequencing is done to determine the order in which the jobs are to be processed. Extensive research has been carried out with an aim to tackle real-world scheduling problems. In industries, experimentation is performed before an ultimate choice is made to know the optimal priority sequencing rule. Therefore, an extensive approach to selecting the correct choice is necessary for the management decision-making perspective. In this research, the genetic algorithm (GA) and working of a simulation environment are explained, in which a scheduling operator, under any given circumstances, can obtain the appropriate sequence for job scheduling in a shop. The paper also explains the stochastic based linguistic, scenarios and probabilistic approaches to solve sequencing problem. The simulation environment allows the operator to select the tardiness and non-tardiness related performance measures. The simulator takes input values such as number of jobs, processing time and due date and discovers a near-optimal sequence for scheduling of jobs that minimizes the performance measures selected by the operator as per requirement. The case study considered is solved using scenarios based stochastic scheduling approach and results are shown. The results are compared with the classical method used in the company and observed that the proposed approach gives a better result.
Downloads
References
Baker, K. R., & Trietsch, D. (2009). Principles of Sequencing and Scheduling. In Principles of Sequencing and Scheduling. https://doi.org/10.1002/9780470451793
Bancila, D., & Buzatu, C. (2008). A hybrid algorithm to minimize the number of tardy jobs in single machine scheduling. Annals of DAAAM and Proceedings of the International DAAAM Symposium, 69–70. https://doi.org/10.2507/daaam.scibook.2010.48
Bari, P., & Karande, P. (2020). Scheduling Problem in a Job-shop with Common Due Date to Minimize Cost and Makespan : Modeling Approach. Manufacturing Technology and Research (An International Journal), 13(1–2).
Bari, P., & Karande, P. (2021). Application of PROMETHEE-GAIA method to priority sequencing rules in a dynamic job shop for single machine. Materials Today: Proceedings, xxxx. https://doi.org/10.1016/j.matpr.2020.12.854
Bari, P., & Karande, P. (2022). Cost Minimization in a Scheduling Problem with Unrestricted and Restricted Common Due Date. Lecture Notes in Mechanical Engineering, 269–278. https://doi.org/10.1007/978-981-16-5281-3_25
Bayu, F., Panda, D., Shaik, M. A., & Ramteke, M. (2020). Scheduling of gasoline blending and distribution using graphical genetic algorithm. Computers and Chemical Engineering, 133, 106636. https://doi.org/10.1016/j.compchemeng.2019.106636
Çetinkaya, F. C., & Duman, M. (2021). Scheduling with lot streaming in a two-machine re-entrant flow shop. Operational Research in Engineering Sciences: Theory and Applications, 4(3), 142–175. https://doi.org/10.31181/ORESTA111221142C
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2), 182–197. https://doi.org/10.1109/4235.996017
French, S. (1982). Sequencing and Scheduling: An Introduction to the Mathematics of the Job-shop (First). Wiley.
Garg, H. (2016). A hybrid PSO-GA algorithm for constrained optimization problems. Applied Mathematics and Computation, 274, 292–305. https://doi.org/10.1016/j.amc.2015.11.001
Garg, H. (2019). A hybrid GSA-GA algorithm for constrained optimization problems. Information Sciences, 478, 499–523. https://doi.org/10.1016/j.ins.2018.11.041
Koratiya, V. K., Kumar, S., & Sinha, S. (2010). Modeling, Simulation and Optimization of FCC Downer Reactor. Petroleum and Coal, 52(3), 183–192.
Kumar, K. K., Nagaraju, D., Gayathri, S., & Narayanan, S. (2017). Evaluation and Selection of Best Priority Sequencing Rule in Job Shop Scheduling using Hybrid MCDM Technique. IOP Conference Series: Materials Science and Engineering, 197(1). https://doi.org/10.1088/1757-899X/197/1/012059
Kundu T., & Garg H. (2021). A hybrid ITLHHO algorithm for numerical and engineering optimization problems. International Journal of Intelligent Systems, 37(3). https://doi.org/10.1002/int.22707
Kurniawan, B., Chandramitasari, W., Gozali, A. A., Weng, W., & Fujimura, S. (2020). Triple-chromosome genetic algorithm for unrelated parallel machine scheduling under time-of-use tariffs. IEEJ Transactions on Electrical and Electronic Engineering, 15(2), 208–217. https://doi.org/10.1002/tee.23047
Oyetunji, E. O. (2009). Some common performance measures in scheduling problems: Review article. Research Journal of Applied Sciences, Engineering and Technology, 1(2), 6–9.
Ramteke, M., & Srinivasan, R. (2012). Large-scale refinery crude oil scheduling by integrating graph representation and genetic algorithm. Industrial and Engineering Chemistry Research, 51(14), 5256–5272. https://doi.org/10.1021/ie201283z
Roy, A., Manna, A., & Maity, S. (2019). A novel memetic genetic algorithm for solving traveling salesman problem based on multi-parent crossover technique. Decision Making: Applications in Management and Engineering, 2(2), 100–111. https://doi.org/10.31181/dmame1902076r
Sarkar, D., & Modak, J. M. (2005). Pareto-optimal solutions for multi-objective optimization of fed-batch bioreactors using nondominated sorting genetic algorithm. Chemical Engineering Science, 60(2), 481–492. https://doi.org/10.1016/j.ces.2004.07.130
Sharma, P., & Jain, A. (2015). Performance analysis of dispatching rules in a stochastic dynamic job shop manufacturing system with sequence-dependent setup times: Simulation approach. CIRP Journal of Manufacturing Science and Technology, 10, 110–119. https://doi.org/10.1016/j.cirpj.2015.03.003
Shrouf, F., Ordieres-Meré, J., García-Sánchez, A., & Ortega-Mier, M. (2014). Optimizing the production scheduling of a single machine to minimize total energy consumption costs. Journal of Cleaner Production, 67, 197–207. https://doi.org/10.1016/j.jclepro.2013.12.024
Souza R., Ghasemi A., Saif A., Gharaei A. (2022). Robust job-shop scheduling under deterministic and stochastic unavailability constraints due to preventive and corrective maintenance, Computers & Industrial Engineering, 168, 108130, ISSN 0360-8352, https://doi.org/10.1016/j.cie.2022.108130.
Stanković, A., Petrović, G., Ćojbašić, Ž., & Marković, D. (2020). An application of metaheuristic optimization algorithms for solving the flexible job-shop scheduling problem. Operational Research in Engineering Sciences: Theory and Applications, 3(3), 13–28. https://doi.org/10.31181/oresta20303013s
Tyagi, N., Tripathi, R. P., & Chandramouli, A. B. (2016). Single machine scheduling model with total tardiness problem. Indian Journal of Science and Technology, 9(37), 1–14. https://doi.org/10.17485/ijst/2016/v9i37/97527
