MILP model for the planning of a Computerized Numerical Control Lathes Machining Plant
DOI:
https://doi.org/10.19153/cleiej.24.2.4Keywords:
Flexible Job Shop, MILP, setup, workforceAbstract
This work introduces the formulation and application of a MILP model to solve the problem of planning the weekly production of a machining plant using numerical control lathes to manufacture spare parts for agricultural machines. The machining plant works under a Flexible Job Shop system and it has reduced workforce with different skills to operate the various high-complexity lathes and to carry out setup operations in each machine. The developed model is based on a basic formulation for the classic problem and we introduce some flexible adjustment for the various situations that may arise from different scheduling problems. The model is applied to various scenarios; and we include a discussion of the improvements brought about by the analysis.
References
P. Fattahi, M. Saidi Mehrabad and F. Jolai, “Mathematical modeling and heuristic approaches to flexible job shop scheduling problems” . J Intell Manuf 18, pp. 331–342 (2007). https://doi.org/10.1007/s10845-007-0026-8
Y. Demir and S. Kür?at I?leyen, “Evalu,ation of mathematical models for flexible job-shop scheduling problems,” Applied Mathematical Modelling, 37 pp. 977-988 (2013),
C. Özgüven, Y. Yavuz and L. Özbak?r, “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 pp. 846-858 (2012),
M. Dhiflaoui, H.E. Nouri, O.B. Driss, “Dual-Resource Constraints in Classical and Flexible Job Shop Problems: A State-of-the-Art Review,” Procedia Computer Science 126 pp.1507-1515 (2018),
P. Fattahi, F. Jolaib and J. Arkatc, “Flexible job shop scheduling with overlapping in operations,” Applied Mathematical Modelling, 33, 7 pp. 3076-3087(2009),
J. Novas, “Modelo MILP para la programación de la producción en ambientes job-shop flexibles con división de lotes,” Iberoamerican Journal of Industrial Engineering 8, 16 pp.56–72 (2017).
P. Brandimarte, “Routing and scheduling in a flexible job shop by tabu search”, Ann. Oper. Res. 41, 3, pp .157–183 (1993).
J.C. Chen, C. Wu, C. Chen and K. Chen, “Flexible job shop scheduling with parallel machines using genetic algorithm and grouping genetic algorithm”, Expert Systems with Applications, 39, 11,pp. 10016–10021 (2012)..
S. Dauzère-Pérès and J. Paulli, “An integrated approach for modelling and solving the general multiprocessor job-shop scheduling problem using tabu search” Annals of Operations Research, 70, pp. 281–306 (1997).
S. Jia and Z. Hu, “Path-relinking tabu search for the multi-objective flexible job shop scheduling problem”, Comuters and Operations Research, 47, pp. 11–26 (2014).
I. Kacem, S. Hammadi and P. Borne, “Approach by localization and multiobjective evolutionary optimization for flexible job shop scheduling problems”. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews February 2002 https://doi.org/10.1109/TSMCC.2002.1009117
M. Mastrolilli, and L. Gambardella, “Effective neighbourhood functions for the flexible job shop problem”. Journal of Scheduling, 3, pp. 3–20. (2000).
V. Roshanaei, A. Azab, and H. ElMaraghy, “Mathematical modelling and a meta-heuristic for flexible job shop scheduling”. International Journal of Production Research, 51, 20, pp. 6247–6274 (2013).
L Fanjul-Peyro, R Ruiz, F Perea. “Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times”. Computers & Operations Research, 101 pp 173-182 (2019),.
Y. Demir and S. Kürsat Isleyen, “Evaluation of mathematical models for flexible job-shop scheduling problems,” Applied Mathematical Modelling 37 pp. 977–988 (2013)
H.M. Wagner, “An integer liinear programming model for machine scheduling”, Naval Res. Logistics Quart. 6 pp. 131–140 (1959).
E.H. Bowman, “The scheduling sequence problem”, Oper. Res. 7 , pp. 621–624 (1959).
A.S. Manne, “On the job-shop scheduling problem” , Oper. Res. 8 , pp. 219–223 (1960).
C. S. Thomalla, "Job shop scheduling with alternative process plans." International Journal of Production Economics 74 (1-3), pp. 125-134 (2001).
M. C. Gomes, A. P. Barbosa-Povoa and A. Q. Novais , "Optimal scheduling for flexible job shop operation." International Journal of Production Research 43, 11, pp. 2323-2353 (2005).
C. Özgüven, L. Özbak?r, Y. Yavuz, “Mathematical models for job-shop scheduling problems with routing and process plan flexibility”, Appl. Math. Modell. 34 pp. 1539–1548 (2010).
R. Alvarez-Valdes, A. Fuertes, J.M. Tamarit, G. Gimenez, and R.S. Ramos, “A heuristic to schedule flexible job shop in a glass factory”, European Journal of Operational Research, 165 pp. 525-534 (2005)
T. Meng, Q-K. Pan and H.-Y. Sang, "A hybrid artificial bee colony algorithm for a flexible job shop scheduling problem with overlapping in operations," International Journal of Production Research, 56,16, pp. 5278-5292 (2018)
Y. Demir and S. Kür?at ??leyen “An effective genetic algorithm for flexible job-shop scheduling with overlapping in operations”, International Journal of Production Research, 52,13,pp. 3905-3921, (2014) DOI: 10.1080 / 00207543.2014.889328
M. Dhiflaoui, H. E. Nouri, O. B. Driss, “Dual-Resource Constraints in Classical and Flexible Job Shop Problems: A State-of-the-Art Review”.Procedia Computer Science 126, pp. 1507–1515 (2018).
R. Wu, Y Li,S. Guo and W. Xu, “Solving the dual-resource constrained flexible job shop scheduling problem with learning effect by a hybrid genetic algorithm”. Adv. Mech. Eng., 10 (2018).
N. Al-Hinai and S. Piya, "Jobshop scheduling for skill-dependent Make-to-order system," 2015 International Conference on Industrial Engineering and Operations Management (IEOM), 2015, pp. 1-5, doi: 10.1109/IEOM.2015.7093814.
C. López Martínez, H. Hernández Riaño and M. Soto de la Vega. “Un Squirrel Search Algorithm discreto aplicado al problema Job Shop con operadores calificados”, INGE CUC, 15, 2, pp. 143–154, (2019). DOI: http://doi.org/10.17981/ingecuc.15.2.2019.14
C. Gomes da Silva,J. Figueira, J. Lisboa and S. Barman, “An interactive decision support system for an aggregate production planning model based on multiple criteria mixed integer linear programming”, Omega: The International Journal of Management Science, 34, 2, pp. 167-177 (2006).
A. Allahverdi, “The third comprehensive survey on scheduling problems with setup times/costs”. European Journal of Operational Research 246, pp.345-378 (2015).
A Guinet., “Textile production systems: a succession of non-identical parallel processor shops”. J. Oper. Res. Soc. 42, 8, pp. 655–671 (1991).
N. Balakrishnan, J.J. Kanet and S.V Sridharan, “Early/tardy scheduling with sequence dependent setups on uniform parallel machines”, Comput. Oper. Res. 26, 2, pp. 127–141 (1999).
E. Vallada and R. Ruiz, “A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times”. Eur. J. Oper. Res. 211, 3, pp. 611–622 (2011).
O. Avalos-Rosales, A. Alvarez and F. Angel-Bello, “A reformulation for the problem of scheduling unrelated parallel machines with sequence and machine dependent setup times”, in Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling (ICAPS2013), pp. 278–282. International Journal of Management Science (2013).
P. Wirojanagud, E. S. Gel, J. W. Fowler and R. Cardy,”Modeling Inherent Worker Differences for Workforce Planning”, Int. Journal of Production Research, 45, 3, pp.525-553 ,(2007).
L. Meng, C. Zhang, Y. Ren, B. Zhang and C. Lv “Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem”. Computers & Industrial Engineering, 142 (2020). https://doi.org/10.1016/j.cie.2020.106347
LINDO Systems, Inc. http://lindo.com
Downloads
Published
Issue
Section
License
Copyright (c) 2021 Maria Rosa Galli, Ing., Ing.
This work is licensed under a Creative Commons Attribution 4.0 International License.
CLEIej is supported by its home institution, CLEI, and by the contribution of the Latin American and international researchers community, and it does not apply any author charges whatsoever for submitting and publishing. Since its creation in 1998, all contents are made publicly accesibly. The current license being applied is a (CC)-BY license (effective October 2015; between 2011 and 2015 a (CC)-BY-NC license was used).
