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

DOI10.1007/S10462-004-1286-8MaRDI QIDQ1768898zbMATH OpenOpenAlexFDO

Authors 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) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• A constraint integer programming approach for resource-constrained project scheduling
• A Hybrid Algorithm for a Class of Resource Constrained Scheduling Problems
• A constraint programming approach for the resource-constrained project scheduling problem
• A constraint-based method for project scheduling with time windows
• Scheduling of resource-constrained projects

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 4135692 (Why is no real title available?)
• scientific article; zbMATH DE number 5345853 (Why is no real title available?)
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 3599820 (Why is no real title available?)
• scientific article; zbMATH DE number 194622 (Why is no real title available?)
• scientific article; zbMATH DE number 830382 (Why is no real title available?)
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• 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
• A constraint-based method for project scheduling with time windows
• Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production
• Hard and soft constraints for reasoning about qualitative conditional preferences
• Heuristic methods for evolutionary computation techniques
• Heuristics for scheduling resource-constrained projects in MPM networks
• Minimizing Resource Availability Costs in Time-Limited Project Networks
• One-machine generalized precedence constrained scheduling problems
• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• Project scheduling: The effects of problem structure on heuristic performance
• Resource-constrained project scheduling: A survey of recent developments.
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Scheduling subject to resource constraints: Classification and complexity
• Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
• Some efficient multi-heuristic procedures for resource-constrained project scheduling
• The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)

Describes a project that uses

Uses Software

• CPLEX

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

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