IDEAS home Printed from https://ideas.repec.org/r/inm/ormnsc/v26y1980i1p34-43.html
   My bibliography  Save this item

Simple Ranking Methods for Allocation of One Resource

Citations

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


Cited by:

  1. De Waegenaere, A.M.B. & Wielhouwer, J.L., 2001. "A Partial Ranking Algorithm for Resource Allocation Problems," Other publications TiSEM 8b2e0185-36f9-43df-8a3d-d, Tilburg University, School of Economics and Management.
  2. Amy R. Ward & Mor Armony, 2013. "Blind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers," Operations Research, INFORMS, vol. 61(1), pages 228-243, February.
  3. Bretthauer, Kurt M. & Shetty, Bala, 2002. "The nonlinear knapsack problem - algorithms and applications," European Journal of Operational Research, Elsevier, vol. 138(3), pages 459-472, May.
  4. Shōgo Shiode & Hiroaki Ishi & Toshio Nishida, 1987. "A stochastic linear knapsack problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(5), pages 753-759, October.
  5. Dreyfuss, Michael & Giat, Yahel, 2017. "Optimal spares allocation to an exchangeable-item repair system with tolerable wait," European Journal of Operational Research, Elsevier, vol. 261(2), pages 584-594.
  6. Itay Gurvich & Ward Whitt, 2009. "Scheduling Flexible Servers with Convex Delay Costs in Many-Server Service Systems," Manufacturing & Service Operations Management, INFORMS, vol. 11(2), pages 237-253, June.
  7. Puranam, Kartikeya & Novak, David C. & Lucas, Marilyn T. & Fung, Mark, 2017. "Managing blood inventory with multiple independent sources of supply," European Journal of Operational Research, Elsevier, vol. 259(2), pages 500-511.
  8. Chernonog, Tatyana & Goldberg, Noam, 2018. "On the multi-product newsvendor with bounded demand distributions," International Journal of Production Economics, Elsevier, vol. 203(C), pages 38-47.
  9. Steven J. Erlebacher & Medini R. Singh, 1999. "Optimal Variance Structures and Performance Improvement of Synchronous Assembly Lines," Operations Research, INFORMS, vol. 47(4), pages 601-618, August.
  10. Kameshwaran, S. & Narahari, Y., 2009. "Nonconvex piecewise linear knapsack problems," European Journal of Operational Research, Elsevier, vol. 192(1), pages 56-68, January.
  11. Zhang, Jianzhong & Xu, Chengxian, 2010. "Inverse optimization for linearly constrained convex separable programming problems," European Journal of Operational Research, Elsevier, vol. 200(3), pages 671-679, February.
  12. Bajwa, Naeem & Sox, Charles R. & Ishfaq, Rafay, 2016. "Coordinating pricing and production decisions for multiple products," Omega, Elsevier, vol. 64(C), pages 86-101.
  13. Gullu, Refik & Erkip, Nesim, 1996. "Optimal allocation policies in a two-echelon inventory problem with fixed shipment costs," International Journal of Production Economics, Elsevier, vol. 46(1), pages 311-321, December.
  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. Yossi Aviv & Awi Federgruen, 2001. "Design for Postponement: A Comprehensive Characterization of Its Benefits Under Unknown Demand Distributions," Operations Research, INFORMS, vol. 49(4), pages 578-598, August.
  16. Zhang, Bin & Hua, Zhongsheng, 2008. "A unified method for a class of convex separable nonlinear knapsack problems," European Journal of Operational Research, Elsevier, vol. 191(1), pages 1-6, November.
  17. Patriksson, Michael & Strömberg, Christoffer, 2015. "Algorithms for the continuous nonlinear resource allocation problem—New implementations and numerical studies," European Journal of Operational Research, Elsevier, vol. 243(3), pages 703-722.
  18. Dreyfuss, Michael & Giat, Yahel, 2019. "Allocating spares to maximize the window fill rate in a periodic review inventory system," International Journal of Production Economics, Elsevier, vol. 214(C), pages 151-162.
  19. Alexandre Belloni & Giuseppe Lopomo & Shouqiang Wang, 2017. "Resource Allocation Under Demand Uncertainty and Private Information," Management Science, INFORMS, vol. 63(12), pages 4219-4235, December.
  20. Patriksson, Michael, 2008. "A survey on the continuous nonlinear resource allocation problem," European Journal of Operational Research, Elsevier, vol. 185(1), pages 1-46, February.
  21. Peter L. Jackson & John A. Muckstadt, 1989. "Risk pooling in a two‐period, two‐echelon inventory stocking and allocation problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 36(1), pages 1-26, February.
  22. DePaolo, Concetta A. & Rader, David Jr., 2007. "A heuristic algorithm for a chance constrained stochastic program," European Journal of Operational Research, Elsevier, vol. 176(1), pages 27-45, January.
  23. Michelle Opp & Kevin Glazebrook & Vidyadhar G. Kulkarni, 2005. "Outsourcing warranty repairs: Dynamic allocation," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(5), pages 381-398, August.
  24. Hanan Luss, 1999. "On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach," Operations Research, INFORMS, vol. 47(3), pages 361-378, June.
  25. De Waegenaere, A.M.B. & Wielhouwer, J.L., 2001. "A Partial Ranking Algorithm for Resource Allocation Problems," Discussion Paper 2001-40, Tilburg University, Center for Economic Research.
  26. Fleischmann, Moritz & Kloos, Konstantin & Nouri, Maryam & Pibernik, Richard, 2020. "Single-period stochastic demand fulfillment in customer hierarchies," European Journal of Operational Research, Elsevier, vol. 286(1), pages 250-266.
  27. David M. Markowitz & Lawrence M. Wein, 2001. "Heavy Traffic Analysis of Dynamic Cyclic Policies: A Unified Treatment of the Single Machine Scheduling Problem," Operations Research, INFORMS, vol. 49(2), pages 246-270, April.
  28. Awi Federgruen & Aliza Heching, 2002. "Multilocation Combined Pricing and Inventory Control," Manufacturing & Service Operations Management, INFORMS, vol. 4(4), pages 275-295, March.
  29. AgralI, Semra & Geunes, Joseph, 2009. "Solving knapsack problems with S-curve return functions," European Journal of Operational Research, Elsevier, vol. 193(2), pages 605-615, March.
  30. Edirisinghe, Chanaka & Atkins, Derek, 2017. "Lower bounding inventory allocations for risk pooling in two-echelon supply chains," International Journal of Production Economics, Elsevier, vol. 187(C), pages 159-167.
  31. He, Qie & Zhang, Xiaochen & Nip, Kameng, 2017. "Speed optimization over a path with heterogeneous arc costs," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 198-214.
  32. Lee, Zu-Hsu & Deng, Shiming & Lin, Beixin & Yang, James G.S., 2010. "Decision model and analysis for investment interest expense deduction and allocation," European Journal of Operational Research, Elsevier, vol. 200(1), pages 268-280, January.
  33. Awi Federgruen & C. Daniel Guetta & Garud Iyengar, 2018. "Two‐echelon distribution systems with random demands and storage constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(8), pages 594-618, December.
  34. Hanan Luss & Donald R. Smith, 1988. "Multiperiod allocation of limited resources: A minimax approach," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(4), pages 493-501, August.
  35. Awi Federgruen & Nan Yang, 2008. "Selecting a Portfolio of Suppliers Under Demand and Supply Risks," Operations Research, INFORMS, vol. 56(4), pages 916-936, August.
  36. Renato de Matta & Vernon Ning Hsu & Timothy J. Lowe, 1999. "The selection allocation problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(6), pages 707-725, September.
  37. Serhan Ziya & Hayriye Ayhan & Robert D. Foley, 2008. "A note on optimal pricing for finite capacity queueing systems with multiple customer classes," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(5), pages 412-418, August.
  38. Vahideh Sadat Abedi & Oded Berman & Fred M. Feinberg & Dmitry Krass, 2022. "Strategic new product media planning under emergent channel substitution and synergy," Production and Operations Management, Production and Operations Management Society, vol. 31(5), pages 2143-2166, May.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.