A Genetic Algorithm for Resource-Constrained Project Scheduling: A unique crossover and parent selection mechanism

 
9783848402472: A Genetic Algorithm for Resource-Constrained Project Scheduling: A unique crossover and parent selection mechanism
View all copies of this ISBN edition:
 
 

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.

"synopsis" may belong to another edition of this title.

About the Author:

Erdem Ozleyen was born in Ankara, in 1986. Mr. Erdem received his first degree in Civil Engineering from Gazi University and had taken his Masters degree from Middle East Technical University in Construction Management. His MA dissertation elaborates on genetic algorithms in scheduling. He is mainly interested in planning and scheduling.

"About this title" may belong to another edition of this title.

Buy New View Book
List Price: US$ 65.00
US$ 53.84

Convert currency

Shipping: US$ 3.20
From Germany to U.S.A.

Destination, rates & speeds

Add to Basket

Top Search Results from the AbeBooks Marketplace

1.

Ozleyen, Erdem
ISBN 10: 3848402475 ISBN 13: 9783848402472
New Quantity Available: 1
Seller:
Rating
[?]

Book Description Condition: New. Publisher/Verlag: LAP Lambert Academic Publishing | A unique crossover and parent selection mechanism | 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. | Format: Paperback | Language/Sprache: english | 108 pp. Seller Inventory # K9783848402472

More information about this seller | Contact this seller

Buy New
US$ 53.84
Convert currency

Add to Basket

Shipping: US$ 3.20
From Germany to U.S.A.
Destination, rates & speeds

2.

Erdem Ozleyen
Published by LAP Lambert Academic Publishing Feb 2012 (2012)
ISBN 10: 3848402475 ISBN 13: 9783848402472
New Taschenbuch Quantity Available: 1
Seller:
Rheinberg-Buch
(Bergisch Gladbach, Germany)
Rating
[?]

Book Description LAP Lambert Academic Publishing Feb 2012, 2012. Taschenbuch. Condition: Neu. Neuware - 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. 108 pp. Englisch. Seller Inventory # 9783848402472

More information about this seller | Contact this seller

Buy New
US$ 58.81
Convert currency

Add to Basket

Shipping: US$ 19.96
From Germany to U.S.A.
Destination, rates & speeds

3.

Erdem Ozleyen
Published by LAP Lambert Academic Publishing Feb 2012 (2012)
ISBN 10: 3848402475 ISBN 13: 9783848402472
New Taschenbuch Quantity Available: 1
Seller:
BuchWeltWeit Inh. Ludwig Meier e.K.
(Bergisch Gladbach, Germany)
Rating
[?]

Book Description LAP Lambert Academic Publishing Feb 2012, 2012. Taschenbuch. Condition: Neu. Neuware - 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. 108 pp. Englisch. Seller Inventory # 9783848402472

More information about this seller | Contact this seller

Buy New
US$ 58.81
Convert currency

Add to Basket

Shipping: US$ 19.96
From Germany to U.S.A.
Destination, rates & speeds

4.

Erdem Ozleyen
Published by LAP Lambert Academic Publishing (2012)
ISBN 10: 3848402475 ISBN 13: 9783848402472
New Paperback Quantity Available: 1
Seller:
The Book Depository EURO
(London, United Kingdom)
Rating
[?]

Book Description LAP Lambert Academic Publishing, 2012. Paperback. Condition: New. Aufl.. Language: English . Brand New Book. 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. Seller Inventory # KNV9783848402472

More information about this seller | Contact this seller

Buy New
US$ 88.20
Convert currency

Add to Basket

Shipping: US$ 3.93
From United Kingdom to U.S.A.
Destination, rates & speeds

5.

Erdem Ozleyen
Published by LAP Lambert Academic Publishing Feb 2012 (2012)
ISBN 10: 3848402475 ISBN 13: 9783848402472
New Taschenbuch Quantity Available: 1
Print on Demand
Seller:
AHA-BUCH GmbH
(Einbeck, Germany)
Rating
[?]

Book Description LAP Lambert Academic Publishing Feb 2012, 2012. Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Neuware - 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. 108 pp. Englisch. Seller Inventory # 9783848402472

More information about this seller | Contact this seller

Buy New
US$ 58.81
Convert currency

Add to Basket

Shipping: US$ 34.38
From Germany to U.S.A.
Destination, rates & speeds