A hybrid framework for over-constrained generalized resource-constrained project scheduling problems

DOI10.1007/S10462-004-1286-8zbMath1076.68072OpenAlexW2093121102MaRDI QIDQ1768898

Xianqiang Yang

Publication date: 15 March 2005

Published in: Artificial Intelligence Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10462-004-1286-8

zbMATH Keywords

project schedulingTabu SearchGenetic Algorithmresource constrained

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some efficient multi-heuristic procedures for resource-constrained project scheduling
• Scheduling subject to resource constraints: Classification and complexity
• A branch and bound algorithm for the resource-constrained project scheduling problem
• A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
• A comparative study of computational procedures for the resource constrained project scheduling problem
• Heuristics for scheduling resource-constrained projects in MPM networks
• One-machine generalized precedence constrained scheduling problems
• Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production
• Resource-constrained project scheduling: A survey of recent developments.
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• Heuristic methods for evolutionary computation techniques
• Hard and soft constraints for reasoning about qualitative conditional preferences
• The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• Project scheduling: The effects of problem structure on heuristic performance
• Minimizing Resource Availability Costs in Time-Limited Project Networks
• A constraint-based method for project scheduling with time windows

This page was built for publication: A hybrid framework for over-constrained generalized resource-constrained project scheduling problems