Model formulations for the capacitated lot-sizing problem with service-level constraints

被引:0
|
作者
Hartmut Stadtler
Malte Meistering
机构
[1] Universität Hamburg,
来源
OR Spectrum | 2019年 / 41卷
关键词
Capacitated lot sizing; Demand uncertainty; Service-level constraints; Lower bounds; Uncertainty gap;
D O I
暂无
中图分类号
学科分类号
摘要
We present deterministic model formulations for the capacitated lot-sizing problem, including service-level constraints that address both the periodic and cyclic α\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha $$\end{document} service levels, as well as the β\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta $$\end{document}, γ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma $$\end{document}, and η\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\eta $$\end{document} service levels. We assume that service levels for individual products are given and controlled over a given reporting period (i.e., one year). These deterministic model formulations may be used when all data are deterministic and decision makers intend to exploit given service levels to minimize setup and holding costs. A further application is to provide lower bounds for capacitated lot-sizing problems with stochastic demand and given service-level constraints. In contrast to well-known stochastic or robust optimization approaches, there are new proposals in the literature that do not require scenario modeling and thus have much greater potential for use in solving (large-scale) real-world production planning problems. However, an evaluation of the quality of solutions resulting from these new approaches is difficult. For this purpose, lower bounds showing the best possible (ideal) solution should be of great help. In a computational study, we provide insight into the computational efforts associated with deterministic model formulations with service-level constraints. Finally, lower bounds generated by the deterministic model with β\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta $$\end{document} service-level constraints are compared with the results of a rolling schedule strategy addressing a stochastic lot-sizing problem with given β\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta $$\end{document} service-level constraints. The resultant difference in the objective function values (costs) defines the uncertainty gap. We demonstrate its increase with forecast inaccuracy as well as machine utilization.
引用
收藏
页码:1025 / 1056
页数:31
相关论文
共 50 条
  • [21] Solving the capacitated lot-sizing problem with backorder consideration
    Cheng, CH
    Madan, MS
    Gupta, Y
    So, S
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2001, 52 (08) : 952 - 959
  • [22] Lead time considerations for the multi-level capacitated lot-sizing problem
    Almeder, Christian
    Klabjan, Diego
    Traxler, Renate
    Almada-Lobo, Bernardo
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 241 (03) : 727 - 738
  • [23] Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times
    Meltem Denizel
    F. Tevhide Altekin
    Haldun Süral
    Hartmut Stadtler
    [J]. OR Spectrum, 2008, 30 : 773 - 785
  • [24] Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times
    Denizel, Meltem
    Altekin, F. Tevhide
    Sueral, Haldun
    Stadtler, Hartmut
    [J]. OR SPECTRUM, 2008, 30 (04) : 773 - 785
  • [25] A matheuristic approach for the multi-level capacitated lot-sizing problem with substitution and backorder
    Qin, Hu
    Zhuang, Haocheng
    Yu, Chunlong
    Li, Jiliu
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2024, 62 (13) : 4645 - 4673
  • [26] A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry
    Boonmee, Atiwat
    Sethanan, Kanchana
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 250 (02) : 652 - 665
  • [27] BFO: a hybrid bees algorithm for the multi-level capacitated lot-sizing problem
    Marcos Mansano Furlan
    Maristela Oliveira Santos
    [J]. Journal of Intelligent Manufacturing, 2017, 28 : 929 - 944
  • [28] BFO: a hybrid bees algorithm for the multi-level capacitated lot-sizing problem
    Furlan, Marcos Mansano
    Santos, Maristela Oliveira
    [J]. JOURNAL OF INTELLIGENT MANUFACTURING, 2017, 28 (04) : 929 - 944
  • [29] Dynamic programming approximation algorithms for the capacitated lot-sizing problem
    İ. Esra Büyüktahtakın
    Ning Liu
    [J]. Journal of Global Optimization, 2016, 65 : 231 - 259
  • [30] Immune Genetic Algorithm for the Capacitated Lot-sizing and Scheduling Problem
    Ma, Jia
    Gao, Liqun
    Shi, Gang
    [J]. SEVENTH WUHAN INTERNATIONAL CONFERENCE ON E-BUSINESS, VOLS I-III, 2008, : 1188 - 1194