Constraint Propagation and the DSP

  • Toàn Phan Huy
Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 492)


In section 2.2, constraint propagation has been introduced as an elementary method of search space reduction for the CSP or the COP. In this chapter, we examine how constraint propagation techniques can be adapted to the DSP. An important issue is the computational complexity of the techniques applied which has to be weighed against the search space reduction obtained. Recall that establishing n-, n-d- and n-b-consistency for instances of the CSP or the COP are NP-hard problems. It is not difficult to show that the same complexity result applies if we confine ourselves to the more special DSP. Thus, if constraint propagation is to be of any use in solving the DSP, we will have to content ourselves with approximations of the consistency levels mentioned above.


Completion Time Start Time Constraint Propagation Feasible Schedule Consistency Test 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Toàn Phan Huy
    • 1
  1. 1.Institut für Betriebswirtschaftslehre IIIRheinische Friedrich-Wilhelm-UniversitätBonnGermany

Personalised recommendations