Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities

DOI10.1007/s00291-016-0435-1zbMath1339.90127MaRDI QIDQ280170

Massimiliano Caramia, Stefano Giordani, Lucio Bianco

Publication date: 4 May 2016

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-016-0435-1

zbMATH Keywords

project scheduling; generalized precedence relationships; resource levelling

Mathematics Subject Classification ID

90C11: Mixed integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B35: Deterministic scheduling theory in operations research

Related Items

Editorial ``Project management and scheduling

Uses Software

• PSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• The total adjustment cost problem: applications, models, and solution algorithms
• An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations
• Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound
• A priority-rule method for project scheduling with work-content constraints
• Mixed-integer linear programming for resource leveling problems
• Exact methods for the resource levelling problem
• A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
• Finding All Spanning Trees of Directed and Undirected Graphs
• The resource renting problem subject to temporal constraints