Contacto
Cómo comprar
Entrega
Guía de compras
Genetic Algorithm for Resource-Constrained Project Scheduling
Inglés
130 b
Política de devolución de 30 días
Clientes que también han comprado
/
Tapa blanda
43.39
€
/
Tapa dura
31.49
€
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.
Sobre el libro
Inglés
Regale este libro hoy
Es fácil
1 Añadir al carrito y elegir Entregar como regalo en el checkout 2 Le enviaremos un vale 3 El libro llegará a la dirección del destinatarioTambién puede interesarle
/
Tapa dura
41.59
€
/
Tapa blanda
16.49
€
/
Tapa blanda
9.29
€
/
Tapa blanda
16.99
€
/
Tapa blanda
7.99
€
¡Hola! Soy Libroamiko, tu asesor de libros.
¿Cómo puedo ayudarte?