Resource-Constrained Assignment Scheduling
From MaRDI portal
Publication:3750521
DOI10.1287/opre.34.4.560zbMath0609.90087OpenAlexW2108067803MaRDI 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 algorithmapproximate solutionsNP-completecomputational experiencesubgradient optimizationheuristic proceduredepth-first, polychotomous branching strategyresource-constrained assignment scheduling
Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (28)
Preventive maintenance scheduling of power generating units ⋮ A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints ⋮ Efficient and Local Efficient Solutions for Assignment Type Problems ⋮ Heuristics for the multi-resource generalized assignment problem ⋮ A constrained matching problem ⋮ Assignment problems: a golden anniversary survey ⋮ The \(k\)-cardinality assignment problem ⋮ The singly constrained assignment problem: An AP basis algorithm ⋮ The Rank-One Quadratic Assignment Problem ⋮ A binary-rounding heuristic for multi-period variable-task-duration assignment problems ⋮ Minmax combinatorial optimization ⋮ A state-of-the-art survey on multi-scenario scheduling ⋮ Resource-Constrained Assignment Problems with Shared Resource Consumption and Flexible Demand ⋮ A branch-and-bound algorithm for the singly constrained assignment problem ⋮ Two phase algorithms for the bi-objective assignment problem ⋮ 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 ⋮ On the variable-depth-search heuristic for the linear-cost generalized assignment problem ⋮ Repulsive assignment problem ⋮ Robust scheduling on a single machine to minimize total flow time ⋮ Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships ⋮ Multipurpose machine scheduling with rejection and identical job processing times ⋮ Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type ⋮ Resource constrained assignment problems ⋮ Addressing capacity uncertainty in resource-constrained assignment problems ⋮ A variant of time minimizing assignment problem ⋮ The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm
This page was built for publication: Resource-Constrained Assignment Scheduling
