IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v86y1995i3p395-401.html
   My bibliography  Save this article

Progress with single-item lot-sizing

Author

Listed:
  • Wolsey, Laurence A.

Abstract

No abstract is available for this item.

Suggested Citation

  • Wolsey, Laurence A., 1995. "Progress with single-item lot-sizing," European Journal of Operational Research, Elsevier, vol. 86(3), pages 395-401, November.
    • Handle: RePEc:eee:ejores:v:86:y:1995:i:3:p:395-401
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(94)00341-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. 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.
    2. POCHET, Yves & WOLSEY , Laurence, 1994. "Algorithms and Reformulations for Lot Sizing Problems," LIDAM Discussion Papers CORE 1994027, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Yves Pochet & Laurence A. Wolsey, 1991. "Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes," Management Science, INFORMS, vol. 37(1), pages 53-67, January.
    4. Cattrysse, Dirk & Maes, Johan & Van Wassenhove, Luk N., 1990. "Set partitioning and column generation heuristics for capacitated dynamic lotsizing," European Journal of Operational Research, Elsevier, vol. 46(1), pages 38-47, May.
    5. 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.
    6. Panayotis Afentakis & Bezalel Gavish, 1986. "Optimal Lot-Sizing Algorithms for Complex Product Structures," Operations Research, INFORMS, vol. 34(2), pages 237-249, April.
    7. Arthur F. Veinott, 1969. "Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems," Operations Research, INFORMS, vol. 17(2), pages 262-291, April.
    8. R. Kipp Martin, 1987. "Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition," Operations Research, INFORMS, vol. 35(6), pages 820-831, December.
    9. Willard I. Zangwill, 1969. "A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System--A Network Approach," Management Science, INFORMS, vol. 15(9), pages 506-527, May.
    10. Stephen F. Love, 1972. "A Facilities in Series Inventory Model with Nested Schedules," Management Science, INFORMS, vol. 18(5-Part-1), pages 327-338, January.
    11. BARANY, Imre & VAN ROY, Tony J. & WOLSEY, Laurence A., 1984. "Strong formulations for multi-item capacitated lot sizing," LIDAM Reprints CORE 590, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    12. Uday S. Karmarkar & Linus Schrage, 1985. "The Deterministic Dynamic Product Cycling Problem," Operations Research, INFORMS, vol. 33(2), pages 326-345, April.
    13. Yves Pochet & Laurence A. Wolsey, 1993. "Lot-Sizing with Constant Batches: Formulation and Valid Inequalities," Mathematics of Operations Research, INFORMS, vol. 18(4), pages 767-785, November.
    14. Willard I. Zangwill, 1968. "Minimum Concave Cost Flows in Certain Networks," Management Science, INFORMS, vol. 14(7), pages 429-450, March.
    15. BARANY, Imre & VAN ROY, Tony & WOLSEY, Laurence A., 1984. "Uncapacitated lot-sizing: the convex hull of solutions," LIDAM Reprints CORE 605, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    16. Michael Florian & Morton Klein, 1971. "Deterministic Production Planning with Concave Costs and Capacity Constraints," Management Science, INFORMS, vol. 18(1), pages 12-20, September.
    17. Kuik, Roelof & Salomon, Marc & van Wassenhove, Luk N., 1994. "Batching decisions: structure and models," European Journal of Operational Research, Elsevier, vol. 75(2), pages 243-263, June.
    18. Harlan Crowder & Ellis L. Johnson & Manfred Padberg, 1983. "Solving Large-Scale Zero-One Linear Programming Problems," Operations Research, INFORMS, vol. 31(5), pages 803-834, October.
    19. POCHET, Yves & WOLSEY, Laurence A., 1993. "Lot-sizing with constant batches: formulation and valid inequalities," LIDAM Reprints CORE 1066, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    20. van Hoesel, Stan & Kolen, Antoon, 1994. "A linear description of the discrete lot-sizing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 75(2), pages 342-353, June.
    21. Pochet, Y. & Wolsey, L. A., 1994. "Polyhedra for lot-sizing with Wagner-Whitin costs," LIDAM Reprints CORE 1129, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    22. Fleischmann, Bernhard, 1990. "The discrete lot-sizing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 44(3), pages 337-348, February.
    23. Alok Aggarwal & James K. Park, 1993. "Improved Algorithms for Economic Lot Size Problems," Operations Research, INFORMS, vol. 41(3), pages 549-571, June.
    24. Imre Barany & Tony J. Van Roy & Laurence A. Wolsey, 1984. "Strong Formulations for Multi-Item Capacitated Lot Sizing," Management Science, INFORMS, vol. 30(10), pages 1255-1261, October.
    25. CONSTANTINO , Miguel, 1993. "A Cutting Plane Approach to Capacitated Lost-Sizing with Start-Up Costs," LIDAM Discussion Papers CORE 1993038, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    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. Sahling, Florian & Buschkühl, Lisbeth & Tempelmeier, Horst & Helber, Stefan, 2008. "Solving a Multi-Level Capacitated Lot Sizing Problem with Multi-Period Setup Carry-Over via a Fix-and-Optimize Heuristic," Hannover Economic Papers (HEP) dp-400, Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät.
    2. José M. Gutiérrez & Beatriz Abdul-Jalbar & Joaquín Sicilia & Inmaculada Rodríguez-Martín, 2021. "Effective Algorithms for the Economic Lot-Sizing Problem with Bounded Inventory and Linear Fixed-Charge Cost Structure," Mathematics, MDPI, vol. 9(6), pages 1-21, March.
    3. Cao, Qing & Schniederjans, Marc J., 2004. "A revised EMQ/JIT production-run model: An examination of inventory and production costs," International Journal of Production Economics, Elsevier, vol. 87(1), pages 83-95, January.
    4. 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.
    5. Alf Kimms, 1998. "Ablauforganisation bei Serienproduktion in Fließfertigungssystemen," Schmalenbach Journal of Business Research, Springer, vol. 50(7), pages 641-655, July.
    6. Lamas, Alejandro & Chevalier, Philippe, 2018. "Joint dynamic pricing and lot-sizing under competition," European Journal of Operational Research, Elsevier, vol. 266(3), pages 864-876.
    7. Nascimento, Mariá C.V. & Resende, Mauricio G.C. & Toledo, Franklina M.B., 2010. "GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem," European Journal of Operational Research, Elsevier, vol. 200(3), pages 747-754, February.
    8. Okhrin, Irena & Richter, Knut, 2011. "The linear dynamic lot size problem with minimum order quantity," International Journal of Production Economics, Elsevier, vol. 133(2), pages 688-693, October.
    9. Hwang, Hark-Chin & Jaruphongsa, Wikrom, 2008. "Dynamic lot-sizing model for major and minor demands," European Journal of Operational Research, Elsevier, vol. 184(2), pages 711-724, January.
    10. 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.
    11. 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.
    12. Jans, R.F. & Degraeve, Z., 2005. "Modeling Industrial Lot Sizing Problems: A Review," ERIM Report Series Research in Management ERS-2005-049-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    13. Wolter, Anja & Helber, Stefan, 2013. "Simultaneous Production and Maintenance Planning for a Single Capacitated Resource facing both a Dynamic Demand and Intensive Wear and Tear," Hannover Economic Papers (HEP) dp-522, Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät.
    14. Berk, Emre & Toy, Ayhan Ozgur & Hazir, Oncu, 2008. "Single item lot-sizing problem for a warm/cold process with immediate lost sales," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1251-1267, June.
    15. Eksioglu, Sandra Duni, 2009. "A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment," European Journal of Operational Research, Elsevier, vol. 197(1), pages 93-101, August.
    16. LAMAS, ALEJANDRO & CHEVALIER, Philippe, 2013. "Jumping the hurdles for collaboration: fairness in operations pooling in the absence of transfer payments," LIDAM Discussion Papers CORE 2013073, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    17. Helber, Stefan & Sahling, Florian, 2010. "A fix-and-optimize approach for the multi-level capacitated lot sizing problem," International Journal of Production Economics, Elsevier, vol. 123(2), pages 247-256, February.
    18. Jans, Raf & Degraeve, Zeger, 2007. "Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1855-1875, March.
    19. 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.
    20. Favaretto, Daniela & Pesenti, Raffaele & Ukovich, Walter, 2001. "Discrete frequency models for inventory management - an introduction," International Journal of Production Economics, Elsevier, vol. 71(1-3), pages 331-342, May.

    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. Jans, Raf & Degraeve, Zeger, 2007. "Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1855-1875, March.
    2. Laurence A. Wolsey, 2002. "Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation," Management Science, INFORMS, vol. 48(12), pages 1587-1602, December.
    3. 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.
    4. AkartunalI, Kerem & Miller, Andrew J., 2009. "A heuristic approach for big bucket multi-level production planning problems," European Journal of Operational Research, Elsevier, vol. 193(2), pages 396-411, March.
    5. François Vanderbeck, 1998. "Lot-Sizing with Start-Up Times," Management Science, INFORMS, vol. 44(10), pages 1409-1425, October.
    6. Kerem Akartunalı & Andrew Miller, 2012. "A computational analysis of lower bounds for big bucket production planning problems," Computational Optimization and Applications, Springer, vol. 53(3), pages 729-753, December.
    7. Ming Zhao & Minjiao Zhang, 2020. "Multiechelon Lot Sizing: New Complexities and Inequalities," Operations Research, INFORMS, vol. 68(2), pages 534-551, March.
    8. 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.
    9. Jans, R.F. & Degraeve, Z., 2005. "Modeling Industrial Lot Sizing Problems: A Review," ERIM Report Series Research in Management ERS-2005-049-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    10. Alper Atamtürk & Simge Küçükyavuz, 2005. "Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation," Operations Research, INFORMS, vol. 53(4), pages 711-730, August.
    11. BELVAUX, Gaetan & WOLSEY, Laurence A., 1998. "Lot-sizing problems: modelling issues and a specialized branch-and-cut system BC-PROD," LIDAM Discussion Papers CORE 1998049, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    12. 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.
    13. 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.
    14. 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.
    15. 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.
    16. Gaetan Belvaux & Laurence A. Wolsey, 2001. "Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs," Management Science, INFORMS, vol. 47(7), pages 993-1007, July.
    17. Eksioglu, Sandra Duni, 2009. "A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment," European Journal of Operational Research, Elsevier, vol. 197(1), pages 93-101, August.
    18. Drexl, Andreas & Haase, Knut, 1992. "A new type of model for multi-item capacitated dynamic lotsizing and scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 286, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    19. Kimms, Alf & Drexl, Andreas, 1996. "Multi-level lot sizing: A literature survey," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 405, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    20. Drexl, A. & Kimms, A., 1997. "Lot sizing and scheduling -- Survey and extensions," European Journal of Operational Research, Elsevier, vol. 99(2), pages 221-235, June.

    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:eee:ejores:v:86:y:1995:i:3:p:395-401. 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/eor .

    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.