A BRANCH AND BOUND ALGORITHM FOR THE DYNAMIC QUANTITY DISCOUNT LOT SIZING

被引：0
|
作者：
Mirmohammadi, S. Hamid [1 ]
Shadrokh, Shahram [1 ]
机构：
[1] Sharif Univ Technol, Dept Ind Engn, Tehran, Iran
来源：
PROCEEDINGS OF THE 38TH INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3 | 2008年
关键词：
Branch and bound; Fathom rule; Inventory; Lot sizes; Material requirement planning;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper presents an optimal algorithm based on Branch and Bound approach for determining lot sizes for purchased component in Material Requirement Planning (MRP) environments with deterministic dynamic demand pattern and constant ordering cost with zero lead time, where all units discounts are available from vendors and shortage is not allowed. Based on the properties of an optimal order policy proven in the literature, a tree search procedure is designed to construct sequences of orders in the optimal policy. Some useful fathom rules have been proven to make the algorithm very efficient.
引用
收藏
页码：2996 / 3005
页数：10
相关论文
共 50 条
  • [1] A BRANCH AND BOUND ALGORITHM FOR THE DYNAMIC QUANTITY DISCOUNT LOT SIZE PROBLEM WITH RESALE
    Mirmohammadi, S. Hamid
    Shadrokh, Shahram
    [J]. PROCEEDINGS OF THE 38TH INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2008, : 3 - 11
  • [2] A dynamic lot-sizing model with quantity discount
    Chyr, F
    Huang, ST
    De Lai, S
    [J]. PRODUCTION PLANNING & CONTROL, 1999, 10 (01) : 67 - 75
  • [3] A BRANCH AND BOUND ALGORITHM FOR A SINGLE ITEM NONCONVEX DYNAMIC LOT SIZING PROBLEM WITH CAPACITY CONSTRAINTS
    ERENGUC, SS
    AKSOY, Y
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1990, 17 (02) : 199 - 210
  • [4] THE DYNAMIC LOT SIZE MODEL WITH QUANTITY DISCOUNT
    FEDERGRUEN, A
    LEE, CY
    [J]. NAVAL RESEARCH LOGISTICS, 1990, 37 (05) : 707 - 713
  • [5] A BRANCH AND BOUND ALGORITHM FOR A SINGLE-ITEM MULTISOURCE DYNAMIC LOT SIZING PROBLEM WITH CAPACITY CONSTRAINTS
    ERENGUC, SS
    TUFEKCI, S
    [J]. IIE TRANSACTIONS, 1987, 19 (01) : 73 - 80
  • [6] Dynamic Programming and Heuristic for Stochastic Uncapacitated Lot-Sizing Problems with Incremental Quantity Discount
    Zhang, Yuli
    Song, Shiji
    Wu, Cheng
    Yin, Wenjun
    [J]. MATHEMATICAL PROBLEMS IN ENGINEERING, 2012, 2012
  • [7] Genetic Algorithm to Solve the Lot-sizing Problem with Multi-supplier and Quantity Discount
    Lee, Amy H. I.
    Kang, He-Yau
    [J]. 2011 IEEE PACIFIC RIM CONFERENCE ON COMMUNICATIONS, COMPUTERS AND SIGNAL PROCESSING (PACRIM), 2011, : 113 - 118
  • [8] Multi-Objective Programming for Lot-Sizing with Quantity Discount
    Kang, He-Yau
    Lee, Amy H. I.
    Lai, Chun-Mei
    Kang, Mei-Sung
    [J]. ADVANCES IN MATHEMATICAL AND COMPUTATIONAL METHODS: ADDRESSING MODERN CHALLENGES OF SCIENCE, TECHNOLOGY, AND SOCIETY, 2011, 1368
  • [9] Solving lot-sizing problem with quantity discount and transportation cost
    Lee, Amy H. I.
    Kang, He-Yau
    Lai, Chun-Mei
    [J]. INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 2013, 44 (04) : 760 - 774
  • [10] Single-item lot-sizing with quantity discount and bounded inventory
    Down, Douglas G.
    Karakostas, George
    Kolliopoulos, Stavros G.
    Rostami, Somayye
    [J]. OPERATIONS RESEARCH LETTERS, 2021, 49 (06) : 877 - 882
12345