A hybrid framework for over-constrained generalized resource-constrained project scheduling problems
DOI10.1007/S10462-004-1286-8zbMATH Open1076.68072OpenAlexW2093121102MaRDI QIDQ1768898FDOQ1768898
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
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
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
- Scheduling subject to resource constraints: Classification and complexity
- A branch and bound algorithm for the resource-constrained project scheduling problem
- Resource-constrained project scheduling: A survey of recent developments.
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- Title not available (Why is that?)
- A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimizing Resource Availability Costs in Time-Limited Project Networks
- Project scheduling: The effects of problem structure on heuristic performance
- The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
- A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
- Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production
- A constraint-based method for project scheduling with time windows
- One-machine generalized precedence constrained scheduling problems
- Some efficient multi-heuristic procedures for resource-constrained project scheduling
- Hard and soft constraints for reasoning about qualitative conditional preferences
- Heuristic methods for evolutionary computation techniques
- Title not available (Why is that?)
- A comparative study of computational procedures for the resource constrained project scheduling problem
- Heuristics for scheduling resource-constrained projects in MPM networks
Uses Software
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)
