CP-driven Production Process Planning in Multiproject Environment
DOI:
https://doi.org/10.7494/dmms.2008.2.2.5Keywords:
projects portfolio, support system, constraints programming, schedulingAbstract
The way enterprise capabilities are used decides about its competitiveness among other ones. In that context modeling aimed at production tasks allocation planning plays a crucial role especially at concurrently executed production orders. The introduced reference model employing constraint programming (CP) paradigm describes both an enterprise and a set of project-like production orders. Moreover, encompassing consumer orders requirements and available production capabilities, the model provides the formal framework allowing one to develop a class of decision support systems aimed at interactive production process planning subject to multiproject environment constraints. In that context our contribution is a knowledge-based and CP-driven approach to resource allocation assuming precise character of decision variables. The conditions sufficient for deadlock avoidance are the main goal. The conditions delivered provide formal framework for developing a task oriented Decision Support Tool for Project Portfolio Prototyping (DST4P, Banaszak 2006). The tool provides a prompt and interactive service to a set of routine queries formulated either in straight or reverse way.References
Bach I., Bocewicz G. & Banaszak Z. (2008a). 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 Artificial Intelligence, 5027, pp. 767–776. Berlin–Heidelberg: Springer. DOI: https://doi.org/10.1007/978-3-540-69052-8_80.
Bach I., Wójcik R. & Bocewicz G. (2008b). Projects portfolio prototyping subject to imprecise activities specification. In: Proceedings of the 14th International Congress of Cybernetics and Systems of WOSC – ICCS’08, pp. 261–272. Wrocław.
Banaszak Z.A. (2006). 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 & Management Science, 92, pp. 409–437. Boston, MA: Springer. DOI: https://doi.org/10.1007/978-0-387-33768-5_16.
Banaszak Z.A., Zaremba M.B. & Muszyński W. (2005). CP-based decision making for SME. In: Horáček P., Šimandl M. & Zítek P. (Eds.), Proceedings of the 16th IFAC World Congress, Prague, Czech Republic, pp. 319–324. IFAC Proceedings Volumes, 38(1). DOI: https://doi.org/10.3182/20050703-6-CZ-1902.01475.
Barták R. & Erben R. (2004). Incomplete depth-first search techniques: A short survey. In: Barr V. & Markov Z. (Eds.), Proceedings of the 17th International Florida Artificial Intelligence Research Society Conference – FLAIRS 2004, pp. 257–262. Menlo Park, CA: AAAI Press.
Beale E.M.L. (1979). Branch and bound methods for mathematical programming systems. In: Hammer P.L., Johnson E.L. & Korte B.H. (Eds.), Discrete Optimization II. Annals of Discrete Mathematics, 5, pp. 201–219. Amsterdam: North-Holland. DOI: https://doi.org/10.1016/S0167-5060(08)70351-0.
Bocewicz G., Wójcik R. & Banaszak Z. (2007). 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.), Agent and Multi-Agent Systems: Technologies and Applications. Lecture Notes in Artificial Intelligence, 4496, pp. 578–587. Berlin–Heidelberg: Springer. DOI: https://doi.org/10.1007/978-3-540-72830-6_60.
Linderoth J.T. & Savelsbergh M.W.P. (1999). A computational study of search strategies for mixed integer programming. INFORMS Journal on Computing, 11(2), pp. 173–187. DOI: https://doi.org/10.1287/ijoc.11.2.173.
Chanas S. & Kamburowski J. (1981). The use of fuzzy variables in PERT. Fuzzy Sets and Systems, 5(1), pp. 11–19. DOI: https://doi.org/10.1016/0165-0114(81)90030-0.
Dubois D., Fargier H. & Fortemps P. (2003). Fuzzy scheduling: Modelling flexible constraints vs. coping with incomplete knowledge. European Journal of Operational Research, 147(2), pp. 231–252. DOI: https://doi.org/10.1016/S0377-2217(02)00558-1.
Martínez E.C., Duje D. & Pérez G.A. (1997). On performance modeling of project-oriented production. Computers & Industrial Engineering, 32(3), pp. 509–527. DOI: https://doi.org/10.1016/S0360-8352(97)00005-3.
Puget J.-F. (1994). A C++ implementation of CLP. In: Proceedings of SPICIS’94, Singapore. ILOG Technical Report 94-01.
Schulte C., Smolka G. & Würtz J. (1998). Finite Domain Constraint Programming in Oz: A Tutorial. DFKI Oz Documentation Series. Saarbrücken: German Research Center for Artificial Intelligence and Universität des Saarlandes. URL: https://www.ps.uni-saarland.de/oz2/documentation/.
Sung C.S. (1985). A production planning model for multi-product facilities. Journal of the Operations Research Society of Japan, 28(4), pp. 345–358. DOI: https://doi.org/10.15807/jorsj.28.345.
Van Hentenryck P. (1991). Constraint logic programming. The Knowledge Engineering Review, 6(3), pp. 151–194. DOI: https://doi.org/10.1017/S0269888900005798.
