COONSTRAINT PROGRAMMING APPROACH TO MULTIPRODUCT SCHEDULING

Print

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 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.

FULL TEXT