Computational Technology Resources - CCP

O. Eliezer, "A Conflict Repairing Harmony Search Metaheuristic and its Application to Bi-Objective Resource-Constrained Project Scheduling Problems", in , (Editors), "Proceedings of the Ninth International Conference on Engineering Computational Technology", Civil-Comp Press, Stirlingshire, UK, Paper 98, 2014. doi:10.4203/ccp.105.98

Keywords: project management, bi-objective resource-constrained project scheduling, heuristics, harmony search metaheuristic.

Summary

The scheduling processes is considered a complicated problem in project management. In the past, many algorithms and paradigms had been developed in order to reduce the project makespan as much as possible. The main objective in the resource constrained project scheduling problem is the makespan, however, there are other important objectives such as net present value minimization, minimization of the hammock cost, maximization of robustness, etc, which are crucial to the project success. This paper demonstrates some of these objectives by applying a conflict repairing harmony search metaheuristic to academic problems. The algorithm shows that the main objective should is not detrimentally affected by optimizing the second criteria, and an interesting trade-off between the total makespan and the hammock cost is apparent.

purchase the full-text of this paper (price £20)

go to the previous paper
go to the next paper
return to the table of contents
return to the book description
purchase this book (price £45 +P&P)

	Computational & Technology Resources an online resource for computational, engineering & technology publications
	not logged in - login
Front Page Browse CCP CSETS CTR IJRT Other Authors Search Purchase Guide FAQ Contact us	Civil-Comp Proceedings ISSN 1759-3433 CCP: 105 PROCEEDINGS OF THE NINTH INTERNATIONAL CONFERENCE ON ENGINEERING COMPUTATIONAL TECHNOLOGY Edited by: Paper 98 A Conflict Repairing Harmony Search Metaheuristic and its Application to Bi-Objective Resource-Constrained Project Scheduling Problems O. Eliezer Zefat Academic College, Israel doi:10.4203/ccp.105.98 purchase the full-text of this paper Full Bibliographic Reference for this paper O. Eliezer, "A Conflict Repairing Harmony Search Metaheuristic and its Application to Bi-Objective Resource-Constrained Project Scheduling Problems", in , (Editors), "Proceedings of the Ninth International Conference on Engineering Computational Technology", Civil-Comp Press, Stirlingshire, UK, Paper 98, 2014. doi:10.4203/ccp.105.98 Keywords: project management, bi-objective resource-constrained project scheduling, heuristics, harmony search metaheuristic. Summary The scheduling processes is considered a complicated problem in project management. In the past, many algorithms and paradigms had been developed in order to reduce the project makespan as much as possible. The main objective in the resource constrained project scheduling problem is the makespan, however, there are other important objectives such as net present value minimization, minimization of the hammock cost, maximization of robustness, etc, which are crucial to the project success. This paper demonstrates some of these objectives by applying a conflict repairing harmony search metaheuristic to academic problems. The algorithm shows that the main objective should is not detrimentally affected by optimizing the second criteria, and an interesting trade-off between the total makespan and the hammock cost is apparent. purchase the full-text of this paper (price £20) go to the previous paper go to the next paper return to the table of contents return to the book description purchase this book (price £45 +P&P)
Back to top	©Civil-Comp Limited 2023 - terms & conditions