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

András Kéri, Tamás Kis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationIntegration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - 4th International Conference, CPAIOR 2007, Proceedings
Pages127-140
Number of pages14
Publication statusPublished - Dec 20 2007
Event4th International Conference on Integration of Artificial Intelligence, Constraint Programming, and Operations Research Techniques for Combinatorial Optimization Problems, CPAIOR 2007 - Brussels, Belgium
Duration: May 23 2007May 26 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4510 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other4th International Conference on Integration of Artificial Intelligence, Constraint Programming, and Operations Research Techniques for Combinatorial Optimization Problems, CPAIOR 2007
CountryBelgium
CityBrussels
Period5/23/075/26/07

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Kéri, A., & Kis, T. (2007). Computing tight time windows for RCPSPWET with the primal-dual method. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - 4th International Conference, CPAIOR 2007, Proceedings (pp. 127-140). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4510 LNCS).