We propose a new approach for scheduling with strict deadlines and apply this approach to the TimeConstrained Project Scheduling Problem (TCPSP). To be able to meet these deadlines, it is possible to work in overtime or hire additional capacity in regular time or overtime. For this problem, we develop a two stage heuristic. The key of the approach lies in the first stage in which we construct p...

This paper describes a simple complete search for cumulative scheduling based on the detection and resolution of minimal critical sets (MCS). The heuristic for selecting MCSs relies on an estimation of the related reduction of the search space. An extension of the search procedure using selfadapting shaving is proposed. The approach was implemented on top of classical constraint propagation alg...

Traditionally, the Resource Constrained Project Scheduling Problem (RCPSP) is investigated in the operations research literature from the makespan minimization perspective. However, a recent survey conducted in the United States revealed the surprizing fact that the majority of project planners consider maximization of the quality of project schedules as the most important objective (Icmeli Tuk...

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

With the availability of comprehensively integrated Airport Operational Databases, as motivated by the emergence of Collaborative Decision Making for example, new forms of automated information processing become available: Particularly, proactive Decision Support Systems can be developed based on the concepts of Artificial Intelligence. From various potential fields of application, this paper f...

We present a new solution approach for short-term planning of batch production, which decomposes the problem into batching and batch scheduling. Batching converts the primary requirements for products into individual batches. We formulate the batching problem as a mixed-integer nonlinear program, which can be solved by standard software. Batch scheduling allocates the batches to scarce resource...

Automated scheduling solutions are tremendously important for the efficient operation of industrial laboratories. The Test Laboratory Scheduling Problem (TLSP) is an extension well-known Resource Constrained Project (RCPSP) and captures specific requirements such In addition to several new constraints, it features a grouping phase, where jobs be scheduled assembled from smaller units. this work...