IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v208y2019icp500-511.html
   My bibliography  Save this article

Lot sizing problem with batch ordering under periodic buyback contract and lost sales

Author

Listed:
  • Farhat, Mlouka
  • Akbalik, Ayse
  • Hadj-Alouane, Atidel B.
  • Sauer, Nathalie

Abstract

We study the deterministic single-item lot sizing problem with batch ordering under the buyback contract (LSP-BB) in a system with one retailer and one supplier. We consider a fixed cost per batch replenished in addition to the classical lot sizing costs, making the procurement cost structure stepwise. We also consider lost sales option with a lost sales cost incurred for each unit of demand not satisfied. The buyback contract considered here consists in returning unused units at the end of every w periods, with a buyback revenue for each unit returned back. We study this problem under both FTL (full truck load) cost structure and only full batch replenishment assumption. We propose efficient and exact polynomial time algorithms for different extensions of this problem which is known to be NP-hard in the general case. To the best of our knowledge, it is the first time that the buyback contract is introduced in a multi-period lot sizing problem (LSP) in the literature. Moreover, batch ordering and lost sales issues have never been tackled in the same LSP model before our study. Hence, this paper provides efficient algorithms to solve the LSP with batch ordering and lost sales under the buyback contract not yet addressed in the literature.

Suggested Citation

  • Farhat, Mlouka & Akbalik, Ayse & Hadj-Alouane, Atidel B. & Sauer, Nathalie, 2019. "Lot sizing problem with batch ordering under periodic buyback contract and lost sales," International Journal of Production Economics, Elsevier, vol. 208(C), pages 500-511.
    • Handle: RePEc:eee:proeco:v:208:y:2019:i:c:p:500-511
    DOI: 10.1016/j.ijpe.2018.12.013
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527318304912
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2018.12.013?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. Hazra, Jishnu & Mahadevan, B., 2009. "A procurement model using capacity reservation," European Journal of Operational Research, Elsevier, vol. 193(1), pages 303-316, February.
    2. Doostmohammadi, Mahdi & Akartunalı, Kerem, 2018. "Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: Zero setup case," European Journal of Operational Research, Elsevier, vol. 267(1), pages 86-95.
    3. Ioannis Fragkos & Zeger Degraeve & Bert De Reyck, 2016. "A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 465-482, August.
    4. Wu, Desheng, 2013. "Coordination of competing supply chains with news-vendor and buyback contract," International Journal of Production Economics, Elsevier, vol. 144(1), pages 1-13.
    5. Albert Wagelmans & Stan van Hoesel & Antoon Kolen, 1992. "Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case," Operations Research, INFORMS, vol. 40(1-supplem), pages 145-156, February.
    6. Chung-Lun Li & Vernon Ning Hsu & Wen-Qiang Xiao, 2004. "Dynamic Lot Sizing with Batch Ordering and Truckload Discounts," Operations Research, INFORMS, vol. 52(4), pages 639-654, August.
    7. Aksen, Deniz & Altinkemer, Kemal & Chand, Suresh, 2003. "The single-item lot-sizing problem with immediate lost sales," European Journal of Operational Research, Elsevier, vol. 147(3), pages 558-566, June.
    8. Barry Alan Pasternack, 1985. "Optimal Pricing and Return Policies for Perishable Commodities," Marketing Science, INFORMS, vol. 4(2), pages 166-176.
    9. 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.
    10. Akbalik, Ayse & Rapine, Christophe, 2013. "The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases," European Journal of Operational Research, Elsevier, vol. 229(2), pages 353-363.
    11. Esra Koca & Hande Yaman & M. Selim Aktürk, 2014. "Lot Sizing with Piecewise Concave Production Costs," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 767-779, November.
    12. Kerem Akartunalı & Ioannis Fragkos & Andrew J. Miller & Tao Wu, 2016. "Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 766-780, November.
    13. Brahimi, Nadjib & Absi, Nabil & Dauzère-Pérès, Stéphane & Nordli, Atle, 2017. "Single-item dynamic lot-sizing problems: An updated survey," European Journal of Operational Research, Elsevier, vol. 263(3), pages 838-863.
    14. Hou, Jing & Zeng, Amy Z. & Zhao, Lindu, 2010. "Coordination with a backup supplier through buy-back contract under supply disruption," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 46(6), pages 881-895, November.
    15. Harvey M. Wagner & Thomson M. Whitin, 1958. "Dynamic Version of the Economic Lot Size Model," Management Science, INFORMS, vol. 5(1), pages 89-96, October.
    16. Bose, Indranil & Anand, Paul, 2007. "On returns policies with exogenous price," European Journal of Operational Research, Elsevier, vol. 178(3), pages 782-788, May.
    17. Bijvank, Marco & Vis, Iris F.A., 2011. "Lost-sales inventory theory: A review," European Journal of Operational Research, Elsevier, vol. 215(1), pages 1-13, November.
    18. Gabriel R. Bitran & Horacio H. Yanasse, 1982. "Computational Complexity of the Capacitated Lot Size Problem," Management Science, INFORMS, vol. 28(10), pages 1174-1186, October.
    19. Akbalik, Ayse & Rapine, Christophe, 2018. "Lot sizing problem with multi-mode replenishment and batch delivery," Omega, Elsevier, vol. 81(C), pages 123-133.
    20. Harish Krishnan & Roman Kapuscinski & David A. Butz, 2004. "Coordinating Contracts for Decentralized Supply Chains with Retailer Promotional Effort," Management Science, INFORMS, vol. 50(1), pages 48-63, January.
    21. Minjiao Zhang & Simge Küçükyavuz & Hande Yaman, 2012. "A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands," Operations Research, INFORMS, vol. 60(4), pages 918-935, August.
    22. Richard A. Sandbothe & Gerald L. Thompson, 1990. "A Forward Algorithm for the Capacitated Lot Size Model with Stockouts," Operations Research, INFORMS, vol. 38(3), pages 474-486, June.
    23. V. Padmanabhan & I. P. L. Png, 1997. "Manufacturer's Return Policies and Retail Competition," Marketing Science, INFORMS, vol. 16(1), pages 81-94.
    24. Awi Federgruen & Michal Tzur, 1991. "A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time," Management Science, INFORMS, vol. 37(8), pages 909-925, August.
    25. Chung-Yee Lee & Sila Çetinkaya & Wikrom Jaruphongsa, 2003. "A Dynamic Model for Inventory Lot Sizing and Outbound Shipment Scheduling at a Third-Party Warehouse," Operations Research, INFORMS, vol. 51(5), pages 735-747, October.
    26. van Norden, Linda & van de Velde, Steef, 2005. "Multi-product lot-sizing with a transportation capacity reservation contract," European Journal of Operational Research, Elsevier, vol. 165(1), pages 127-138, August.
    27. Hark-Chin Hwang & Wilco van den Heuvel & Albert Wagelmans, 2013. "The economic lot-sizing problem with lost sales and bounded inventory," IISE Transactions, Taylor & Francis Journals, vol. 45(8), pages 912-924.
    28. Karimi, B. & Fatemi Ghomi, S. M. T. & Wilson, J. M., 2003. "The capacitated lot sizing problem: a review of models and algorithms," Omega, Elsevier, vol. 31(5), pages 365-378, October.
    29. Goyal, S. K. & Giri, B. C., 2001. "Recent trends in modeling of deteriorating inventory," European Journal of Operational Research, Elsevier, vol. 134(1), pages 1-16, October.
    30. Alper Atamtürk & Dorit S. Hochbaum, 2001. "Capacity Acquisition, Subcontracting, and Lot Sizing," Management Science, INFORMS, vol. 47(8), pages 1081-1100, August.
    31. Akbalik, A. & Pochet, Y., 2009. "Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs," European Journal of Operational Research, Elsevier, vol. 198(2), pages 412-434, October.
    32. Shoshana Anily & Michal Tzur, 2005. "Shipping Multiple Items by Capacitated Vehicles: An Optimal Dynamic Programming Approach," Transportation Science, INFORMS, vol. 39(2), pages 233-248, May.
    33. M. Florian & J. K. Lenstra & A. H. G. Rinnooy Kan, 1980. "Deterministic Production Planning: Algorithms and Complexity," Management Science, INFORMS, vol. 26(7), pages 669-679, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sharifi, Rozhin & Razavi, Hamideh & Elahi, Ehsan, 2023. "Investigation of the ordering behavior of a retailer in the revenue sharing and buyback contracts considering round number bias," Journal of Retailing and Consumer Services, Elsevier, vol. 73(C).
    2. Mehr Sadat Salami & Mohammadreza Eslamipirharati & Alireza Bakhshi & Amir Aghsami & Fariborz Jolai & Maziar Yazdani, 2022. "Does a Buyback Contract Coordinate a Reverse Supply Chain Facing Remanufacturing Capacity Disruption and Returned Product Quality Uncertainty?," Sustainability, MDPI, vol. 14(23), pages 1-20, November.

    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. Brahimi, Nadjib & Absi, Nabil & Dauzère-Pérès, Stéphane & Nordli, Atle, 2017. "Single-item dynamic lot-sizing problems: An updated survey," European Journal of Operational Research, Elsevier, vol. 263(3), pages 838-863.
    2. 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.
    3. Ou, Jinwen & Feng, Jiejian, 2019. "Production lot-sizing with dynamic capacity adjustment," European Journal of Operational Research, Elsevier, vol. 272(1), pages 261-269.
    4. Chung-Lun Li & Qingying Li, 2016. "Polynomial-Time Solvability of Dynamic Lot Size Problems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(03), pages 1-20, June.
    5. Ming Zhao & Minjiao Zhang, 2020. "Multiechelon Lot Sizing: New Complexities and Inequalities," Operations Research, INFORMS, vol. 68(2), pages 534-551, March.
    6. Stan van Hoesel & H. Edwin Romeijn & Dolores Romero Morales & Albert P. M. Wagelmans, 2005. "Integrated Lot Sizing in Serial Supply Chains with Production Capacities," Management Science, INFORMS, vol. 51(11), pages 1706-1719, November.
    7. Hark-Chin Hwang, 2010. "Economic Lot-Sizing for Integrated Production and Transportation," Operations Research, INFORMS, vol. 58(2), pages 428-444, April.
    8. Hnaien, Faicel & Afsar, Hasan Murat, 2017. "Robust single-item lot-sizing problems with discrete-scenario lead time," International Journal of Production Economics, Elsevier, vol. 185(C), pages 223-229.
    9. Fink, Jiří & Hurink, Johann L., 2015. "Minimizing costs is easier than minimizing peaks when supplying the heat demand of a group of houses," European Journal of Operational Research, Elsevier, vol. 242(2), pages 644-650.
    10. Goisque, Guillaume & Rapine, Christophe, 2017. "An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels," European Journal of Operational Research, Elsevier, vol. 261(3), pages 918-928.
    11. Jean-Philippe Gayon & Guillaume Massonnet & Christophe Rapine & Gautier Stauffer, 2017. "Fast Approximation Algorithms for the One-Warehouse Multi-Retailer Problem Under General Cost Structures and Capacity Constraints," Mathematics of Operations Research, INFORMS, vol. 42(3), pages 854-875, August.
    12. Dziuba, Daryna & Almeder, Christian, 2023. "New construction heuristic for capacitated lot sizing problems," European Journal of Operational Research, Elsevier, vol. 311(3), pages 906-920.
    13. Brahimi, Nadjib & Dauzere-Peres, Stephane & Najid, Najib M. & Nordli, Atle, 2006. "Single item lot sizing problems," European Journal of Operational Research, Elsevier, vol. 168(1), pages 1-16, January.
    14. Mathieu Van Vyve, 2007. "Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size," Mathematics of Operations Research, INFORMS, vol. 32(3), pages 594-613, August.
    15. Awi Federgruen & Joern Meissner & Michal Tzur, 2007. "Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems," Operations Research, INFORMS, vol. 55(3), pages 490-502, June.
    16. Atamturk, Alper & Munoz, Juan Carlos, 2002. "A Study of the Lot-Sizing Polytope," University of California Transportation Center, Working Papers qt6zz2g0z4, University of California Transportation Center.
    17. Vernon Ning Hsu, 2000. "Dynamic Economic Lot Size Model with Perishable Inventory," Management Science, INFORMS, vol. 46(8), pages 1159-1169, August.
    18. Nadjib Brahimi & Stéphane Dauzère-Pérès & Najib M. Najid, 2006. "Capacitated Multi-Item Lot-Sizing Problems with Time Windows," Operations Research, INFORMS, vol. 54(5), pages 951-967, October.
    19. Hark-Chin Hwang, 2009. "Inventory Replenishment and Inbound Shipment Scheduling Under a Minimum Replenishment Policy," Transportation Science, INFORMS, vol. 43(2), pages 244-264, May.
    20. Hwang, Hark-Chin & Kang, Jangha, 2020. "The two-level lot-sizing problem with outbound shipment," Omega, Elsevier, vol. 90(C).

    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:proeco:v:208:y:2019:i:c:p:500-511. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    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.