A Modeling and Hybridized Decomposition Approach for the Multi-level Capacitated Lot-Sizing Problem with Setup Carryover, Backlogging, and Emission Control

被引:0
|
作者
Nusrat T. Chowdhury
Mohammed F. Baki
Ahmed Azab
机构
[1] Bemidji State University,School of Technology, Art and Design
[2] University of Windsor,Odette School of Business
[3] University of Windsor,Production & Operations Management Research Laboratory, Faculty of Engineering
关键词
Inventory; Multi-level capacitated lot-sizing; Emission control; Setup carryover; Dantzig-Wolfe decomposition;
D O I
10.1007/s43069-024-00350-8
中图分类号
学科分类号
摘要
The goal of the production planning problem is to determine the optimum quantity to produce in order to satisfy demand over a predetermined planning horizon with the least amount of money spent. Making the appropriate choices in production planning will impact a manufacturing company’s performance and productivity, which is crucial to remain competitive in the market. Therefore, developing and enhancing techniques for solving production planning problems is very significant. This paper proposes a mixed-integer linear programming model for this extension of the dynamic multi-level capacitated lot-sizing under study, where setup carryover, backlogging, and emission control are considered. An item Dantzig-Wolfe decomposition-based heuristic procedure is developed, and a dynamic programming and column generation approach is used to solve the problem. We also propose a multi-step iterative capacity allocation heuristic procedure to handle any infeasibilities that arise when solving the problem. We evaluate the performance of the developed solution approach using a test data set available in the literature. Computational results show that the proposed optimization framework provides competitive solutions within a reasonable timeframe.
引用
收藏
相关论文
共 50 条
  • [31] Integrated lot-sizing and scheduling with overlapping for multi-level capacitated production system
    Ramezanian, Reza
    Saidi-Mehrabad, Mohammad
    Fattahi, Parviz
    [J]. INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING, 2013, 26 (07) : 681 - 695
  • [32] Solving the capacitated lot sizing problem with setup carryover using a new sequential hybrid approach
    Hacer Güner Gören
    Semra Tunalı
    [J]. Applied Intelligence, 2015, 42 : 805 - 816
  • [33] Solving the capacitated lot sizing problem with setup carryover using a new sequential hybrid approach
    Goren, Hacer Guner
    Tunali, Semra
    [J]. APPLIED INTELLIGENCE, 2015, 42 (04) : 805 - 816
  • [34] A Heuristic Solution of Multi-Item Single Level Capacitated Dynamic Lot-Sizing Problem with Setup Time
    Parveen, Sultana
    Hasin, Md. Ahsan Akthar
    [J]. ADVANCES IN MATERIALS AND PROCESSING TECHNOLOGIES II, PTS 1 AND 2, 2011, 264-265 : 1794 - 1801
  • [35] The collaborative multi-level lot-sizing problem with cost synergies
    Gansterer, Margaretha
    Hartl, Richard F.
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2020, 58 (02) : 332 - 349
  • [36] ANALYSIS OF LAGRANGIAN DECOMPOSITION FOR THE MULTIITEM CAPACITATED LOT-SIZING PROBLEM
    THIZY, JM
    [J]. INFOR, 1991, 29 (04) : 271 - 283
  • [37] A heuristic for the multi-level capacitated lot sizing problem with inventory constraints
    Witt, Andreas
    [J]. INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE AND ENGINEERING MANAGEMENT, 2019, 14 (04) : 240 - 252
  • [38] A heuristic approach for a multi-product capacitated lot-sizing problem with pricing
    Gonzalez-Ramirez, Rosa G.
    Smith, Neale R.
    Askin, Ronald G.
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2011, 49 (04) : 1173 - 1196
  • [39] The Multi-Level Economic Lot-Sizing Game
    Li, Gai-Di
    Du, Dong-Lei
    Xu, Da-Chuan
    Zhang, Ru-Yao
    [J]. OPERATIONS RESEARCH AND ITS APPLICATIONS: IN ENGINEERING, TECHNOLOGY AND MANAGEMENT, 2011, 14 : 100 - +
  • [40] The multi-period multi-level capacitated lot-sizing and scheduling problem in the dairy soft-drink industry
    Mediouni, Abderrahmene
    Zufferey, Nicolas
    Rached, Mansour
    Cheikhrouhou, Naoufel
    [J]. SUPPLY CHAIN FORUM, 2022, 23 (03): : 272 - 284