Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships

DOI10.1007/s10898-004-4273-3zbMath1071.90037OpenAlexW2084979305MaRDI QIDQ556008

Toshihide Ibaraki, Eugene Khmelnitsky, Konstantin Kogan

Publication date: 13 June 2005

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-004-4273-3

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (4)

On a facility location problem with applications to tele-diagnostic ⋮ A Survey of the Generalized Assignment Problem and Its Applications ⋮ Fleet management: a vehicle and driver assignment model ⋮ Dynamic job assignment: a column generation approach with an application to surgery allocation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm
• DGAP -- The dynamic generalized assignment problem
• A maximum principle based combined method for scheduling in a flexible manufacturing system
• Resource-Constrained Assignment Scheduling
• An Algorithm for Large Zero-One Knapsack Problems
• Algorithms for the Multi-Resource Generalized Assignment Problem
• A branch and bound algorithm for the generalized assignment problem
• An Efficient Algorithm for the 0-1 Knapsack Problem
• An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks
• Modeling Facility Location Problems as Generalized Assignment Problems
• A Survey of the Maximum Principles for Optimal Control Problems with State Constraints
• On the optimality of the Karhunen-Loève expansion (Corresp.)

This page was built for publication: Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships