IDEAS home Printed from https://ideas.repec.org/p/unm/umamet/1997029.html
   My bibliography  Save this paper

Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems

Author

Listed:
  • van Hoesel, C.P.M.

    (Quantitative Economics)

  • Wagelmans, A.

    (Externe publicaties SBE)

Abstract

No abstract is available for this item.

Suggested Citation

  • van Hoesel, C.P.M. & Wagelmans, A., 1997. "Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems," Research Memorandum 029, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    • Handle: RePEc:unm:umamet:1997029
    DOI: 10.26481/umamet.1997029
    as

    Download full text from publisher

    File URL: https://cris.maastrichtuniversity.nl/ws/files/1442872/guid-63e90790-2bf2-4a2d-86f5-649d5d10ba05-ASSET1.0.pdf
    Download Restriction: no
    File URL: https://libkey.io/10.26481/umamet.1997029?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. Shaw, D.X. & Wagelmans, A.P.M., 1995. "An Algorithm for Single-item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs," Econometric Institute Research Papers EI 9526-/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    2. Arthur F. Veinott, Jr., 1964. "Production Planning with Convex Costs: A Parametric Study," Management Science, INFORMS, vol. 10(3), pages 441-460, April.
    3. Uday S. Karmarkar & Sham Kekre & Sunder Kekre, 1987. "The Dynamic Lot-Sizing Problem with Startup and Reservation Costs," Operations Research, INFORMS, vol. 35(3), pages 389-398, June.
    4. Michael Florian & Morton Klein, 1971. "Deterministic Production Planning with Concave Costs and Capacity Constraints," Management Science, INFORMS, vol. 18(1), pages 12-20, September.
    5. Bezalel Gavish & Robert E. Johnson, 1990. "A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility," Operations Research, INFORMS, vol. 38(1), pages 70-83, February.
    6. 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).
    7. Cary Swoveland, 1975. "A Deterministic Multi-Period Production Planning Model with Piecewise Concave Production and Holding-Backorder Costs," Management Science, INFORMS, vol. 21(9), pages 1007-1013, May.
    8. Pochet, Y. & Wolsey, L. A., 1995. "Algorithms and reformulations for lot sizing problems," LIDAM Reprints CORE 1160, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    9. Rosling, Kaj, 1993. "A capacitated single-item lot-size model," International Journal of Production Economics, Elsevier, vol. 30(1), pages 213-219, July.
    10. Lambrecht, Marc & Vander Eecken, Jacques, 1978. "A capacity constrained single-facility dynamic lot-size model," European Journal of Operational Research, Elsevier, vol. 2(2), pages 132-136, March.
    11. 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.
    12. Gabriel R. Bitran & Hirofumi Matsuo, 1986. "Approximation Formulations for the Single-Product Capacitated Lot Size Problem," Operations Research, INFORMS, vol. 34(1), pages 63-74, February.
    13. Chia-Shin Chung & Chien-Hua Mike Lin, 1988. "An O(T 2 ) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem," Management Science, INFORMS, vol. 34(3), pages 420-426, March.
    14. Stephen F. Love, 1973. "Bounded Production and Inventory Models with Piecewise Concave Costs," Management Science, INFORMS, vol. 20(3), pages 313-318, November.
    15. Kenneth R. Baker & Paul Dixon & Michael J. Magazine & Edward A. Silver, 1978. "An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints," Management Science, INFORMS, vol. 24(16), pages 1710-1720, December.
    16. Marc Salomon & Leo G. Kroon & Roelof Kuik & Luk N. Van Wassenhove, 1991. "Some Extensions of the Discrete Lotsizing and Scheduling Problem," Management Science, INFORMS, vol. 37(7), pages 801-812, July.
    17. 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. Chung-Yee Lee & Sila Çetinkaya & Albert P.M. Wagelmans, 1999. "A Dynamic Lot-Sizing Model with Demand Time Windows," Tinbergen Institute Discussion Papers 99-095/4, Tinbergen Institute.
    2. Lee, C.Y. & Cetinkaya, S. & Wagelmans, A.P.M., 1999. "A dynamic lot-sizing model with demand time windows," Econometric Institute Research Papers EI 9948-/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    3. Gerhard J. Woeginger, 2000. "When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?," INFORMS Journal on Computing, INFORMS, vol. 12(1), pages 57-74, February.

    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. van Hoesel, C.P.M. & Wagelmans, A.P.M., 1997. "Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems," Econometric Institute Research Papers EI 9735/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    2. C. P. M. van Hoesel & A. P. M. Wagelmans, 2001. "Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems," Mathematics of Operations Research, INFORMS, vol. 26(2), pages 339-357, May.
    3. Hoesel C.P.M. van & Wagelmans A.P.M., 1997. "Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems," Research Memorandum 014, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    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. 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.
    6. Chubanov, Sergei & Kovalyov, Mikhail Y. & Pesch, Erwin, 2008. "A single-item economic lot-sizing problem with a non-uniform resource: Approximation," European Journal of Operational Research, Elsevier, vol. 189(3), pages 877-889, September.
    7. Ng, C.T. & Kovalyov, Mikhail Y. & Cheng, T.C.E., 2010. "A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure," European Journal of Operational Research, Elsevier, vol. 200(2), pages 621-624, January.
    8. 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.
    9. Alper Atamtürk & Dorit S. Hochbaum, 2001. "Capacity Acquisition, Subcontracting, and Lot Sizing," Management Science, INFORMS, vol. 47(8), pages 1081-1100, August.
    10. 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.
    11. Ayse Akbalik & Bernard Penz & Christophe Rapine, 2015. "Capacitated lot sizing problems with inventory bounds," Annals of Operations Research, Springer, vol. 229(1), pages 1-18, June.
    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. 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.
    14. 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.
    15. 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.
    16. 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.
    17. Ou, Jinwen, 2017. "Improved exact algorithms to economic lot-sizing with piecewise linear production costs," European Journal of Operational Research, Elsevier, vol. 256(3), pages 777-784.
    18. Liu, X. & Tu, Yl., 2008. "Production planning with limited inventory capacity and allowed stockout," International Journal of Production Economics, Elsevier, vol. 111(1), pages 180-191, January.
    19. Shaw, D.X. & Wagelmans, A.P.M., 1995. "An Algorithm for Single-item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs," Econometric Institute Research Papers EI 9526-/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    20. François Vanderbeck, 1998. "Lot-Sizing with Start-Up Times," Management Science, INFORMS, vol. 44(10), pages 1409-1425, October.

    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:unm:umamet:1997029. 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: Andrea Willems or Leonne Portz (email available below). General contact details of provider: https://edirc.repec.org/data/meteonl.html .

    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.