Abstract
Constrained scheduling problems are common in everyday life and especially in: distribution, manufacturing, project management, logistics, supply chain management, software engineering, computer networks etc. A large number of integer and binary decision variables representing the allocation of different constrained resources to activities/jobs and constraints on these decision variables are typical elements of the resource-constrained scheduling problems (RCSPs) modeling. Therefore, the models of RCSPs are more demanding, particularly when methods of operations research (OR) are used. By contrast, most resource-constrained scheduling problems can be easily modeled as instances of the constraint satisfaction problems (CSPs) and solved using constraint logic programming (CLP) or others methods. Moreover, CLP-based environments enable easy modeling of various types of constraints including logic constraints.
In the CLP-based environment the problem definition is separated from the algorithms and methods used to solve the problem. Therefore, a hybrid approach to resource-constrained scheduling problems that combines an OR-based approach for problem solving and a CLP-based approach for problem modeling is proposed. To evaluate the efficiency and flexibility of this approach, illustrative examples of resource-constrained scheduling problems with logic constraints are implemented using hybrid CLP/MP approach.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1998)
Leung, J.Y.-T., Anderson, J.H.: Handbook of Scheduling: Algorithms, Models, and Performance Analysis. Chapman & Hall/CRC, Boca Raton (2004). ISBN 1584883979
Błażewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., Węglarz, J.: Handbook on Scheduling: From Theory to Applications. Springer, Heidelberg (2007). ISBN 978-3-540-28046-0
Rossi, F., Van Beek, P., Walsh, T.: Handbook of Constraint Programming (Foundations of Artificial Intelligence). Elsevier Science Inc., New York (2006)
Apt, K., Wallace, M.: Constraint Logic Programming using Eclipse. Cambridge University Press, Cambridge (2006)
Milano, M., Wallace, M.: Integrating operations research in constraint programming. Ann. Oper. Res. 175(1), 37–76 (2010)
Achterberg, T., Berthold, T., Koch, T., Wolter, K.: Constraint integer programming: A new approach to integrate CP and MIP. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol. 5015, pp. 6–20. Springer, Heidelberg (2008). doi:10.1007/978-3-540-68155-7_4
Bocewicz, G., Banaszak, Z.: Declarative approach to cyclic steady states space refinement: periodic processes scheduling. Int. J. Adv. Manuf. Technol. 67(1–4), 137–155 (2013)
Sitek, P., Wikarek, J.: A hybrid approach to the optimization of multiechelon systems. Math. Probl. Eng., Article ID 925675. Hindawi Publishing Corporation, doi:10.1155/2014/925675 (2014)
Sitek, P., Nielsen, I.E., Wikarek, J.: A hybrid multi-agent approach to the solving supply chain problems. Procedia Comput. Sci. KES 35, 1557–1566 (2014)
Sitek, P., Wikarek, J.: A hybrid programming framework for modeling and solving constraint satisfaction and optimization problems. Sci. Program. 2016, Article ID 5102616 (2016). doi:10.1155/2016/5102616
Sitek, P.: A hybrid CP/MP approach to supply chain modelling, optimization and analysis. In: Proceedings of the 2014 Federated Conference on Computer Science and Information Systems, Annals of Computer Science and Information Systems, Vol. 2, pp. 1345–1352 (2014). doi:10.15439/2014F89
Guyon, O., Lemaire, P., Pinson, Ă., Rivreau, D.: Solving an integrated job-shop problem with human resource constraints. Ann. Oper. Res. 213(1), 147–171 (2014)
Blazewicz, J., Lenstra, J.K., Rinnooy Kan, A.H.G.: Scheduling subject to resource constraints: classification and complexity. Discrete Appl. Math. 5, 11–24 (1983)
Lawrence, S.R., Morton, T.E.: Resource-constrained multi-project scheduling with tardy costs: comparing myopic, bottleneck, and resource pricing heuristics. Eur. J. Oper. Res. 64(2), 168–187 (1993)
Eclipse - The Eclipse Foundation open source community website. www.eclipse.org. Accessed 20 April 2016
SCIP. http://scip.zib.de/. Accessed 20 April 2016
Toth, P., Vigo, D.: Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discrete Appl. Math. 123(1–3), 487–512 (2002)
Coelho, J., Vanhoucke, M.: Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers. Eur. J. Oper. Res. 213, 73–82 (2011)
Nielsen, P., Nielsen, I., Steger-Jensen, K.: Analyzing and evaluating product demand interdependencies. Comput. Ind. 61(9), 869–876 (2010). doi:10.1016/j.compind.2010.07.012
Relich, M., Muszynski, W.: The use of intelligent systems for planning and scheduling of product development projects. Procedia Comput. Sci. 35, 1586–1595 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendices
Appendix A Sets of Facts for Illustrative Example
Appendix B Illustrative Example-Formal Model
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Sitek, P., Wikarek, J., Stefański, T. (2017). A Hybrid CLP/MP Approach to Modeling and Solving Resource-Constrained Scheduling Problems with Logic Constraints. In: Szewczyk, R., Zieliński, C., Kaliczyńska, M. (eds) Automation 2017. ICA 2017. Advances in Intelligent Systems and Computing, vol 550. Springer, Cham. https://doi.org/10.1007/978-3-319-54042-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-54042-9_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-54041-2
Online ISBN: 978-3-319-54042-9
eBook Packages: EngineeringEngineering (R0)