Iterative Flattening Search on RCPSP/max Problems: Recent Developments

DOI10.1007/978-3-642-03251-6_7zbMath1248.68460OpenAlexW1570162751MaRDI QIDQ5191409

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)

Related Items (1)

Solving RCPSP/max by lazy clause generation

Uses Software

• PSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Temporal constraint networks
• Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production
• Resource-constrained project scheduling: Notation, classification, models, and methods
• AI*IA 2005: Advances in Artificial Intelligence
• A constraint-based method for project scheduling with time windows
• Scheduling with forbidden sets

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