Computing tight time windows for RCPSPWET with the primal-dual method

Keri, A.;Kis, T.
(2007) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. 4th International Conference, CPAIOR 2007 — Location: Brussels, Belgium (23.May.2007)

Files

No attached file found for this publication.

Details

Authors
  • Keri, A.
    Author
  • Kis, T.
    Author
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.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Keri, A., & Kis, T. (2007). Computing tight time windows for RCPSPWET with the primal-dual method. In Van Hentenryck, P.; Wolsey, L.; (ed.), Integration of AI and OR Techniques in Constraint Programming forCombinatorial Optimization Problems. Proceedings 4th InternationalConference, CPAIOR 2007 (p. p. 127-140). Springer-verlag. https://hdl.handle.net/2078.5/222404