Dynamic lot sizing for multiple products with a new joint replenishment model

Liang Lu, Xiangtong Qi

    Research output: Contribution to journalArticle

    Abstract

    This paper studies a new multi-product dynamic lot sizing problem, where the inventories of all products are replenished jointly with the same quantity whenever a production occurs. Such problems may occur in poultry and some chemical industries. We first introduce the general problem that allows for demand rejection with lost sales cost, and prove that the problem is NP-hard. Then we study a special case where all demands have to be satisfied immediately, and show that it can be solved in polynomial time. Finally, we develop two heuristic algorithms for the general problem. Through computational experiments, we demonstrate the effectiveness of the heuristics and investigate some insights related to the decision of lost sales. (C) 2011 Elsevier B.V. All rights reserved.
    Original languageEnglish
    Pages (from-to)74 - 80
    Number of pages7
    JournalEuropean Journal of Operational Research
    Volume212
    Issue number1
    DOIs
    Publication statusPublished - 2011

    Fingerprint

    Lost sales
    Dynamic lot-sizing
    Joint replenishment
    Polynomials
    Experiment
    Heuristics
    Heuristic algorithm
    Costs
    Poultry
    Chemical industry
    NP-hard

    Keywords

    • Production, Dynamic lot sizing, Multiple products, Lost sales, OPERATIONS RESEARCH & MANAGEMENT SCIENCE

    Cite this

    @article{9c5c5e86538943c49e3556d5e4d83471,
    title = "Dynamic lot sizing for multiple products with a new joint replenishment model",
    abstract = "This paper studies a new multi-product dynamic lot sizing problem, where the inventories of all products are replenished jointly with the same quantity whenever a production occurs. Such problems may occur in poultry and some chemical industries. We first introduce the general problem that allows for demand rejection with lost sales cost, and prove that the problem is NP-hard. Then we study a special case where all demands have to be satisfied immediately, and show that it can be solved in polynomial time. Finally, we develop two heuristic algorithms for the general problem. Through computational experiments, we demonstrate the effectiveness of the heuristics and investigate some insights related to the decision of lost sales. (C) 2011 Elsevier B.V. All rights reserved.",
    keywords = "Production, Dynamic lot sizing, Multiple products, Lost sales, OPERATIONS RESEARCH & MANAGEMENT SCIENCE",
    author = "Liang Lu and Xiangtong Qi",
    year = "2011",
    doi = "10.1016/j.ejor.2011.01.031",
    language = "English",
    volume = "212",
    pages = "74 -- 80",
    journal = "European Journal of Operational Research",
    issn = "0377-2217",
    publisher = "Elsevier",
    number = "1",

    }

    Dynamic lot sizing for multiple products with a new joint replenishment model. / Lu, Liang; Qi, Xiangtong.

    In: European Journal of Operational Research, Vol. 212, No. 1, 2011, p. 74 - 80.

    Research output: Contribution to journalArticle

    TY - JOUR

    T1 - Dynamic lot sizing for multiple products with a new joint replenishment model

    AU - Lu, Liang

    AU - Qi, Xiangtong

    PY - 2011

    Y1 - 2011

    N2 - This paper studies a new multi-product dynamic lot sizing problem, where the inventories of all products are replenished jointly with the same quantity whenever a production occurs. Such problems may occur in poultry and some chemical industries. We first introduce the general problem that allows for demand rejection with lost sales cost, and prove that the problem is NP-hard. Then we study a special case where all demands have to be satisfied immediately, and show that it can be solved in polynomial time. Finally, we develop two heuristic algorithms for the general problem. Through computational experiments, we demonstrate the effectiveness of the heuristics and investigate some insights related to the decision of lost sales. (C) 2011 Elsevier B.V. All rights reserved.

    AB - This paper studies a new multi-product dynamic lot sizing problem, where the inventories of all products are replenished jointly with the same quantity whenever a production occurs. Such problems may occur in poultry and some chemical industries. We first introduce the general problem that allows for demand rejection with lost sales cost, and prove that the problem is NP-hard. Then we study a special case where all demands have to be satisfied immediately, and show that it can be solved in polynomial time. Finally, we develop two heuristic algorithms for the general problem. Through computational experiments, we demonstrate the effectiveness of the heuristics and investigate some insights related to the decision of lost sales. (C) 2011 Elsevier B.V. All rights reserved.

    KW - Production, Dynamic lot sizing, Multiple products, Lost sales, OPERATIONS RESEARCH & MANAGEMENT SCIENCE

    U2 - 10.1016/j.ejor.2011.01.031

    DO - 10.1016/j.ejor.2011.01.031

    M3 - Article

    VL - 212

    SP - 74

    EP - 80

    JO - European Journal of Operational Research

    JF - European Journal of Operational Research

    SN - 0377-2217

    IS - 1

    ER -