Order Planning and Parallel Machines Scheduling Considering Make to Order (MTO) and Make to Stock (MTS) Combinational Policies

Document Type : Research Paper

Authors

1 . M.A. Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran

2 Associate Professor, Department of Industrial Engineering, Mazandaran University of Science And Technology , Babol, Iran

Abstract

In this research, a proposed integer non-linear programming model investigates the order planning problem in a multi-product, multi-period environment. The model focuses on unrelated parallel machine scheduling using make-to-stock (MTS)1 and make-to-order (MTO)2 combinational policies towards the just-in-time (JIT)3 approach. The objective function is to minimize total operating costs, procurement of raw materials, storage of raw materials and final products, tardiness, and rejection of orders. The proposed model is coded, solved, and validated using an illustrative example with Lingo 9.0 software. The results show the model's correct performance, which responds to most orders at appropriate times with the lowest inventory level. Also, considering the theoretical challenges and industrial applications, a genetic algorithm is proposed to solve this problem. The performance of the proposed algorithm is evaluated using several numerical issues. Finally, the analysis of computational results indicates the satisfactory performance of the algorithm.

Keywords

Main Subjects

References

  • Graham, R.L., et al., (1979) Optimization and Approximation in Deterministic Sequencing and Schedul-ing: a Survey. Annals of Discrete Mathematics,. 5: p. 287-326. https://doi.org/10.1016/S0167-5060(08)70356-X
  • Pinedo, M.L., (2008) Scheduling, Theory, Algorithms, and Systems, in Scheduling., Springer-Verlag New York: New York ; London : Springer,. p. XX, 676.
  • Kalantari, , Rabbani, M,. Ebadian, M,. (2011) A decision support system for order acceptance/rejection in hybrid MTS/MTO produc-tion systems, Applied Mathematical Modelling 35: 1363-1377. https://doi.org/10.1016/j.apm.2010.09.015
  • McNaughton, R., Scheduling with Deadlines and Loss Functions. Management Science, 1959. 6(1): p. 1-12. https://doi.org/10.1287/mnsc.6.1.1
  • Hall, N., (1986). Single and multi-processor models for minimizing completion timevariance, Naval Researche Logistics Quaterly, Vol. 33, 49-54 https://doi.org/10.1002/nav.3800330105
  • Yang Cheng, Ch., Wei Huang, L. (2017) Minimizing total earliness and tardiness through unrelated parallel machine scheduling using distributed release time control. Journal of Manufacturing Systems, Volume 42., Pages 1-10. https://doi.org/10.1016/j.jmsy.2016.10.005
  • عطایی، حشمت‌الله. احمدی‌زر، فردین. ارکات، جمال (1400). زمان‌بندی ماشین‌های موازی یکسان با درنظر گرفتن عملیات مشترک به‌منظور کمینه نمودن مجموع انرژی‌های مصرفی و مجموع زمان‌های دیرکرد، نشریه پژوهش‌های مهندسی صنایع درسیستم‌های تولید، سال نهم، شماره 19، صفحه 107-123.
  • -de-Alba, H. Nucamendi-Guillén, S. and Avalos-Rosales, O. ( 2022). A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: Total tardiness minimization. EURO Journal on Computational Optimization, Volume 10, 100034. https://doi.org/10.1016/j.ejco.2022.100034
  • Alencar Rolim, G., Seido Nagano, M., Prata, B., ( 2023). Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window. Computers & Operations Research, Volume 153,106159. https://doi.org/10.1016/j.cor.2023.106159
  • Maecker, S., Shen, L., Mönch, L., (2023). Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness. Computers & Operations Research,Volume 149,105999 https://doi.org/10.1016/j.cor.2022.105999
  • Alizadeh Foroutan, R., Shafipour, M., Rezaeian, J., Khojasteh, Y., (2024). Just-in-time scheduling of unrelated parallel machines with family setups and soft time window constraints. Journal of Industrial and Production Engineering, 1–24. https://doi.org/10.1080/21681015.2024.2361046
  • Li, K., Xu, L., Zhang, H., Chen, J., (2024). A genetic algorithm for fuzzy identical parallel machine scheduling of minimising total weighted tardiness under resource constraint. International Journal of Production Research, 1–25. https://doi.org/10.1080/00207543.2024.2323065

 

  • Williams TM(1984). "Special products and uncertainty in production/inventorysystems". EJOR.,Vol.15.,PP.46-54. https://doi.org/10.1016/0377-2217(84)90047-X
  • باقری‌نژاد، جعفر. قهقایی، آرزو (1395). تحلیل سیستم تولیدی MTS/MTO با مدل‌سازی صف مبتنی‌بر رویکرد گروهی پواسون و سرویس ارلنگ، نشریه پژوهش‌های مهندسی صنایع درسیستم‌های تولید، سال چهارم، شماره هفتم، صفحه 69-79.
  • Zhang, T., Zhang, Y. J., Zheng, Q. P., & Pardalos, P. M. (2011). "A hybrid particle swarm optimization and tabu search algorithm for order planning problems of steel factory based on the make-to-stock and make-to-order management architecture". Journal of Industrial and Management Optimization,. Vol.7(1),PP. 31–51. https://doi.org/10.3934/jimo.2011.7.31
  • Zhang, T., p. Zheng, Q., Fang, Y,. Zhang, Y., ( 2015). "Multi-level inventory matching and order planning under the hybrid Make- To- Order/ Make- To- Stock production environment for steel plants via Particle Swarm Optimization". Computers & Industrial Engineering. Vol. 87., PP. 238-249. https://doi.org/10.1016/j.cie.2015.05.001
  • Danilczuk,W., Gola, A., Grznar, P. ( 2022). Job Scheduling Algorithm for a Hybrid MTO-MTS Production Process, IFAC-PapersOnLineVolume 55, Pages 451-456 https://doi.org/10.1016/j.ifacol.2022.04.235
  • Abdollahpour,S., Rezaeian, J.,( 2016). Switching decisions in a hybrid MTS/MTO production system comprising multiple machines considering setup, Soft Comput DOI 10.1007/s00500-016-2185-z.
  • Yano, Sh., Nagasawa, K., Morikawa, K. Takahashi, K., ( 2019). A Dynamic Switching Policy with Thresholds of Inventory Level and Waiting Orders for MTS/MTO Hybrid Production Systems, Procedia Manufacturing Volume 39, Pages 1076-1081. https://doi.org/10.1016/j.promfg.2020.01.367
  • Sato, S., Maeda, H.,( 2023). Two new meta-heuristics for no-wait flexible flow shop scheduling problem with capacitated machines, mixed make- to- order and make- to- stock policy, International Journal of Production EconomicsVolume 263, 108877
  • امامی، سعید. صباغ، محمد سعید. مصلحی، قاسم. حجازی، سیدرضا (1394). مسأله یکپارچه پذیرش سفارش و زمان‌بندی با ماشین‌های موازی متفاوت در سیستم ساخت براساس سفارش، نشریه پژوهش‌های مهندسی صنایع درسیستم‌های تولید، شماره چهارم، جلد 26، صفحه 431-414.
  • Wang, Zh., Qi, Y., Cui, H., Zhang, J., ( 2019). A hybrid algorithm for order acceptance and scheduling problem in make-to-stock/make-to-order industries, Computers & Industrial Engineering Volume 127, Pages 841-852. https://doi.org/10.1016/j.cie.2018.11.021
  • Kusuma, P. D. (2022). Hybrid make-to-stock and make-to-order (mts-mto) scheduling model in multi-product production system. International Journal of Integrated Engineering, 14(4), 188-200. https://doi.org/10.30880/ijie.2022.14.04.014
  • Chen, C., Han, J., Liu, Z., & Tiong, R. L. K. (2023). Flow shop scheduling of hybrid make-to-stock and make-to-order in a distributed precast concrete production system. Cleaner Logistics and Supply Chain, 7, 100106. https://doi.org/10.1016/j.clscn.2023.100106
  • Wang, Sh., Wu, R., Chu, F., Yu, J., ( 2023). An exact decomposition method for unrelated parallel machine scheduling with order acceptance and setup times, Computers & Industrial Engineering,Vol 175, 108899 https://doi.org/10.1016/j.cie.2022.108899
  • Kim, E. (2024). Inventory rationing, admission control, and production capacity allocation in a make‐to‐stock/make‐to‐ordermanufacturing system. International Transactions in Operational Research.‏ https://doi.org/10.1111/itor.13521
  • Li, Y., Tang, L., Bai, D., C. Coelho, L., ( 2024). Profit maximization through integrated order acceptance and scheduling: A metaheuristic approach, Applied Soft Computing ,Vol 159, 111570 https://doi.org/10.1016/j.asoc.2024.111570
  • Leung, J.Y.-T,(2008). Scheduling with processing set restrictions: a survey. International Journal of Production Economics, Vol.116, PP.251-262. https://doi.org/10.1016/j.ijpe.2008.09.003
  • Baker, K.R. and G.D. Scudder,( 1990). Sequencing with Earliness and Tardiness Penalties: A Review. Operations Research,.Vol.38(1).,PP. 22-36. https://doi.org/10.1287/opre.38.1.22
  • Arkin EM, Silverberg EL.( 1987). "Scheduling jobs with fixed start and finish times". Discrete Applied Mathematics, Vol. 18., PP.1–8. https://doi.org/10.1016/0166-218X(87)90037-0
Journal of Industrial Engineering Research in Production Systems
Volume 12, Issue 24
September 2024
Pages 63-75

Files

Share

How to cite

Statistics