Coonstraint programming approach to multi-product scheduling

• Autorzy: Bach I. , Bocewicz G. , Banaszak Z.
• Języki publikacji: EN

Abstrakty

EN

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 problem considered aims at finding a computationally effective approach for scheduling a new projects portfolio subject to constraints imposed by an availability of time-constrained resources. The problem belongs to a class of multi-mode project scheduling problems where the problem of finding a feasible solution is NP-complete. The aim of the paper is to present a CP modeling 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 requests can be guaranteed while may be available in an on-line mode is illustrated in the example enclosed.

• Wydawca: Polskie Towarzystwo Promocji Wiedzy ; Lublin University of Technology
• Czasopismo: Applied Computer Science
• Rocznik: 2007
• Tom: Vol. 3, no 2
• Strony: 1--17
• Opis fizyczny: Bibliogr. 9 poz., fig., tab.

Twórcy

autor

Bach I.

autor

Bocewicz G.

autor

Banaszak Z.

Bibliografia

• 1. Archer, N., and F. Chasemzadech, An integrated framework for project portfolio selection. Int. Journal of Project Management, Vol. 17, No. 4, 1999; 207-216.
• 2. Banaszak Z., Zaremba M. and Muszyński W., CP-based decision making for SME. In: Preprints of the 16th IFAC World Congress (Eds P. Horacek, M. Simandl), P. Zitek, DVD, 2005,Prague, Czech Republic.
• 3. Banaszak Z., CP-based decision support for project-driven manufacturing. In: Perspectives in Modern Project Scheduling, (Józefowska J. and J. Węglarz (Ed)), International Series in Operations Research and Management Science, Vol. 92, Springer
• Verlag, New York, 2006; 409-437. 4. Barták R. Incomplete Depth-First Search Techniques: A Short Survey, Proceedings of the 6th Workshop on Constraint Programming for Decision and Control, Ed. Figwer J., 2004; 7-14.
• 5. Bocewicz G., Banaszak Z., Wójcik R.: Design of admissible schedules for AGV systems with constraints: a logic-algebraic approach, In: Agent and Multi-Agent Systems: Technologies and Applications, Nguyen N.T., Grzech A., Howlett R.J., Jain L.C. (Eds.), Lecture Notes in Artificial Intelligence 4496, Springer-Verlag, Berlin, Heidelberg, 2007; 578-587.
• 6. Kis, T., G. Ërdos, A. Markus and J. Vancza, A Project-Oriented Decision Support System for Production Planning in Make-to-Order Manufacturing. ERCIN News, Vol. 58, 2004; 44-52.
• 7. Martinez, E. C., D. Duje and G.A. Perez, On performance modeling of project-oriented production. Computers and Industrial Engineering, Vol. 32, 1997; 509-527.
• 8. Puget J-F.: A C++ Implementations of CLP, Proceeding of SPICS 94, 1994.
• 9. Schulte CH., 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.