Resource-Constrained Assignment Scheduling
From MaRDI portal
Publication:3750521
DOI10.1287/opre.34.4.560zbMath0609.90087MaRDI QIDQ3750521
Joseph B. Mazzola, Alan W. Neebe
Publication date: 1986
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.34.4.560
branch-and-bound algorithm; approximate solutions; NP-complete; computational experience; subgradient optimization; heuristic procedure; depth-first, polychotomous branching strategy; resource-constrained assignment scheduling
65K05: Numerical mathematical programming methods
90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
Related Items
Efficient and Local Efficient Solutions for Assignment Type Problems, Heuristics for the multi-resource generalized assignment problem, Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships, Assignment problems: a golden anniversary survey, Repulsive assignment problem, Minmax combinatorial optimization, An improved bounding procedure for the constrained assignment problem, Some clarifications on the bicriteria scheduling of unit execution time jobs on a single machine, Exchanges procedures for timetabling problems, Resource constrained assignment problems, A variant of time minimizing assignment problem, The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm, The \(k\)-cardinality assignment problem, Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type, A constrained matching problem, The singly constrained assignment problem: An AP basis algorithm, A binary-rounding heuristic for multi-period variable-task-duration assignment problems, Preventive maintenance scheduling of power generating units, A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints, A branch-and-bound algorithm for the singly constrained assignment problem, Two phase algorithms for the bi-objective assignment problem, Addressing capacity uncertainty in resource-constrained assignment problems, On the variable-depth-search heuristic for the linear-cost generalized assignment problem
