Reactive project scheduling is an important branch of under uncertainty. This paper proposes a resource-constrained multi-project reactive problem (RCMPRSP) with new arrival to minimize the adjustment cost baseline schedule while achieving deterministic goal. Although RCMPRSP aims cost, it adds constraint ensure that one schedules shortest possible make-span after arrival. Therefore, and can bo...

This paper presents an integer linear programming (ILP) model for the scheduling problem in high level synthesis. In addition to time-constrained scheduling and resource-constrained scheduling, a new scheduling problem called feasible scheduling is constructed, which provides a paradigm for exploring the solution space. Extensive consideration is given to the following applications: scheduling ...

With the growth of projects in complexity, size and resource demands, finding fea-sible schedules of good quality becomes a very challenging task within project man-agement. Therefore the resource constrained project scheduling problem (RCPSP) hasbeen studied extensively during the last decades yielding a variety of exact and heuris-tic solving approaches. In this context, the m...

The resource-constrained project scheduling problem (RCPSP) has been widely studied. A fundamental assumption of the basic type of RCPSP is that activity durations are deterministic (i.e., they are known in advance). In reality, however, this is almost never the case. In this article we illustrate why it is important to incorporate activity duration uncertainty, and develop an exact procedure t...

Commonly used scheduling algorithms in high-level synthesis are not capable of sharing resources across process boundaries. This results in the usage of at least one resource per operation type and process. A new method is proposed in order to overcome these restrictions and to share high-cost or limited resources within a process group. This allows the use of less than one resource per operati...

This paper focuses on estimating maximum resource loads in ResourceConstrained Project Scheduling Problem (RCPSP). We examine a variant of vector sum problem with fractions: considering preemptions allowed, determine what part of each of n jobs should be accomplished in order to minimize sum of squares of non-consumed amounts of resources, taking into account the resource constraints along with...

In this paper, we present a unified framework for production planning and scheduling in make-to-order manufacturing. Both planning and scheduling problems are captured as resource-constrained project scheduling problems. The actual models and solution techniques are different at the two levels. Hence, we also suggest an aggregation method that provides the connection between planning and schedu...