Capacity planning by the dynamic multi-resource generalized assignment problem (DMRGAP)
From MaRDI portal
Publication:1291708
DOI10.1016/S0377-2217(97)00035-0zbMATH Open0957.90074OpenAlexW2080616228MaRDI QIDQ1291708FDOQ1291708
Authors: Avraham Shtub, Konstantin Kogan
Publication date: 22 March 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00035-0
Recommendations
Cites Work
- A Survey of the Maximum Principles for Optimal Control Problems with State Constraints
- Algorithms for the Multi-Resource Generalized Assignment Problem
- A branch and bound algorithm for the generalized assignment problem
- Modeling Facility Location Problems as Generalized Assignment Problems
- A maximum principle based combined method for scheduling in a flexible manufacturing system
- An optimal control model for continuous time production and setup scheduling
Cited In (11)
- Addressing capacity uncertainty in resource-constrained assignment problems
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
- Dynamic capacity acquisition and assignment under uncertainty
- Capacity planning with competitive decision-makers: trilevel MILP formulation, degeneracy, and solution approaches
- Assignment problems: a golden anniversary survey
- The equilibrium generalized assignment problem and genetic algorithm
- Optimized assignment patterns in mobile edge cloud networks
- A three-phase matheuristic algorithm for the multi-day task assignment problem
- Fleet management: a vehicle and driver assignment model
- A Survey of the Generalized Assignment Problem and Its Applications
- Optimal scheduling of parallel machines with constrained resources
This page was built for publication: Capacity planning by the dynamic multi-resource generalized assignment problem (DMRGAP)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1291708)