Robust Scheduling Subject to Multi-project Environment Constraints

The main objective is to provide a declarative model enabling to state a constraint satisfaction problem aimed at multi project-like and mass customized oriented multi-product scheduling. Its formal representation enables to formulate the straight and reverse problem scheduling of a newly inserted orders portfolio subject to constraints imposed by an enterprise multi-project environment. Considered problems correspond to the routine questions faced by decision makers and are formulated either in the straight or reverse way, e. g. Is it possible to undertake a new portfolio under given resources availability (e. g. constrained in time) while guaranteeing disturbance-free execution of the already executed portfolios? What values and of what decision variables guarantee the production order (or orders portfolio) will completed while following assumed set of performance indexes? In that context a computationally effective approach aimed at simultaneous routing and allocation as well as batching and scheduling of a new portfolio subject to constraints imposed by a multi-project environment is sought. Provided examples illustrate both cases while taking into account robust scheduling requirements imposed by multi-project environment constraints.