Abstract
Nowadays many scheduling problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm requires an order in which variables and values should to be considered. Choosing the right order of variables and values can noticeably improve the efficiency of constraint satisfaction.
Furthermore, the order in which constraints are studied can improve efficiency, particularly in problems with non-binary constraints. In this paper, we propose a preprocess heuristic called Constraint Ordering Heuristic (COH) that classifies the constraints so that the tightest ones are studied first. Thus, inconsistencies can be found earlier and the number of constraint checks can significantly be reduced.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
T.M. Al-Khamis, S. Vemuri, L. Lemonidis, and J. Yellen, ‘Unit maintenance scheduling with fuel constraints’, IEEE Trans. on Power Systems, 933–939, (1992).
R. Barták, ‘Constraint programming: In pursuit of the holy grail’, in Proceedings of WDS99 (invited lecture), Prague, June, (1999).
C. Bessire, ‘Non-binary constraints’, In Proc. Principles and Practice of Constraint Programming (CP-99), 24–27, (1999).
C. Bessire, P. Meseguer, E.C. Freuder, and J. Larrosa, ‘On forward checking for non-binary constraint satisfaction’, Artifical Intelligence, 205–224, (2002).
J.R. Bitner and E.M. Reingold, ‘Backtracking programming techniques’, Communications of the ACM 18, 651–655, (1975).
R. Dechter and I. Meiri, ‘Experimental evaluation of preprocessing algorithms for constraints satisfaction problems’, Artificial Intelligence, 68, 211–241, (1994).
R. Dechter and J. Pearl, ‘Network-based heuristics for constraint satisfaction problems’, Artificial Intelligence, 34, 1–38, (1988).
T.C. Denk and K.K. Parhi, ‘Exhaustive scheduling and retiming of digital signal processing systems’, in IEEE Transactions on Circuits and Systems-II: Analog and Digital Signal Processing, 45, 821–837, (1998).
E. Freuder, ‘A sufficient condition for backtrack-free search’, Journal of the ACM, 29, 24–32, (1982).
D. Frost and R. Dechter, ‘Maintenance scheduling problems as benchmarks for constraint algorithms’, Annals of Mathematics and Artificial Intelligence, 26, 149–170, (1999).
P.A. Geelen, ‘Dual viewpoint heuristic for binary constraint satisfaction problems’, In proceeding of European Conference of Artificial Intelligence (ECAI’92), 31–35, (1992).
I.P. Gent, E. MacIntyre, P. Prosser, and T Walsh, ‘The constrainedness of arc consistency’, Principles and Practice of Constraint Programming, 327–340, (1997).
R. Haralick and Elliot G., ‘Increasing tree efficiency for constraint satisfaction problems’, Artificial Intelligence, 14, 263–314, (1980).
J. Larrosa, Algorithms and Heuristics for total and partial Constraint Satisfaction, Phd Dissertation, UPC, Barcelona, 1998.
L. Ros, T. Creemers, E. Tourouta, and J. Riera, ‘A global constraint model for integrated routeing and scheduling on a transmission network’, in Proc. 7th International Conference on Information Networks, System and Technologies, Minsk, Belarus, (2001).
N. Sadeh and M.S. Fox, ‘Variable and value ordering heuristics for activity-based jobshop scheduling’, In proc. of Fourth International Conference on Expert Systems in Production and Operations Management, 134–144, (1990).
M.A. Salido and F. Barber, ‘Distributed constraint satisfaction problems for resource allocation’, In Proceeding of AAMAS Workshop on Representation and approaches for Time-Critical Decentralized Resource/Role/Task Allocation, 95–104, (2003).
M.A. Salido and F. Barber, ‘A Polynomial Algorithm for Continuous Non-binary Disjunctive CSPs: Extended DLRs’, Knowledge Based Systems. Ed. Elsevier Science, 16, 277–285, (2003).
E. Tsang, Foundation of Constraint Satisfaction, Academic Press, London and San Diego, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag London Limited
About this paper
Cite this paper
Salido, M.A., Barber, F. (2005). A Non-Binary Constraint Ordering Approach to Scheduling Problems. In: Macintosh, A., Ellis, R., Allen, T. (eds) Applications and Innovations in Intelligent Systems XII. SGAI 2004. Springer, London. https://doi.org/10.1007/1-84628-103-2_6
Download citation
DOI: https://doi.org/10.1007/1-84628-103-2_6
Publisher Name: Springer, London
Print ISBN: 978-1-85233-908-1
Online ISBN: 978-1-84628-103-7
eBook Packages: Computer ScienceComputer Science (R0)