Contact
How to shop
Delivery
Shopping guide
Genetic Algorithm for Resource-Constrained Project Scheduling
English
121 b
30-day return policy
Customers also purchased
/
Paperback
39.96
€
/
Hardback
29.03
€
The resource-constrained project scheduling problem (RCPSP) aims to find a schedule of minimum makespan by starting each activity such that resource constraints and precedence constraints are respected. However, as the problem is NP-hard in the strong sense, the performance of exact procedures is limited and can only solve small-sized project networks. In this study, the proposed genetic algorithm (GA) aims to find near-optimal solutions and also overcomes the poor performance of the exact procedures for large-sized project networks. The proposed algorithm employs two independent populations: left population that consist of left-justified (forward) schedules and right population that consist of right-justified (backward) schedules. The repeated cycle updates the left (right) population by maintaining it with transformed right (left) individuals. By doing so, the algorithm uses two different scheduling characteristics. Also, the algorithm provides a new two-point crossover operator that selects the parents according to their resource requirement mechanism. The experiment results show that the suggested algorithm outperforms the well-known commercial software packages.
About the book
English
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Hardback
40.16
€
/
Paperback
15.77
€
/
Paperback
16.18
€
/
Paperback
7.68
€
