Near-Optimal Solution of Generalized Resource Allocation Problems with Large Capacities

DOI10.1287/opre.38.5.902zbMath0723.90072OpenAlexW2072934394MaRDI QIDQ5202037

L. K. Platzman, Steven T. Hackman

Publication date: 1990

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.38.5.902

zbMATH Keywords

near-optimal solutionnondifferentiable additively-separable non-concave objective functionnonsmooth convex relation

Mathematics Subject Classification ID

Nonlinear programming (90C30) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (9)

Scheduling the replenishment of just-in-time supermarkets in assembly plants ⋮ Enhancing performance in order picking processes by dynamic storage systems ⋮ Decision model and analysis for investment interest expense deduction and allocation ⋮ Design and control of warehouse order picking: a literature review ⋮ Optimal spares allocation to an exchangeable-item repair system with tolerable wait ⋮ Mathematical model for warehouse design and product allocation ⋮ Order Picking with Heterogeneous Technologies: An Integrated Article-to-Device Assignment and Manpower Allocation Problem ⋮ Forward-reserve allocation in a warehouse with unit-load replenishments ⋮ The discrete forward-reserve problem -- allocating space, selecting products, and area sizing in forward order picking

This page was built for publication: Near-Optimal Solution of Generalized Resource Allocation Problems with Large Capacities