IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v42y1995i5p791-806.html
   My bibliography  Save this article

A primal‐dual algorithm for the dynamic lotsizing problem with joint set‐up costs

Author

Listed:
  • Ömer Kirca

Abstract

In this article the multi‐item dynamic lotsizing problem with joint set‐up costs (LPJS) is considered. A tight formulation of the problem and the dual of the linear relaxation of this formulation is presented. A procedure to solve this dual problem is developed where the solution provides a strong lower bound for the LPJS. This lower bound is used in a branch and bound procedure to find an optimal solution to the problem. The extensive computational experiments with this procedure revealed that it outperforms the other available branch and bound algorithm in the literature. With the proposed algorithm the average time requirement was about 113 seconds on a 486DX33 processor for solving a difficult class of LPJS problems that have 50 items and 24 periods. © 1995 John Wiley & Sons, Inc.

Suggested Citation

  • Ömer Kirca, 1995. "A primal‐dual algorithm for the dynamic lotsizing problem with joint set‐up costs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(5), pages 791-806, August.
    • Handle: RePEc:wly:navres:v:42:y:1995:i:5:p:791-806
    DOI: 10.1002/1520-6750(199508)42:53.0.CO;2-8
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199508)42:53.0.CO;2-8
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199508)42:53.0.CO;2-8?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
    ---><---

    References listed on IDEAS

    as
    1. Dev Joneja, 1990. "The Joint Replenishment Problem: New Heuristics and Worst Case Performance Bounds," Operations Research, INFORMS, vol. 38(4), pages 711-723, August.
    2. 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.
    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. Chia‐Shin Chung & Sin‐Hoon Hum & Omer Kirca, 2000. "An optimal procedure for the coordinated replenishment dynamic lot‐sizing problem with quantity discounts," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(8), pages 686-695, December.

    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. Yale T. Herer & Michal Tzur, 2001. "The dynamic transshipment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(5), pages 386-408, August.
    2. Awi Federgruen & Michal Tzur, 1999. "Time‐partitioning heuristics: Application to one warehouse, multiitem, multiretailer lot‐sizing problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(5), pages 463-486, August.
    3. Wolosewicz, Cathy & Dauzère-Pérès, Stéphane & Aggoune, Riad, 2015. "A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem," European Journal of Operational Research, Elsevier, vol. 244(1), pages 3-12.
    4. 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.
    5. Toy, Ayhan Özgür & Berk, Emre, 2013. "Dynamic lot sizing for a warm/cold process: Heuristics and insights," International Journal of Production Economics, Elsevier, vol. 145(1), pages 53-66.
    6. Hark‐Chin Hwang & Wilco van den Heuvel, 2012. "Improved algorithms for a lot‐sizing problem with inventory bounds and backlogging," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(3‐4), pages 244-253, April.
    7. Karla E. Bourland & Candace Arai Yano, 1996. "Lot sizing when yields increase during the production run," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(8), pages 1035-1047, December.
    8. Martel, Alain & Gascon, Andre, 1998. "Dynamic lot-sizing with price changes and price-dependent holding costs," European Journal of Operational Research, Elsevier, vol. 111(1), pages 114-128, November.
    9. 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.
    10. Rita Vachani, 1992. "Performance of heuristics for the uncapacitated lot‐size problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(6), pages 801-813, October.
    11. Vernon Ning Hsu, 2000. "Dynamic Economic Lot Size Model with Perishable Inventory," Management Science, INFORMS, vol. 46(8), pages 1159-1169, August.
    12. Herbert Meyr & Mirko Kiel, 2022. "Minimizing setups and waste when printing labels of consumer goods," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(3), pages 733-761, September.
    13. 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.
    14. Hark‐Chin Hwang, 2007. "Dynamic lot‐sizing model with production time windows," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(6), pages 692-701, September.
    15. Piñeyro, Pedro & Viera, Omar, 2010. "The economic lot-sizing problem with remanufacturing and one-way substitution," International Journal of Production Economics, Elsevier, vol. 124(2), pages 482-488, April.
    16. Hark-Chin Hwang, 2010. "Economic Lot-Sizing for Integrated Production and Transportation," Operations Research, INFORMS, vol. 58(2), pages 428-444, April.
    17. 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.
    18. Hark-Chin Hwang & Hyun-Soo Ahn & Philip Kaminsky, 2013. "Basis Paths and a Polynomial Algorithm for the Multistage Production-Capacitated Lot-Sizing Problem," Operations Research, INFORMS, vol. 61(2), pages 469-482, April.
    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. van den Heuvel, W. & Kundakcioglu, O.E. & Geunes, J. & Romeijn, H.E. & Sharkey, T.C. & Wagelmans, A.P.M., 2007. "Integrated market selection and production planning: complexity and solution approaches," Econometric Institute Research Papers EI 2007-45, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.

    More about this item

    Statistics

    Access and download statistics

    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:wly:navres:v:42:y:1995:i:5:p:791-806. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.