Advertisement

A Hybrid Approach to Decision Support for Resource-Constrained Scheduling Problems

  • Paweł SitekEmail author
  • Izabela Nielsen
  • Jarosław Wikarek
  • Peter Nielsen
Conference paper
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 56)

Abstract

Resource-constrained scheduling problems are commonly found in various areas, such as project management, manufacturing, transportation, software engineering, computer networks, and supply chain management. Its problem models involve a large number of constraints and discrete decision variables, including binary and integer. In effect, the representation of resource allocation, for instance, is often expressed using binary or integer decision variables to form several constraints according to the respective scheduling problem. It significantly increases the number of decision variables and constraints as the problem scales; such kind of traditional approaches based on operations research is insufficient. Therefore, a hybrid approach to decision support for resource-constrained scheduling problems which combines operation research (OR) and constraint logic programming (CLP) is proposed. Unlike OR-based approaches, declarative CLP provides a natural representation of different types of constraints. This approach provides: (a) decision support through the answers to the general and specific questions, (b) specification of the problem based on a set of facts and constraints, (c) reduction to the combinatorial solution space. To evaluate efficiency and applicability of the proposed hybrid approach and implementation platform, implementation examples of job-shop scheduling problem are presented separately for the three environments, i.e., Mathematical Programming (MP), CLP, and hybrid implementation platform.

Keywords

Decision support Constraint logic programming Resource-constrained scheduling problem Mathematical programming Hybridization 

References

  1. 1.
    Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1998)zbMATHGoogle Scholar
  2. 2.
    Rossi, F., Van Beek, P., Walsh, T.: Handbook of Constraint Programming (Foundations of Artificial Intelligence). Elsevier Science Inc., New York (2006)zbMATHGoogle Scholar
  3. 3.
    Apt, K., Wallace, M.: Constraint Logic Programming using Eclipse. Cambridge University Press, Cambridge (2006)CrossRefGoogle Scholar
  4. 4.
    Milano, M., Wallace, M.: Integrating operations research. Constraint Program. Ann. Oper. Res. 175(1), 37–76 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Achterberg, T., Berthold, T., Koch, T.: Wolter K: Constraint integer programming, a new approach to integrate CP and MIP. Lect. Notes Comput. Sci. 5015, 6–20 (2008)CrossRefzbMATHGoogle Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    Sitek, P., Wikarek, J.: A Hybrid Approach to the Optimization of Multiechelon Systems. Mathematical Problems in Engineering, Article ID 925675, Hindawi Publishing Corporation, (2014). doi: 10.1155/2014/925675
  8. 8.
    Sitek, P., Nielsen I.E., Wikarek, J.: A Hybrid Multi-agent Approach to the Solving Supply Chain Problems. Procedia Computer Science KES, pp. 1557–1566 (2014)Google Scholar
  9. 9.
    Sitek, P., Wikarek J.: A hybrid framework for the modelling and optimisation of decision problems in sustainable supply chain management. Int. J. Prod. Res. 1–18 (2015). doi: 10.1080/00207543.2015.1005762
  10. 10.
    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)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Blazewicz, J., Lenstra, J.K., Rinnooy Kan, A.H.G.: Scheduling subject to resource constraints: classification and complexity. Discret. Appl. Math. 5, 11–24 (1983)Google Scholar
  12. 12.
    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)CrossRefzbMATHGoogle Scholar
  13. 13.
    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
  14. 14.
    Lindo Systems INC, LINDO™, www.lindo.com, Accessed Dec 4 (2015)
  15. 15.
    Eclipse−The Eclipse Foundation open source community website, www.eclipse.org, Accessed Dec 4 (2015)
  16. 16.
    Toth, P., Vigo, D.: Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discret. Appl. Math. 123(1–3), 487–512 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Coelho, J., Vanhoucke, M.: Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers. Eur. J. Oper. Res. 213, 73–82 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Relich, M.: A computational intelligence approach to predicting new product success. In: Proceedings of the 11th International Conference on Strategic Management and its Support by Information Systems, pp. 142–150 (2015)Google Scholar
  19. 19.
    Wang, J., Liu, C.: Fuzzy Constraint Logic Programming with Answer Set Semantics. Lecture Notes in Computer Science, pp. 52–60 (2007). doi: 10.1007/978-3-540-76719-0_9

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Paweł Sitek
    • 1
    Email author
  • Izabela Nielsen
    • 2
  • Jarosław Wikarek
    • 1
  • Peter Nielsen
    • 2
  1. 1.Department of Information SystemsKielce University of TechnologyKielcePoland
  2. 2.Department of Mechanical and Manufacturing EngineeringAalborg UniversityAalborgDenmark

Personalised recommendations