IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v116y2018icp202-207.html
   My bibliography  Save this article

Modeling and solving the constrained multi-items lot-sizing problem with time-varying setup cost

Author

Listed:
  • Zhou, Shenghan
  • Zhou, Yuliang
  • Zuo, Xiaorong
  • Xiao, Yiyong
  • Cheng, Yang

Abstract

The dynamic lot-sizing problem is highly complex and very important for the planning systems of manufacturing enterprises in time-varying environment, where production factors such as the production setup costs, unit storage costs, and production capacities may constantly rise or fall in different planning periods over the entire planning horizon. This paper proposed an extension model of the dynamic multi-product lot-sizing problem considering time-varying production setup cost and with dual constraints on dynamic capacities and resource limits, which carters for the actual situation of modern production and manufacturing systems in time-varying environments. Comparative experiments on synthesized problem instances were conducted by using the AMPL/CPLEX solver, which showed that the new model is efficiently on finding solutions with high qualities and the maximum size of test problems can be more than 500 products.

Suggested Citation

  • Zhou, Shenghan & Zhou, Yuliang & Zuo, Xiaorong & Xiao, Yiyong & Cheng, Yang, 2018. "Modeling and solving the constrained multi-items lot-sizing problem with time-varying setup cost," Chaos, Solitons & Fractals, Elsevier, vol. 116(C), pages 202-207.
    • Handle: RePEc:eee:chsofr:v:116:y:2018:i:c:p:202-207
    DOI: 10.1016/j.chaos.2018.09.012
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077918309007
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.chaos.2018.09.012?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Qiannong Gu & John K. Visich & Kunpeng Li & Ziping Wang, 2017. "Exploiting timely demand information in determining production lot-sizing: an exploratory study," International Journal of Production Research, Taylor & Francis Journals, vol. 55(16), pages 4531-4543, August.
    2. Xiang Li & Guohua Sun & Yongjian Li, 2016. "A multi-period ordering and clearance pricing model considering the competition between new and out-of-season products," Annals of Operations Research, Springer, vol. 242(2), pages 207-221, July.
    3. Onur Ozturk & Mehmet A. Begen & Gregory S. Zaric, 2017. "A branch and bound algorithm for scheduling unit size jobs on parallel batching machines to minimize makespan," International Journal of Production Research, Taylor & Francis Journals, vol. 55(6), pages 1815-1831, March.
    4. Xiao, Yiyong & Zhang, Renqian & Zhao, Qiuhong & Kaku, Ikou & Xu, Yuchun, 2014. "A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems," European Journal of Operational Research, Elsevier, vol. 235(1), pages 102-114.
    5. Yongjian Li & Xiaoqiang Cai & Lei Xu & Wenxia Yang, 2016. "Heuristic approach on dynamic lot-sizing model for durable products with end-of-use constraints," Annals of Operations Research, Springer, vol. 242(2), pages 265-283, July.
    6. Akbalik, Ayse & Hadj-Alouane, Atidel B. & Sauer, Nathalie & Ghribi, Houcem, 2017. "NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract," European Journal of Operational Research, Elsevier, vol. 257(2), pages 483-493.
    7. Maryam Darvish & Homero Larrain & Leandro C. Coelho, 2016. "A dynamic multi-plant lot-sizing and distribution problem," International Journal of Production Research, Taylor & Francis Journals, vol. 54(22), pages 6707-6717, November.
    8. Kris Lieckens & Nico Vandaele, 2016. "Differential evolution to solve the lot size problem in stochastic supply chain management systems," Annals of Operations Research, Springer, vol. 242(2), pages 239-263, July.
    9. Rafael A. Melo & Celso C. Ribeiro, 2017. "Formulations and heuristics for the multi-item uncapacitated lot-sizing problem with inventory bounds," International Journal of Production Research, Taylor & Francis Journals, vol. 55(2), pages 576-592, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kannan Govindan, 2016. "Evolutionary algorithms for supply chain management," Annals of Operations Research, Springer, vol. 242(2), pages 195-206, July.
    2. Biber Nurit & Mor Baruch & Schlissel Yitzhak & Shapira Dana, 2023. "Lot scheduling involving completion time problems on identical parallel machines," Operational Research, Springer, vol. 23(1), pages 1-29, March.
    3. Omid Shahvari & Rasaratnam Logendran & Madjid Tavana, 2022. "An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems," Journal of Scheduling, Springer, vol. 25(5), pages 589-621, October.
    4. Hrabec, Dušan & Hvattum, Lars Magnus & Hoff, Arild, 2022. "The value of integrated planning for production, inventory, and routing decisions: A systematic review and meta-analysis," International Journal of Production Economics, Elsevier, vol. 248(C).
    5. Mou, Shandong & Robb, David J. & DeHoratius, Nicole, 2018. "Retail store operations: Literature review and research directions," European Journal of Operational Research, Elsevier, vol. 265(2), pages 399-422.
    6. Jing, Fuying & Chao, Xiangrui, 2021. "A dynamic lot size model with perishable inventory and stockout," Omega, Elsevier, vol. 103(C).
    7. Clavijo López, Christian & Crama, Yves & Pironet, Thierry & Semet, Frédéric, 2024. "Multi-period distribution networks with purchase commitment contracts," European Journal of Operational Research, Elsevier, vol. 312(2), pages 556-572.
    8. Gansterer, Margaretha & Födermayr, Patrick & Hartl, Richard F., 2021. "The capacitated multi-level lot-sizing problem with distributed agents," International Journal of Production Economics, Elsevier, vol. 235(C).
    9. Boonmee, Atiwat & Sethanan, Kanchana, 2016. "A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry," European Journal of Operational Research, Elsevier, vol. 250(2), pages 652-665.
    10. Cheaitou, Ali & Cheaytou, Rima, 2019. "A two-stage capacity reservation supply contract with risky supplier and forecast updating," International Journal of Production Economics, Elsevier, vol. 209(C), pages 42-60.
    11. Artur Alves Pessoa & Teobaldo Bulhões & Vitor Nesello & Anand Subramanian, 2022. "Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1512-1530, May.
    12. Wu, Tao & Xiao, Fan & Zhang, Canrong & Zhang, Defu & Liang, Zhe, 2019. "Regression and extrapolation guided optimization for production–distribution with ship–buy–exchange options," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 129(C), pages 15-37.
    13. Yiyong Xiao & Meng You & Xiaorong Zuo & Shenghan Zhou & Xing Pan, 2018. "The Uncapacitatied Dynamic Single-Level Lot-Sizing Problem under a Time-Varying Environment and an Exact Solution Approach," Sustainability, MDPI, vol. 10(11), pages 1-14, October.
    14. Liu, Jiaguo & Zhao, Huida & Li, Jian & Yue, Xiaohang, 2021. "Operational strategy of customized bus considering customers’ variety seeking behavior and service level," International Journal of Production Economics, Elsevier, vol. 231(C).
    15. Gur Mosheiov & Daniel Oron, 2023. "A note on batch scheduling on a two-machine flowshop with machine-dependent processing times," 4OR, Springer, vol. 21(3), pages 457-469, September.
    16. Yiyong Xiao & Abdullah Konak, 2017. "A variable neighborhood search for the network design problem with relays," Journal of Heuristics, Springer, vol. 23(2), pages 137-164, June.
    17. Rabin K. Jana & Dinesh K. Sharma & Peeyush Mehta, 2022. "A probabilistic fuzzy goal programming model for managing the supply of emergency relief materials," Annals of Operations Research, Springer, vol. 319(1), pages 149-172, December.
    18. Rohaninejad, Mohammad & Hanzálek, Zdeněk, 2023. "Multi-level lot-sizing and job shop scheduling with lot-streaming: Reformulation and solution approaches," International Journal of Production Economics, Elsevier, vol. 263(C).
    19. Zeng, Zhizhong & Yu, Xinguo & He, Kun & Huang, Wenqi & Fu, Zhanghua, 2016. "Iterated Tabu Search and Variable Neighborhood Descent for packing unequal circles into a circular container," European Journal of Operational Research, Elsevier, vol. 250(2), pages 615-627.
    20. Chung-Ho Su & Jen-Ya Wang, 2022. "A Branch-and-Bound Algorithm for Minimizing the Total Tardiness of Multiple Developers," Mathematics, MDPI, vol. 10(7), pages 1-24, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:chsofr:v:116:y:2018:i:c:p:202-207. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.