Minimax resource allocation problems with ordering constraints

DOI<719::AID-NAV3220410604>3.0.CO;2-J 10.1002/1520-6750(199410)41:6<719::AID-NAV3220410604>3.0.CO;2-JzbMath0812.90116OpenAlexW2046408456MaRDI QIDQ4314872

Hanan Luss, Lisa M. Betts, J. Randall Brown

Publication date: 1 December 1994

Full work available at URL: https://doi.org/10.1002/1520-6750(199410)41:6<719::aid-nav3220410604>3.0.co;2-j

zbMATH Keywords

resource allocationlarge-scale and complex production planningmultiple knapsack resource constraints

Mathematics Subject Classification ID

Production models (90B30) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (7)

Multiperiod allocation of substitutable resources ⋮ Mathematical model and optimization in global production problems. ⋮ Optimality conditions for distributive justice ⋮ Equitable bandwidth allocation in content distribution networks ⋮ Optimization in production quota problem with convex cost function ⋮ An equitable bandwidth allocation model for video-on-demand networks ⋮ Fair optimization and networks: a survey

Cites Work

• Max-min resource allocation
• Unnamed Item

This page was built for publication: Minimax resource allocation problems with ordering constraints