Constrained multi-project planning problems: A Lagrangean decomposition approach

DOI10.1016/0377-2217(94)90389-1zbMath0813.90067MaRDI QIDQ1342015

Carlo Vercellis

Publication date: 13 June 1995

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90389-1

zbMATH Keywords

branch-and-bound; project management; resource constraints; Lagrangean decomposition; multi-project planning problems

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

A heuristic solution framework for the resource constrained (multi-)project scheduling problem with sequence-dependent transfer times, Optimization analysis for design and planning of multi-project programs, Maximal covering code multiplexing access telecommunication networks, A learning-based optimization approach to multi-project scheduling, A fuzzy random resource-constrained scheduling model with~multiple projects and its application to a working procedure in a large-scale water conservancy and hydropower construction project, A genetic algorithm for the resource constrained multi-project scheduling problem

Cites Work

• Unnamed Item
• Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems
• A multiobjective, multi-level heuristic for dynamic resource constrained scheduling problems
• Multiobjective network scheduling with efficient use of renewable and nonrenewable resources
• Capacity analysis in repetitive assemble-to-order manufacturing systems
• A class of generalized greedy algorithms for the multi-knapsack problem
• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• Optimal resource profiles for program scheduling
• Hierarchical models for multi-project planning and scheduling
• Synchronized Development of Production, Inventory, and Distribution Schedules
• Multi-Project Scheduling: Categorization of Heuristic Rules Performance
• Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
• Scheduling a Project to Maximize Its Present Value: A Zero-One Programming Approach
• Validation of subgradient optimization
• Cash Flows in Networks