Lot-sizing and scheduling determines the size of production lots and the production sequence simultaneously, avoiding infeasible and sub-optimal situations caused by sequential decision-making. In some enterprises like the internal combustion engine manufacturer, some resources like fixtures are expensive and scarce, which leads to restrictions on production capacity. This paper studies a lot-sizing and scheduling problem considering fixture resource constraints to seek the trade-off between financial goals and customer satisfaction. With the introduction of the resource flow network, an integrated model is formulated to determine the optimal size and schedule of the product lots. A solution approach based on the logic-based Benders decomposition algorithm is proposed to solve the problem. Comparison with commercial solver demonstrates the effectiveness of our approach in different instance sets. Sensitivity analyses provide valuable managerial insights to the production managers.
Chen Kunxiu, Chen Lu, Bao Zhongkai
. Lot-Sizing and Scheduling Problem Considering Fixture Resource Constraints: A Decomposition Solution Approach[J]. Journal of Shanghai Jiaotong University(Science), 2026
, 31(4)
: 1034
-1047
.
DOI: 10.1007/s12204-024-2757-5
[1] RAMEZANIAN R, FALLAH SANAMI S, SHAFIEI NIKABADI M. A simultaneous planning of production and scheduling operations in flexible flow shops: Case study of tile industry [J]. The International Journal of Advanced Manufacturing Technology, 2017, 88(9): 2389-2403.
[2] GÜNGÖR M, ÜNAL A T, TAŞKıN Z C. A parallel machine lot-sizing and scheduling problem with a secondary resource and cumulative demand [J]. International Journal of Production Research, 2018, 56(9): 3344-3357.
[3] ALVES DE OLIVEIRA SOLER W, OLIVEIRA SANTOS M, RANGEL S. Optimization models for a lot sizing and scheduling problem on parallel production lines that share scarce resources [J]. RAIRO - Operations Research, 2021, 55(3): 1949-1970.
[4] KARIMI B, FATEMI GHOMI S M T, WILSON J M. The capacitated lot sizing problem: A review of models and algorithms [J]. Omega, 2003, 31(5): 365-378.
[5] HAN Y, CAI J H, IKOU K, et al. Evolutionary algorithms for solving unconstrained multilevel lot-sizing problem with series structure [J]. Journal of Shanghai Jiaotong University (Science), 2012, 17(1): 39-44.
[6] COPIL K, WÖRBELAUER M, MEYR H, et al. Simultaneous lotsizing and scheduling problems: A classification and review of models [J]. OR Spectrum, 2017, 39(1): 1-64.
[7] FLEISCHMANN B. The discrete lot-sizing and scheduling problem [J]. European Journal of Operational Research, 1990, 44(3): 337-348.
[8] WÖRBELAUER M, MEYR H, ALMADA-LOBO B. Simultaneous lotsizing and scheduling considering secondary resources: A general model, literature review and classification [J]. OR Spectrum, 2019, 41(1): 1-43.
[9] JANS R, DEGRAEVE Z. An industrial extension of the discrete lot-sizing and scheduling problem [J]. IIE Transactions, 2004, 36(1): 47-58.
[10] GHOSH DASTIDAR S, NAGI R. Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs [J]. Computers & Operations Research, 2005, 32(11): 2987-3005.
[11] DE ARMAS J, LAGUNA M. Parallel machine, capacitated lot-sizing and scheduling for the pipe-insulation industry [J]. International Journal of Production Research, 2020, 58(3): 800-817.
[12] TEMPELMEIER H, BUSCHKÜHL L. Dynamic multi-machine lotsizing and sequencing with simultaneous scheduling of a common setup resource [J]. International Journal of Production Economics, 2008, 113(1): 401-412.
[13] ALMEDER C, ALMADA-LOBO B. Synchronisation of scarce resources for a parallel machine lotsizing problem [J]. International Journal of Production Research, 2011, 49(24): 7315-7335.
[14] IBARRA-ROJAS O J, RÍOS-MERCADO R Z, RIOS-SOLIS Y A, et al. A decomposition approach for the piece–mold–machine manufacturing problem [J]. International Journal of Production Economics, 2011, 134(1): 255-261.
[15] RÍOS-SOLÍS Y Á, IBARRA-ROJAS O J, CABO M, et al. A heuristic based on mathematical programming for a lot-sizing and scheduling problem in mold-injection production [J]. European Journal of Operational Research, 2020, 284(3): 861-873.
[16] ALIPOURI Y. A resource flow-based branch-and-bound algorithm to solve fuzzy stochastic resource-constrained project scheduling problem [J]. Soft Computing, 2021, 25(22): 14315-14331.
[17] LEE Y, LEE K. Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups [J]. European Journal of Operational Research, 2023, 310(1): 201-216.
[18] RAHMANIANI R, CRAINIC T G, GENDREAU M, et al. The Benders decomposition algorithm: A literature review [J]. European Journal of Operational Research, 2017, 259(3): 801-817.
[19] BALMA A, BEN SALEM S, MRAD M, et al. Strong multi-commodity flow formulations for the asymmetric traveling salesman problem [J]. European Journal of Operational Research, 2018, 271(1): 72-79.
[20] NADERI B, ROSHANAEI V. Critical-path-search logic-based Benders decomposition approaches for flexible job shop scheduling [J]. INFORMS Journal on Optimization, 2022, 4(1): 1-28.
