Model by Considering Customers' Order Priority and Minimizing Machine Providing an Operation Scheduling Configuration Time

Authors

  • Aysan Moheb * Department of Industrial Engineering, Urmia University, Urmia, Iran. https://orcid.org/0009-0002-4011-2149
  • Ali Donyavi Department of Industrial Engineering, Urmia University, Urmia, Iran.

Abstract

Production scheduling is one of the issues in the field of planning in production systems that has a significant impact on reducing costs, increasing productivity, customer satisfaction, and other competitive advantages. Orders are received instantly based on the planned schedule, and all customers expect to receive their orders as soon as possible. In a situation where the volume of orders is high, and there are limited product manufacturers, manufacturing companies tend to prioritize their customers. The purpose of this study is to prioritize the customers of a medical equipment company, and customers are prioritized based on some criteria such as deprivation, urgency of orders, purchase volume, good pay, and participation in a regional exhibition. In this research, a two-objective production flow scheduling problem is presented. The first objective function is related to minimizing the weighted delay at the time of delivery. The second objective function is related to minimizing the total program time changes of the devices or setting them. Due to the complexity of the problem, a multi-objective particle swarm optimization algorithm is proposed to solve the problem. In order to evaluate the efficiency of the proposed model, the one-month orders of the manufacturer in question have been examined, and the stated results show the efficiency of the scheduling.

Keywords:

Flexible job shop production scheduling, Multi-objective particle swarm optimization, Prioritization, Configuration time

References

  1. [1] Petrović, M., Vuković, N., Mitić, M., & Miljković, Z. (2016). Integration of process planning and scheduling using chaotic particle swarm optimization algorithm. Expert systems with applications, 64, 569–588. https://doi.org/10.1016/j.eswa.2016.08.019
  2. [2] Chen, R., Yang, B., Li, S., & Wang, S. (2020). A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem. Computers & industrial engineering, 149, 106778. https://doi.org/10.1016/j.cie.2020.106778
  3. [3] Akyol, D. E., & Bayhan, G. M. (2007). A review on evolution of production scheduling with neural networks. Computers & industrial engineering, 53(1), 95–122. https://doi.org/10.1016/j.cie.2007.04.006
  4. [4] Gonçalves, J. F., De Magalhães Mendes, J. J., & Resende, M. G. C. (2005). A hybrid genetic algorithm for the job shop scheduling problem. European journal of operational research, 167(1), 77–95. https://doi.org/10.1016/j.ejor.2004.03.012
  5. [5] Çaliş, B., & Bulkan, S. (2015). A research survey: Review of AI solution strategies of job shop scheduling problem. Journal of intelligent manufacturing, 26(5), 961–973. https://doi.org/10.1007/s10845-013-0837-8
  6. [6] Li, X., Peng, Z., Du, B., Guo, J., Xu, W., & Zhuang, K. (2017). Hybrid artificial bee colony algorithm with a rescheduling strategy for solving flexible job shop scheduling problems. Computers & industrial engineering, 113, 10–26. https://doi.org/10.1016/j.cie.2017.09.005
  7. [7] Amjad, M. K., Butt, S. I., Kousar, R., Ahmad, R., Agha, M. H., Faping, Z., Anjum, N., & Asgher, U. (2018). Recent research trends in genetic algorithm based flexible job shop scheduling problems. Mathematical problems in engineering, 2018. https://doi.org/10.1155/2018/9270802
  8. [8] Gao, K., Cao, Z., Zhang, L., Chen, Z., Han, Y., & Pan, Q. (2019). A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems. IEEE/CAA journal of automatica sinica, 6(4), 904–916. https://doi.org/10.1109/JAS.2019.1911540
  9. [9] Özgüven, C., Özbakır, L., & Yavuz, Y. (2010). Mathematical models for job-shop scheduling problems with routing and process plan flexibility. Applied mathematical modelling, 34(6), 1539–1548. https://doi.org/10.1016/j.apm.2009.09.002
  10. [10] Özgüven, C., Yavuz, Y., & Özbakır, L. (2012). Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times. Applied mathematical modelling, 36(2), 846–858. https://doi.org/10.1016/j.apm.2011.07.037
  11. [11] Jahromi, M., & Tavakkoli-Moghaddam, R. (2012). A novel 0-1 linear integer programming model for dynamic machine-tool selection and operation allocation in a flexible manufacturing system. Journal of manufacturing systems, 31(2), 224–231. https://doi.org/10.1016/j.jmsy.2011.07.008
  12. [12] Shen, X. N., Han, Y., & Fu, J. Z. (2017). Robustness measures and robust scheduling for multi-objective stochastic flexible job shop scheduling problems. Soft computing, 21, 6531–6554. https://doi.org/10.1007/s00500-016-2245-4
  13. [13] Shen, X. N., & Yao, X. (2015). Mathematical modeling and multi-objective evolutionary algorithms applied to dynamic flexible job shop scheduling problems. Information sciences, 298, 198–224. https://doi.org/10.1016/j.ins.2014.11.036
  14. [14] Homayouni, S. M., Fontes, D. B. M. M., & Gonçalves, J. F. (2020). A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation. International transactions in operational research. https://doi.org/10.1111/itor.12878
  15. [15] Özkul, A. O., Küçük, G., Çelik, C., Öztuna, N., Demirkan, M., Nizam, E. Ç., Yüksel, N., & Toy, A. Ö. (2021). An implementation of flexible job shop scheduling problem in a metal processing company. Digital conversion on the way to industry 4.0: Selected papers from ISPR2020, online-Turkey (pp. 817–830). Springer. https://doi.org/10.1007/978-3-030-62784-3_68
  16. [16] Zhang, G., Gao, L., & Shi, Y. (2011). An effective genetic algorithm for the flexible job-shop scheduling problem. Expert systems with applications, 38(4), 3563–3573. https://doi.org/10.1016/j.eswa.2010.08.145
  17. [17] Pezzella, F., Morganti, G., & Ciaschetti, G. (2008). A genetic algorithm for the flexible job-shop scheduling problem. Computers & operations research, 35(10), 3202–3212. https://doi.org/10.1016/j.cor.2007.02.014
  18. [18] Baykasoglu, A. (2002). Linguistic-based meta-heuristic optimization model for flexible job shop scheduling. International journal of production research, 40(17), 4523–4543. https://doi.org/10.1080/00207540210147043
  19. [19] Scrich, C. R., Armentano, V. A., & Laguna, M. (2004). Tardiness minimization in a flexible job shop: A tabu search approach. Journal of intelligent manufacturing, 15(1), 103–115. https://doi.org/10.1023/B:JIMS.0000010078.30713.e9
  20. [20] Brandimarte, P. (1993). Routing and scheduling in a flexible job shop by tabu search. Annals of operations research, 41(3), 157–183. https://doi.org/10.1007/BF02023073
  21. [21] Tay, J. C., & Ho, N. B. (2008). Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Computers & industrial engineering, 54(3), 453–473. https://doi.org/10.1016/j.cie.2007.08.008
  22. [22] Chen, J. C., Wu, C. C., Chen, C. W., & Chen, K. H. (2012). Flexible job shop scheduling with parallel machines using genetic algorithm and grouping genetic algorithm. Expert systems with applications, 39(11), 10016–10021. https://doi.org/10.1016/j.eswa.2012.01.211
  23. [23] Kennedy, J., & Eberhart, R. C. (1997). A discrete binary version of the particle swarm algorithm. 1997 IEEE international conference on systems, man, and cybernetics. Computational cybernetics and simulation (Vol. 5, pp. 4104–4108). IEEE. https://doi.org/10.1109/ICSMC.1997.637339
  24. [24] Reyes-Sierra, M., Coello, C. A. C. (2006). Multi-objective particle swarm optimizers: A survey of the state-of-the-art. International journal of computational intelligence research, 2(3), 287–308. https://B2n.ir/ss2637

Downloads

Published

2025-05-18

Issue

Vol. 1 No. 2 (2025): Annals of Optimization With Applications (ANOWA)

Section

Articles

How to Cite

Model by Considering Customers’ Order Priority and Minimizing Machine Providing an Operation Scheduling Configuration Time. (2025). Annals of Optimization With Applications, 1(2), 13-27. https://www.anowa.reapress.com/journal/article/view/40

Similar Articles

You may also start an advanced similarity search for this article.