Project Scheduling as a Disjunctive Temporal Problem

Authors:
Angelo Oddi;Riccardo Rasconi;Amedeo Cesta
Affiliations:
ISTC-CNR, Via San Martino della Battaglia 44, 00185 Rome, Italy. Email: {angelo.oddi,riccardo.rasconi,amedeo.cesta}@istc.cnr.it;ISTC-CNR, Via San Martino della Battaglia 44, 00185 Rome, Italy. Email: {angelo.oddi,riccardo.rasconi,amedeo.cesta}@istc.cnr.it;ISTC-CNR, Via San Martino della Battaglia 44, 00185 Rome, Italy. Email: {angelo.oddi,riccardo.rasconi,amedeo.cesta}@istc.cnr.it
Venue:
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Year:
2010

Citing 6
Cited 2

Scheduling project networks with resource constraints and time windows

Annals of Operations Research
Backtracking algorithms for disjunctions of temporal constraints

Artificial Intelligence
A Constraint-Based Method for Project Scheduling with Time Windows

Journal of Heuristics
SAT-Based Procedures for Temporal Reasoning

ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Efficient solution techniques for disjunctive temporal reasoning problems

Artificial Intelligence
Complete MCS-based search: application to resource constrained project scheduling

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

CTP: A New Constraint-Based Formalism for Conditional, Temporal Planning

Constraints
Solving disjunctive temporal problems with preferences using maximum satisfiability

AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”

Quantified Score

Hi-index	0.00

Visualization

Abstract

The main result of the paper is the reduction of the RCPSP/max problem to a Disjunctive Temporal Problem that allows customization of specific properties within a backtracking search procedure for makespan optimization. In addition, a branching strategy is proposed able to deduce new constraints which explicitly represent infeasible or useless search paths. A new variable ordering heuristic (called clustering) is also used which provides a further boosting to the algorithm's effectiveness.