IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v54y2003i6d10.1057_palgrave.jors.2601554.html
   My bibliography  Save this article

Unbounded knapsack problem with controllable rates: the case of a random demand for items

Author

Listed:
  • K Kogan

    (Bar Ilan University and Holon Academic Institute of Technology)

Abstract

This paper focuses on a dynamic, continuous-time control generalization of the unbounded knapsack problem. This generalization implies that putting items in a knapsack takes time and has a due date. Specifically, the problem is characterized by a limited production horizon and a number of item types. Given an unbounded number of copies of each type of item, the items can be put into a knapsack at a controllable production rate subject to the available capacity. The demand for items is not known until the end of the production horizon. The objective is to collect items of each type in order to minimize shortage and surplus costs with respect to the demand. We prove that this continuous-time problem can be reduced to a number of discrete-time problems. As a result, solvable cases are found and a polynomial-time algorithm is suggested to approximate the optimal solution with any desired precision.

Suggested Citation

  • K Kogan, 2003. "Unbounded knapsack problem with controllable rates: the case of a random demand for items," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(6), pages 594-604, June.
    • Handle: RePEc:pal:jorsoc:v:54:y:2003:i:6:d:10.1057_palgrave.jors.2601554
    DOI: 10.1057/palgrave.jors.2601554
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601554
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601554?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. Khouja, Moutaz, 1999. "The single-period (news-vendor) problem: literature review and suggestions for future research," Omega, Elsevier, vol. 27(5), pages 537-553, October.
    2. Anton J. Kleywegt & Jason D. Papastavrou, 2001. "The Dynamic and Stochastic Knapsack Problem with Random Sized Items," Operations Research, INFORMS, vol. 49(1), pages 26-41, February.
    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. Chiang, David Ming-Huang & Wu, Andy Wei-Di, 2011. "Discrete-order admission ATP model with joint effect of margin and order size in a MTO environment," International Journal of Production Economics, Elsevier, vol. 133(2), pages 761-775, October.

    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. Mofidi, Seyed Shahab & Pazour, Jennifer A. & Roy, Debjit, 2018. "Proactive vs. reactive order-fulfillment resource allocation for sea-based logistics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 114(C), pages 66-84.
    2. Jingxian Chen & Liang Liang & Dong-Qing Yao, 2017. "Pre-positioning of relief inventories for non-profit organizations: a newsvendor approach," Annals of Operations Research, Springer, vol. 259(1), pages 35-63, December.
    3. Jan A. Van Mieghem & Nils Rudi, 2002. "Newsvendor Networks: Inventory Management and Capacity Investment with Discretionary Activities," Manufacturing & Service Operations Management, INFORMS, vol. 4(4), pages 313-335, August.
    4. Serrano, Breno & Minner, Stefan & Schiffer, Maximilian & Vidal, Thibaut, 2024. "Bilevel optimization for feature selection in the data-driven newsvendor problem," European Journal of Operational Research, Elsevier, vol. 315(2), pages 703-714.
    5. Özen, Ulaş & Doğru, Mustafa K. & Armagan Tarim, S., 2012. "Static-dynamic uncertainty strategy for a single-item stochastic inventory control problem," Omega, Elsevier, vol. 40(3), pages 348-357.
    6. Helena Gaspars-Wieloch, 2017. "Newsvendor problem under complete uncertainty: a case of innovative products," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(3), pages 561-585, September.
    7. Yongho Lee & Taesu Cheong, 2022. "Service Level Constrained Distribution-Free Newsvendor Problem with Balking Penalty," Mathematics, MDPI, vol. 10(14), pages 1-14, July.
    8. Mostard, Julien & Teunter, Ruud, 2006. "The newsboy problem with resalable returns: A single period model and case study," European Journal of Operational Research, Elsevier, vol. 169(1), pages 81-96, February.
    9. Feng, Youyi & Xiao, Baichun, 2006. "A continuous-time seat control model for single-leg flights with no-shows and optimal overbooking upper bound," European Journal of Operational Research, Elsevier, vol. 174(2), pages 1298-1316, October.
    10. Coskun, Abdullah & Elmaghraby, Wedad & Karaman, M. Muge & Salman, F. Sibel, 2019. "Relief aid stocking decisions under bilateral agency cooperation," Socio-Economic Planning Sciences, Elsevier, vol. 67(C), pages 147-165.
    11. Bo Dai & Fenfen Li, 2021. "Joint Inventory Replenishment Planning of an E-Commerce Distribution System with Distribution Centers at Producers’ Locations," Logistics, MDPI, vol. 5(3), pages 1-14, July.
    12. Alexander G. Nikolaev & Sheldon H. Jacobson, 2010. "Technical Note ---Stochastic Sequential Decision-Making with a Random Number of Jobs," Operations Research, INFORMS, vol. 58(4-part-1), pages 1023-1027, August.
    13. Kim, Nayeon & Montreuil, Benoit & Klibi, Walid & Zied Babai, M., 2023. "Network inventory deployment for responsive fulfillment," International Journal of Production Economics, Elsevier, vol. 255(C).
    14. Mohammadivojdan, Roshanak & Geunes, Joseph, 2018. "The newsvendor problem with capacitated suppliers and quantity discounts," European Journal of Operational Research, Elsevier, vol. 271(1), pages 109-119.
    15. Mehran Ullah & Irfanullah Khan & Biswajit Sarkar, 2019. "Dynamic Pricing in a Multi-Period Newsvendor Under Stochastic Price-Dependent Demand," Mathematics, MDPI, vol. 7(6), pages 1-15, June.
    16. Ülkü, M. Ali & Gürler, Ülkü, 2018. "The impact of abusing return policies: A newsvendor model with opportunistic consumers," International Journal of Production Economics, Elsevier, vol. 203(C), pages 124-133.
    17. Shi, Jianmai & Zhang, Guoqing, 2010. "Multi-product budget-constrained acquisition and pricing with uncertain demand and supplier quantity discounts," International Journal of Production Economics, Elsevier, vol. 128(1), pages 322-331, November.
    18. U Benzion & Y Cohen & R Peled & T Shavit, 2008. "Decision-making and the newsvendor problem: an experimental study," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(9), pages 1281-1287, September.
    19. Banerjee, Pradeep K. & Turner, T. Rolf, 2012. "A flexible model for the pricing of perishable assets," Omega, Elsevier, vol. 40(5), pages 533-540.
    20. Zhang, Michael & Bell, Peter C., 2007. "The effect of market segmentation with demand leakage between market segments on a firm's price and inventory decisions," European Journal of Operational Research, Elsevier, vol. 182(2), pages 738-754, October.

    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:pal:jorsoc:v:54:y:2003:i:6:d:10.1057_palgrave.jors.2601554. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.