Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Huy, T.P. (2000). Constraint Propagation and the DSP. In: Constraint Propagation in Flexible Manufacturing. Lecture Notes in Economics and Mathematical Systems, vol 492. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58335-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-58335-3_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67913-4
Online ISBN: 978-3-642-58335-3
eBook Packages: Springer Book Archive