This paper proposes a Hybrid Genetic Algorithm (HGA) for the Resource Constrained Project Scheduling Problem (RCPSP). Resources are renewable and there is a unique way to perform the activities. This work employs Genetics Algorithms (GA) and Hybrid Genetic Algorithms to schedule project activities to minimize makespan subject to precedence constraints and resources availability. The algorithms ...

We consider the problem of scheduling a set of jobs on a single machine with the objective of mimizing weighted (average) completion time. The problem is NP-hard when there are precedence constraints between jobs, [12] and we provide a simple and e cient combinatorial 2-approximation algorithm. In contrast to our work, earlier approximation algorithms [9] achieving the same ratio are based on s...

The constraint satisfaction problem (CSP) is a central generic problem in computer science and artificial intelligence: it provides a common framework for many theoretical problems as well as for many real-life applications. Soft constraint problems are a generalisation of the CSP which allow the user to model optimisation problems. Considerable effort has been made in identifying properties wh...

Assembly planning and evaluation is an important component of the product that require frequent and intuitive manual interaction such as assembly methods (91) to create a desktop based virtual assembly system called HIDRA (Haptic. (3) implemented a computer-based system for virtual assemLooking at haptic interaction within virtual assembly training discrimination, part positioning, and manual a...

The problem of scheduling jobs with precedence constraints is a central problem in Scheduling Theory which arises in many industrial and scientific applications. In this paper we present a polynomial time approximation scheme for the problem of scheduling jobs with chain precedence constraints on a fixed number of uniformly related machines. Our algorithm works even if we allow “slow” machines ...

In hard real-time systems, a timing fault may lead the environment to catastrophe. Thus, a real-time program must be executed in accordance with the timing constraints speciied in the control program. Dynamic scheduling approach which has been dominant for real-time systems are unacceptable due to run-time scheduling overhead and unpredictable risks. In contrast, a static approach takes advanta...