Title
Resource-Constrained Assignment Problems with Shared Resource Consumption and Flexible Demand
Abstract
<P>This paper considers a very general class of customer-to-resource assignment problems relevant to a variety of manufacturing contexts. This problem class addresses settings in which subsets of customer types share resource capacities as well as a fixed amount of capacity consumption, independent of production volume. More broadly, our model addresses cross-facility production limits and shared capacity consumption within each customer type. To solve these large-scale optimization problems, we apply a branch-and-price solution approach. This approach relies on an effective solution method for a novel class of nonlinear knapsack pricing problems. As our computational results demonstrate, despite the fact that the resulting master problem is not a simple set-partitioning problem, the problem's relaxation is sufficiently tight to produce an algorithm that significantly outperforms CPLEX for a wide range of problem parameter settings.</P>
Year
DOI
Venue
2014
10.1287/ijoc.2013.0565
INFORMS Journal on Computing
Keywords
Field
DocType
branch-and-price,capacitated assignment problem,nonlinear knapsack problem,branch and price
Weapon target assignment problem,Mathematical optimization,Quadratic assignment problem,Generalized assignment problem,Continuous knapsack problem,Cutting stock problem,Knapsack problem,Optimization problem,Linear bottleneck assignment problem,Mathematics
Journal
Volume
Issue
ISSN
26
2
1091-9856
Citations 
PageRank 
References 
1
0.36
8
Authors
3
Name
Order
Citations
PageRank
Chase Rainwater1707.12
Joseph Geunes230828.72
H. Edwin Romeijn376983.88