This paper presents a set of satisfiability tests and time-bound adjustment algorithms that can be applied to cumulative scheduling problems. An instance of the Cumulative Scheduling Problem (CuSP) consists of (1) one resource with a given capacity and (2) a set of activities, each having a release date, a deadline, a processing time and a resource capacity requirement. The problem is to decide...

Abstract. This paper is devoted to Resource Constrained Scheduling. An instance for this problem is given by a set of n jobs with lengths and weights and a set of m machines with capacities. At every time each machine can run arbitrary many jobs in parallel but the total weight of these jobs must not exceed the capacity of the machine. Furthermore the m machines work in parallel and we wish to ...

The purpose of this paper presents a heuristic method based in genetic algorithms (GA) for resource-constrained project scheduling. The problem studied was of the scheduling of projects that share the same pool of resources. This situation is very common in some environments of project, i. e., construction P&D units. Fluctuation in resource usage can result in many problems, such as the need in...

General Optimization Methods Mathematical Programming, Constraint Programming, Heuristics Problem Specific Algorithms (Dynamic Programming, Branch and Bound) Scheduling Single and Parallel Machine Models Flow Shops and Flexible Flow Shops Job Shops Resource-Constrained Project Scheduling Timetabling Interval Scheduling, Reservations Educational Timetabling Workforce and Employee Timetabling Tra...

Predictive scheduling is a new approach used in production planning. The aim of this approach is to develop robust schedules and solutions that are able to absorb disruptions during the schedule execution. In this paper, we present algorithms of predictive scheduling for the Resource-Constrained Project Scheduling Problem (RCPSP), with defined dates of selected activities.

This work describes a genetic algorithm approach to resource-constrained scheduling using a direct, time-based representation. Whereas traditional solution methods are typically sequencebased, this representation encodes schedule information as a dual array of relative delay times and integer execution modes. The representation supports multiple execution modes, preemption, non-uniform resource...

this paper presents a multi-objective resource-constrained project scheduling problem with positive and negative cash flows. the net present value (npv) maximization and making span minimization are this study objectives. and since this problem is considered as complex optimization in np-hard context, we present a mathematical model for the given problem and solve three evolutionary algorithms;...