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.

Project Scheduling as a Disjunctive Temporal Problem

Oddi Angelo;Rasconi Riccardo;Cesta Amedeo
2010

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.
2010
Istituto di Scienze e Tecnologie della Cognizione - ISTC
978-1-60750-605-8
constraint-based reasoning
project scheduling
disjunctive temporal problem
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/305740
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? 2
social impact