Abstract
Constraint Programming (CP) is an emergent software technology for declarative description and effective solving of large combinatorial problems especially in the area of integrated production planning. In that context, CP can be considered as an appropriate framework for development of decision making software supporting small and medium sized enterprises (SMEs) in the course of projects portfolio prototyping. The paper deals with problem considered multiresource problem in which more than one resource type may be required by every activity in the project and the availability of each type is time-windows limited. The problem belongs to a class of NP-complete ones. The aim of the paper is to present a CP based projects portfolio prototyping framework providing a prompt service to a set of routine queries stated both in straight and reverse way, e.g., concerning the projects portfolio makespan implied by a given resources allocation, and the feasible resources allocation guaranteeing an assumed projects portfolio makespan. The way the responses to the routine queries can be guaranteed while may be available in an on-line mode is illustrated in the example enclosed.
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
Archer, N., Chasemzadech, F.: An integrated framework for project portfolio selection. Int. Journal of Project Management 17(4), 207–216 (1999)
Banaszak, Z., Zaremba, M., Muszyński, W.: CP-based decision making for SME. In: Horacek, P., Simandl, M., Zitek, P. (eds.) Preprints of the 16th IFAC World Congress, Prague, Czech Republic (2005)
Banaszak, Z.: CP-based decision support for project-driven manufacturing. In: Józefowska, J., Węglarz, J. (eds.) Perspectives in Modern Project Scheduling. International Series in Operations Research and Management Science, vol. 92, pp. 409–437. Springer, New York (2006)
Barták, R.: Incomplete Depth-First Search Techniques: A Short Survey. In: Figwer, J. (ed.) Proceedings of the 6th Workshop on Constraint Programming for Decision and Control, pp. 7–14 (2004)
Bocewicz, G., Banaszak, Z., Wójcik, R.: Design of admissible schedules for AGV systems with constraints: a logic-algebraic approach. In: Nguyen, N.T., Grzech, A., Howlett, R.J., Jain, L.C. (eds.) KES-AMSTA 2007. LNCS (LNAI), vol. 4496, pp. 578–587. Springer, Heidelberg (2007)
Kis, T., Ërdos, G., Markus, A., Vancza, J.: A Project-Oriented Decision Support System for Production Planning in Make-to-Order Manufacturing. ERCIN News 58, 44–52 (2004)
Martinez, E.C., Duje, D., Perez, G.A.: On performance modeling of project-oriented production. Computers and Industrial Engineering 32, 509–527 (1997)
Puget, J.-F.: A C++ Implementations of CLP. In: Proceeding of SPICS 1994 (1994)
Schulte, C.H., Smolka, G., Wurtz, J.: Finite Domain Constraint Programming in Oz, DFKI OZ documentation series, German Research Center for Artificial Intelligence, Stuhlsaltzenhausweg 3, D-66123 Saarbrucken, Germany (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bach, I., Bocewicz, G., Banaszak, Z. (2008). Constraint Programming Approach to Time-Window and Multiresource-Constrained Projects Portfolio Prototyping. In: Nguyen, N.T., Borzemski, L., Grzech, A., Ali, M. (eds) New Frontiers in Applied Artificial Intelligence. IEA/AIE 2008. Lecture Notes in Computer Science(), vol 5027. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69052-8_80
Download citation
DOI: https://doi.org/10.1007/978-3-540-69052-8_80
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69045-0
Online ISBN: 978-3-540-69052-8
eBook Packages: Computer ScienceComputer Science (R0)