Solving resource-constrained project scheduling problems: conceptual validation of FLP formulation and efficient permutation-based ABC computation

DOI10.1016/j.cor.2013.02.012zbMath1348.90400OpenAlexW2081923486MaRDI QIDQ336432

Yoonho Seo, Qiong Jia

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.02.012

zbMATH Keywords

artificial bee colony optimizationfacility layout problempermutation representation schemeresource-constrained project scheduling problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items

Scheduling interrelated activities in complex projects under high-order rework: a DSM-based approach, A DRL based approach for adaptive scheduling of one-of-a-kind production, A survey of hybrid metaheuristics for the resource-constrained project scheduling problem

Uses Software

• ABC

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling inspired models for two-dimensional packing problems
• Event-based MILP models for resource-constrained project scheduling problems
• Efficient models for the facility layout problem
• Experimental investigation of heuristics for resource-constrained project scheduling: an update
• Scheduling subject to resource constraints: Classification and complexity
• A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version.
• Project scheduling. A research handbook.
• A linear programming and constraint propagation-based lower bound for the RCPSP
• Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
• An effective shuffled frog-leaping algorithm for resource-constrained project scheduling problem
• Justification and RCPSP: a technique that pays
• Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
• Scheduling of resource-constrained projects
• The project scheduling polyhedron: Dimension, facets and lifting theorems
• An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
• A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints
• Packing problems and project scheduling models: an integrating perspective
• Heuristic Performance and Network/Resource Characteristics in Resource-constrained Project Scheduling
• Case-based reasoning and improved adaptive search for project scheduling
• Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithms
• A self-adapting genetic algorithm for project scheduling under resource constraints
• Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems