Iterative Flattening Search on RCPSP/max Problems: Recent Developments

DOI10.1007/978-3-642-03251-6_7MaRDI QIDQ5191409zbMATH OpenOpenAlexFDO

Authors Angelo Oddi, Riccardo Rasconi

Publication date 6 August 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03251-6_7

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• A constraint-based method for project scheduling with time windows
• Solving RCPSP/max by lazy clause generation
• An effective shuffled frog-leaping algorithm for resource-constrained project scheduling problem
• A population-based approach to the resource-constrained project scheduling problem
• An effective heuristic for project scheduling with resource availability cost

Cites work

• scientific article; zbMATH DE number 4135692 (Why is no real title available?)
• A constraint-based method for project scheduling with time windows
• AI*IA 2005: Advances in Artificial Intelligence
• Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production
• Introduction to algorithms
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Scheduling with forbidden sets
• Stochastic local search. Foundations and applications.
• Temporal constraint networks

Cited in

(1)

• Solving RCPSP/max by lazy clause generation

Describes a project that uses

Uses Software

• PSPLIB

This page was built for publication: Iterative Flattening Search on RCPSP/max Problems: Recent Developments

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