A Tabu List-Based Algorithm for Capacitated Multilevel Lot-Sizing with Alternate Bills of Materials and Co-Production Environments

[EN] The definition of lot sizes represents one of the most important decisions in production planning. Lot-sizing turns into an increasingly complex set of decisions that requires efficient solution approaches, in response to the time-consuming exact methods (LP, MIP). This paper aims to propose a Tabu list-based algorithm (TLBA) as an alternative to the Generic Materials and Operations Planning (GMOP) model. The algorithm considers a multi-level, multi-item planning structure. It is initialized using a lot-for-lot (LxL) method and candidate solutions are evaluated through an iterative Material Requirements Planning (MRP) procedure. Three different sizes of test instances are defined and better results are obtained in the large and medium-size problems, with minimum average gaps close to 10.5%.This paper shows the results of the project entitled "Algoritmo heuristico basado en listas tabu para la planificacion de la produccion en sistemas multinivel con listas de materiales alternativas y entornos de coproduccion" supported by Universidad de la Costa and Universitat Politecnica de Valencia.Romero-Conrado, AR.; Coronado-Hernandez, J.; Rius-Sorolla, G.; García Sabater, JP. (2019). A Tabu List-Based Algorithm for Capacitated Multilevel Lot-Sizing with Alternate Bills of Materials and Co-Production Environments. Applied Sciences. 9(7):1-17. https://doi.org/10.3390/app9071464S11797Karimi, B., Fatemi Ghomi, S. M. T., & Wilson, J. M. (2003). The capacitated lot sizing problem: a review of models and algorithms. Omega, 31(5), 365-378. doi:10.1016/s0305-0483(03)00059-8Martí, R., & Reinelt, G. (2010). Heuristic Methods. Applied Mathematical Sciences, 17-40. doi:10.1007/978-3-642-16729-4_2Barany, I., Van Roy, T. J., & Wolsey, L. A. (1984). Strong Formulations for Multi-Item Capacitated Lot Sizing. Management Science, 30(10), 1255-1261. doi:10.1287/mnsc.30.10.1255Eppen, G. D., & Martin, R. K. (1987). Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition. Operations Research, 35(6), 832-848. doi:10.1287/opre.35.6.832Maes, J., McClain, J. O., & Van Wassenhove, L. N. (1991). Multilevel capacitated lotsizing complexity and LP-based heuristics. European Journal of Operational Research, 53(2), 131-148. doi:10.1016/0377-2217(91)90130-nBuschkühl, L., Sahling, F., Helber, S., & Tempelmeier, H. (2008). Dynamic capacitated lot-sizing problems: a classification and review of solution approaches. OR Spectrum, 32(2), 231-261. doi:10.1007/s00291-008-0150-7Drexl, A., & Kimms, A. (1997). Lot sizing and scheduling — Survey and extensions. European Journal of Operational Research, 99(2), 221-235. doi:10.1016/s0377-2217(97)00030-1Glock, C. H., Grosse, E. H., & Ries, J. M. (2014). The lot sizing problem: A tertiary study. International Journal of Production Economics, 155, 39-51. doi:10.1016/j.ijpe.2013.12.009KUIK, R., SALOMON, M., VAN WASSENHOVE, L. N., & MAES, J. (1993). LINEAR PROGRAMMING, SIMULATED ANNEALING AND TABU SEARCH HEURISTICS FOR LOTSIZING IN BOTTLENECK ASSEMBLY SYSTEMS. IIE Transactions, 25(1), 62-72. doi:10.1080/07408179308964266Standard Price List—AMPLhttps://ampl.com/products/standard-price-list/Seeanner, F., Almada-Lobo, B., & Meyr, H. (2013). Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems. Computers & Operations Research, 40(1), 303-317. doi:10.1016/j.cor.2012.07.002Hung, Y.-F., & Chien, K.-L. (2000). A multi-class multi-level capacitated lot sizing model. Journal of the Operational Research Society, 51(11), 1309-1318. doi:10.1057/palgrave.jors.2601026Kang, Y., Albey, E., & Uzsoy, R. (2018). Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior. Computers & Operations Research, 100, 54-65. doi:10.1016/j.cor.2018.07.019BERRETTA, R., FRANÇA, P. M., & ARMENTANO, V. A. (2005). METAHEURISTIC APPROACHES FOR THE MULTILEVEL RESOURCE-CONSTRAINED LOT-SIZING PROBLEM WITH SETUP AND LEAD TIMES. Asia-Pacific Journal of Operational Research, 22(02), 261-286. doi:10.1142/s0217595905000510KIMMS, A. (1996). Competitive methods for multi-level lot sizing and scheduling: tabu search and randomized regrets. International Journal of Production Research, 34(8), 2279-2298. doi:10.1080/00207549608905025Sabater, J. P. G., Maheut, J., & Garcia, J. A. M. (2013). A new formulation technique to model materials and operations planning: the generic materials and operations planning (GMOP) problem. European J. of Industrial Engineering, 7(2), 119. doi:10.1504/ejie.2013.052572Maheut, J., & Sabater, J. P. G. (2013). Algorithm for complete enumeration based on a stroke graph to solve the supply network configuration and operations scheduling problem. Journal of Industrial Engineering and Management, 6(3). doi:10.3926/jiem.550Rius-Sorolla, G., Maheut, J., Coronado-Hernandez, J. R., & Garcia-Sabater, J. P. (2018). Lagrangian relaxation of the generic materials and operations planning model. Central European Journal of Operations Research, 28(1), 105-123. doi:10.1007/s10100-018-0593-0Maheut, J., Garcia-Sabater, J. P., & Mula, J. (2012). The Generic Materials and Operations Planning (GMOP) Problem Solved Iteratively: A Case Study in Multi-site Context. IFIP Advances in Information and Communication Technology, 66-73. doi:10.1007/978-3-642-33980-6_8Maheut, J. P. D. (s. f.). Modelos y Algoritmos Basados en el Concepto Stroke para la Planificación y Programación de Operaciones con Alternativas en Redes de Suministro. doi:10.4995/thesis/10251/29290Glover, F. (1989). Tabu Search—Part I. ORSA Journal on Computing, 1(3), 190-206. doi:10.1287/ijoc.1.3.190Glover, F., Taillard, E., & Taillard, E. (1993). A user’s guide to tabu search. Annals of Operations Research, 41(1), 1-28. doi:10.1007/bf02078647Chelouah, R., & Siarry, P. (2000). Tabu Search applied to global optimization. European Journal of Operational Research, 123(2), 256-270. doi:10.1016/s0377-2217(99)00255-6Raza, S. A., Akgunduz, A., & Chen, M. Y. (2006). A tabu search algorithm for solving economic lot scheduling problem. Journal of Heuristics, 12(6), 413-426. doi:10.1007/s10732-006-6017-7Cesaret, B., Oğuz, C., & Sibel Salman, F. (2012). A tabu search algorithm for order acceptance and scheduling. Computers & Operations Research, 39(6), 1197-1205. doi:10.1016/j.cor.2010.09.018Li, X., Baki, F., Tian, P., & Chaouch, B. A. (2014). A robust block-chain based tabu search algorithm for the dynamic lot sizing problem with product returns and remanufacturing. Omega, 42(1), 75-87. doi:10.1016/j.omega.2013.03.003Li, J., & Pan, Q. (2015). Solving the large-scale hybrid flow shop scheduling problem with limited buffers by a hybrid artificial bee colony algorithm. Information Sciences, 316, 487-502. doi:10.1016/j.ins.2014.10.009Hindi, K. S. (1995). Solving the single-item, capacitated dynamic lot-sizing problem with startup and reservation costs by tabu search. Computers & Industrial Engineering, 28(4), 701-707. doi:10.1016/0360-8352(95)00027-xHindi, K. S. (1996). Solving the CLSP by a Tabu Search Heuristic. Journal of the Operational Research Society, 47(1), 151-161. doi:10.1057/jors.1996.13Gopalakrishnan, M., Ding, K., Bourjolly, J.-M., & Mohan, S. (2001). A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover. Management Science, 47(6), 851-863. doi:10.1287/mnsc.47.6.851.9813Glover, F. (1990). Tabu Search—Part II. ORSA Journal on Computing, 2(1), 4-32. doi:10.1287/ijoc.2.1.4Overview for Create General Full Factorial Designhttps://support.minitab.com/en-us/minitab/18/help-and-how-to/modeling-statistics/doe/how-to/factorial/create-factorial-design/create-general-full-factorial/before-you-start/overview/Perttunen, J. (1994). On the Significance of the Initial Solution in Travelling Salesman Heuristics. Journal of the Operational Research Society, 45(10), 1131-1140. doi:10.1057/jors.1994.183Elaziz, M. A., & Mirjalili, S. (2019). A hyper-heuristic for improving the initial population of whale optimization algorithm. Knowledge-Based Systems, 172, 42-63. doi:10.1016/j.knosys.2019.02.010Chen, C.-F., Wu, M.-C., & Lin, K.-H. (2013). Effect of solution representations on Tabu search in scheduling applications. Computers & Operations Research, 40(12), 2817-2825. doi:10.1016/j.cor.2013.06.003Tabu List Based Algorithm Datasetshttps://github.com/alfonsoromeroc/tlba-gmo

Solved problems about direct time study

A set of problems about direct time study is proposed. Its complete resolution is also offered.Maheut, JPD. (2022). Solved problems about direct time study. http://hdl.handle.net/10251/18103

A decision support system for modelling and implementing the supply network configuration and operations scheduling problem in the machine tool industry

[EN] This paper presents a decision support system to simultaneously solve the supply network configuration problem and the operations scheduling problem for the machine tool industry. A novel database structure, which is able to consider alternative operations and alternative bills of material, has been used. An algorithm for complete enumeration to determine all the feasible solutions using stroke graphs is introduced. A multiagent-based simulator evaluates the different key performance indicators that the supply network deals with for each alternative solution (e.g. workload, profits, delivery times, etc.) to determine that ‘satisficed’ by the collaborative decision-making among its members. A case study based on a Spanish company that assembles highly customised machines and tools in several European plants is considered. From the experiments results based on data linked to this industry, it will be demonstrated that the tool is potentially useful for stakeholders and for the central decision-maker to make decisions collaboratively in a multisite context caseWe thank the EWG-DSS and their four expert anonymous referees as well as the guest editorial board for their useful suggestions and criticism on earlier versions of this paper. The research leading to these results has received funding from the European Community's Seventh Framework Programme (FP7/2007-2013) under grant agreement no. NMP2-SL-2009-229333 and has been partially supported by the Spanish Ministry of Science and Innovation within the 'Proyectos de Investigacion Fundamental No Orientada Programme' through Project 'CORSARI MAGIC DPI2010-18243'. Julien Maheut holds a VALi+d grant funded by the Regional Valencian Government (Ref. ACIF/2010/222).Maheut, JPD.; Besga, JM.; Uribetxebarria, J.; García Sabater, JP. (2014). A decision support system for modelling and implementing the supply network configuration and operations scheduling problem in the machine tool industry. Production Planning and Control. 25(8):679-697. https://doi.org/10.1080/09537287.2013.798087S67969725

Etude expérimentale de la physique de l'allumage par choc dans le cadre de la fusion nucléaire par confinement inertiel

Shock ignition is a novel approach for inertial confinement fusion where the compression and the ignition phases by a strong shock are separated. The scheme is promising to the extent that it can generate very high gains and can be tested on already existing lasers systems. In addition, this concept requires lower implosion velocities that allows for compressing more massive targets which limits the impact of hydrodynamic instabilities. However, the physic issues related to shock ignition are still largely unexplored especially experimentally. Indeed, even if the compression phase takes place in the well-known collisional regime (I<1014W=cm2), ignition requires a spike which intensity exceeds 1015W=cm2.This regime is strongly non-linear with the onset of parametric instabilities. These instabilities may decrease the absorption and can also generate suprathermal electrons that can preheat the central part of the fuel and make the compression less efficient. Another key issue is the capability of launching a strong shock in presence of a plasma corona which can deteriorate the laser-target coupling and produce lamentation. Nevertheless, theoretical considerations tend to show that if the energy of fast electrons is moderate (<100keV), they could improve the coupling, deposit their energy in the shock front and hence amplify it. The work presented in this thesis consists in testing these two issues : launching a strong shock in the conditions corresponding to shock ignition i.e. in presence of a plasma corona and study the effect of hot electrons on the shock strength by measuring their energy and their quantity.L'allumage par choc est une approche récente à la fusion par confinement inertiel où les phases de compression et d'allumage par un choc fort sont séparées. Ce schéma est prometteur dans la mesure où il peut générer des gains élevés et être testée sur des installations laser existantes. Par ailleurs, il nécessite des vitesses d'implosions plus faibles permettant ainsi de comprimer une plus grande quantité de combustible et limitant l'impact des instabilités hydrodynamiques. Malgré tout, la physique liée à cette approche reste très largement inconnue surtout du point de vue expérimental. En effet, même si la phase de compression est dans un régime dit collisionnel bien connu (I<1014W=cm2), l'allumage fait intervenir un spike d'une intensité supérieure à 1015W=cm2, régime très fortement non-linéaire où apparaissent des instabilités paramétriques. Ces instabilités peuvent diminuer l'absorption et générer des électrons suprathermiques pouvant préchauffer le coeur de la cible et donc empêcher son allumage. Un deuxième problème est la possibilité de générer un choc fort en présence d'un plasma de couronne qui pourrait, entrer autre, détériorer le couplage laser-cible. Néanmoins, des considérations théoriques tendent à montrer que si on génère des électrons chauds modérément énergétiques (<100keV), non seulement ils ne sont pas dangereux vis-à-vis du préchauffage mais, en plus, ils peuvent améliorer le couplage en déposant leur énergie dans le front de choc et amplifier sa pression. Le travail réalisé dans cette thèse consiste à tester la possibilité de générer un choc fort dans les conditions de l'allumage par choc i.e. en présence d'un plasma de couronne mais aussi d'étudier l'effet des électrons chauds sur le choc en quantifiant leur énergie et leur abondance

A Parallelizable Heuristic for Solving the Generic Materials and Operations Planning in a Supply Chain Network: A Case Study from the Automotive Industry

[EN] A trend in up-to date developments in multi-site operations planning models is to consider in details the different ways to produce, buy or transport products and the distributed decision-making process for operations planning. One of the most generic approaches to support global optimization in those supply chain networks by considering all the different operations alternatives and product structures is the Generic Materials & Operations Planning Problem. This problem can be modelled by a Mixed Integer Linear Programming model capable of considering production, transportation, procurement tasks and their alternatives and other relevant issues such as packaging. The aim of this paper is to introduce the implementation of a parallelizable heuristic method for materials and operations planning and its application to a case of a Supply Chain Network of the automotive industry. The approach uses variants of the GMOP model to overcome traditional MRP systems' limitations.Maheut ., JP.; García Sabater, JP. (2013). A Parallelizable Heuristic for Solving the Generic Materials and Operations Planning in a Supply Chain Network: A Case Study from the Automotive Industry. IFIP Advances in Information and Communication Technology. 397:151-157. doi:10.1007/978-3-642-40352-1_20S151157397Maheut, J., Garcia-Sabater, J.P.: La Matriz de Operaciones y Materiales y la Matriz de Operaciones y Recursos, un nuevo enfoque para resolver el problema GMOP basado en el concepto del Stroke. Dirección y Organización 45, 46–57 (2011)Garcia-Sabater, J.P., Maheut, J., Marin-Garcia, J.A.: A new formulation technique to model Materials and Operations Planning: the Generic Materials and Operations Planning (GMOP) Problem. European J. Industrial Engineering 7, 119–147 (2013)Mula, J., Maheut, J., Garcia-Sabater, J.P.: Supply Chain Network Design. Journal of Marketing and Operations Management Research 1, 378–383 (2012)Dudek, G., Stadtler, H.: Negotiation-based collaborative planning between supply chains partners. European Journal of Operational Research 163, 668–687 (2005)Torabi, S.A., Hassini, E.: Multi-site production planning integrating procurement and distribution plans in multi-echelon supply chains: an interactive fuzzy goal programming approach. International Journal of Production Research 47, 5475–5499 (2009)Kanyalkar, A.P., Adil, G.K.: Aggregate and detailed production planning integrating procurement and distribution plans in a multi-site environment. International Journal of Production Research 45, 5329–5353 (2007)de Kok, T.G., Fransoo, J.C.: Planning Supply Chain Operations: Definition and Comparison of Planning Concepts. In: Graves, S.C. (ed.) Handbooks in Operations Research and Management Science Supply Chain Management: Design, Coordination and Operation, vol. 11, pp. 597–675. Elsevier (2003)Buschkühl, L., Sahling, F., Helber, S., Tempelmeier, H.: Dynamic capacitated lot-sizing problems: a classification and review of solution approaches. OR Spectrum (2009)Maheut, J., Garcia-Sabater, J.P., Mula, J.: A supply Chain Operations Lot-Sizing and Scheduling Model with Alternative Operations. In: Sethi, S.P., Bogataj, M., Ros-McDonnell, L. (eds.) Proceedings of the Industrial Engineering: Innovative Networks, 5th International Conference on Industrial Engineering and Industrial Management "CIO 2011", Cartagena, Spain, pp. 309–316. Springer, London (2012)Garcia-Sabater, J.P., Maheut, J., Garcia-Sabater, J.J.: A two-stage sequential planning scheme for integrated operations planning and scheduling system using MILP: the case of an engine assembler. Flexible Services and Manufacturing Journal 24, 171–209 (2012)Pinto, J.M., Chen, P., Papageorgiou, L.G.: A discrete/continuous time MILP model for medium term planning of single stage multiproduct plants, pp. 1–6. Elsevier, B.V. (2007)Scheer, A.W.: Business Process Engineering - Reference Models for Industrial Enterprises. Springer (1994)Lin, J.T., Chen, T.L., Lin, Y.T.: Critical material planning for TFT-LCD production industry. International Journal of Production Economics 122, 639–655 (2009)Escudero, L.F.: CMIT, capacitated multi-level implosion tool. European Journal of Operational Research 76, 511–528 (1994)Maheut, J., Garcia-Sabater, J.P., Valero-Herrero, M.: MILP model for solving the supply chain operations scheduling problem with alternative operations considering delay penalization: a case study of a mass customization company. In: Proceedings of the 41st International Conference on Computers & Industrial Engineering, pp. 289–294 (2011

“KPJ Airlines” case study

In this case study, a warehouse should be designed. The case is particular because the products are seats for planes.Maheut, JPD.; García Sabater, JP. (2022). “KPJ Airlines” case study. http://hdl.handle.net/10251/18077

“Piensos JK” Case study

In this case, a mathematical model to solve a problem of distribution planning is introduced.Maheut, JPD.; García Sabater, JP. (2022). “Piensos JK” Case study. http://hdl.handle.net/10251/18077

"Trick or Treat Sweets II" Case study

In this case study, students should advise a company that produces sweets on how to set up the Operations system (Layout design, Supply plan, HHRR decisions, Process design, etc.)Maheut, JPD.; García Sabater, JP. (2022). "Trick or Treat Sweets II" Case study. http://hdl.handle.net/10251/18076