Abstract
Resource-constrained scheduling problem is one kind of typical real-life discrete optimization problems, which is one of the strongest application areas of constraint programming. In the constraint programming toolkit ‘Mingyue’, which embed constraints in the object-oriented language C++, we design a new logic-based method for handling the constraints in the resource-constrained scheduling problem. In this paper, we propose a way of describing those constraints with the discrete-variable logic formula. Based on this model, a resolution algorithm is designed for filtering the discrete variables’ domain. Comparisons with other constraint handling approaches and related literature clearly show that our approach can describe the constraints in the high level and solve the resource-constrained scheduling problem in the logic framework.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
REFERENCES
R. Barták (1998), On-line Guide to Constraint Programming. Charles University, Prague, http://kti.mff.cuni.cz∼bartak/constraints/.
M. Wallace (1994), Applying constraints for scheduling in constraint programming. In: NATO ASI Series, B. Mayoh and J. Penjaak (eds.), Springer Verlag.
E.P.K. Tsang (1993), Foundations of Constraint Satisfaction. San Diego, Calif.: Academic, pp. 53–63.
J.Y. Zhang, X. Li and J.G. Sun (2003), Research on constraint-based scheduling and its implementation. In: Proceeding of CNCC’03, Beijing, P.R. China, Tsinghua University Press, pp. 80–85.
J.G. Sun and J.Y. Zhang (2004), A generic mechanism for managing resource constraints in preemptive and non-preemptive scheduling. Processing of SCI’04 Conference, Orlando, USA.
K. Marriott and P.J. Stuckey (1998), Programming with Constraints: An Introduction. MIT Press, pp. 133–134.
M.C. Copper (1989), An optimal k-consistency algorithm. Artificial Intelligence, 41, pp. 89–95.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer
About this paper
Cite this paper
Zhang, J., Sun, J., Yang, Q. (2006). LOGIC-BASED CONSTRAINT HANDLING IN RESOURCE-CONSTRAINED SCHEDULING PROBLEMS. In: LIU, G., TAN, V., HAN, X. (eds) Computational Methods. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-3953-9_27
Download citation
DOI: https://doi.org/10.1007/978-1-4020-3953-9_27
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-3952-2
Online ISBN: 978-1-4020-3953-9
eBook Packages: EngineeringEngineering (R0)