Computing Tight Time Windows for RCPSPWET with the Primal-Dual Method

Authors:
András Kéri;Tamás Kis
Affiliations:
Chair of Business Administration, Transport and Logistics, Technical University of Dresden, Andreas Schubert str. 23, D-01069 Dresden, Germany;Computer and Automation Institute, Kende str. 13-17, H-1111 Budapest, Hungary
Venue:
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Year:
2007

Citing 5
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
A branch-and-bound procedure for the multiple resource-constrained project scheduling problem

Management Science
Constraint-Based Scheduling

Constraint-Based Scheduling
Fast (incremental) algorithms for useful classes of simple temporal problems with preferences

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Temporal constraint reasoning with preferences

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we combine OR and CP techniques to solve the Resource-Constrained Project Scheduling Problem with Earliness-Tardiness costs and general temporal constraints. Namely, we modify the Primal-Dual algorithm for solving the maximum-cost flow problem in a network to deduce tight time windows for activities with respect to a finite upper bound on the optimal objective function value. We compare our method to the only exact method in the literature. Our results show that time window computations and additional domain filtering techniques may improve the performance of tree-search based methods.