Resource-Constrained Assignment Scheduling

DOI10.1287/OPRE.34.4.560MaRDI QIDQ3750521zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

branch-and-bound algorithmapproximate solutionssubgradient optimizationNP-completeheuristic procedurecomputational experiencedepth-first, polychotomous branching strategyresource-constrained assignment scheduling

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• Solving the generalized assignment problem: an optimizing and heuristic approach
• A truncated exponential algorithm for the lightly constrained assignment problem
• A branch-and-bound algorithm for the singly constrained assignment problem
• A branch-and-bound algorithm for the resource-constrained project scheduling problem
• A Tabu Search Algorithm for the Resource-Constrained Assignment Problem

Cited in

(35)

• Addressing capacity uncertainty in resource-constrained assignment problems
• The Rank-One Quadratic Assignment Problem
• The \(k\)-cardinality assignment problem
• Repulsive assignment problem
• A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints
• Assignment problems: a golden anniversary survey
• On the variable-depth-search heuristic for the linear-cost generalized assignment problem
• scientific article; zbMATH DE number 2042673 (Why is no real title available?)
• Resource-constrained assignment problems with shared resource consumption and flexible demand
• Some clarifications on the bicriteria scheduling of unit execution time jobs on a single machine
• Resource constrained assignment problems
• A binary-rounding heuristic for multi-period variable-task-duration assignment problems
• A variant of time minimizing assignment problem
• Heuristics for the multi-resource generalized assignment problem
• The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm
• Exchanges procedures for timetabling problems
• A state-of-the-art survey on multi-scenario scheduling
• Robust scheduling on a single machine to minimize total flow time
• A branch-and-bound algorithm for the singly constrained assignment problem
• Two phase algorithms for the bi-objective assignment problem
• Acquisition planning and scheduling of computing resources
• Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type
• The singly constrained assignment problem: An AP basis algorithm
• An improved bounding procedure for the constrained assignment problem
• A constrained matching problem
• scientific article; zbMATH DE number 1728540 (Why is no real title available?)
• Minmax combinatorial optimization
• Lagrangian relaxation and branch-and-price algorithm for resource assignment problem in divisional seru systems
• Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships
• scientific article; zbMATH DE number 3894816 (Why is no real title available?)
• Multipurpose machine scheduling with rejection and identical job processing times
• Maximizing the value of a space mission
• Efficient and Local Efficient Solutions for Assignment Type Problems
• Reallocation problems in scheduling
• Preventive maintenance scheduling of power generating units

This page was built for publication: Resource-Constrained Assignment Scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3750521)