We consider some special cases of the NP -hard resource-constrained project scheduling problem (RCPSP ) to minimize the makespan. We conjecture that the ratio of the optimal makespan of RCPSP to that of the preemptive version of the problem is less than 2. We show that a well-known lower bounds for the problem may yield bad approximation ratios or its calculation is an NP -hard problem too. We ...

The multi-skill resource-constrained project scheduling problem (MS-RCPSP) is a significant management science that extends from the (RCPSP) and integrated with real production environment. To solve MS-RCPSP, it an efficient method to use dispatching rules combined parallel mechanism generate scheme. This paper proposes improved gene expression programming (IGEP) approach explore newly can broa...

This paper addresses distributed task scheduling problems as a distributed version of the Resource-Constrained Project Scheduling Problem (RCPSP). We propose and evaluate a novel approach for the distributed RCPSP based on theoretical models of division of labor in social insect colonies. Our approach uses a probabilistic decision-making model based on the social insect tendency to perform cert...

The Resource-Constrained Project Scheduling Problem (RCPSP) is concerned with single-item or small batch production where limited resources have to be allocated to dependent activities over time. Over the past few decades, a lot of work has been made with the use of optimal solution procedures for this basic problem type and its extensions. Brucker and Knust[1] discuss, how timetabling problems...

Pseudo-Boolean (PB) constraints are usually encoded into Boolean clauses using compact Binary Decision Diagram (BDD) representations. Although these constraints appear in many problems, they are particularly useful for representing resource constraints in scheduling problems. Sometimes, the Boolean variables in the PB constraints have implicit at-most-one relations. In this work we introduce a ...