| contributor author | Wail Menesi | |
| contributor author | Tarek Hegazy | |
| date accessioned | 2017-05-08T22:08:09Z | |
| date available | 2017-05-08T22:08:09Z | |
| date copyright | November 2015 | |
| date issued | 2015 | |
| identifier other | 31636007.pdf | |
| identifier uri | http://yetl.yabesh.ir/yetl/handle/yetl/72047 | |
| description abstract | This paper aims at providing a fast near-optimum solution to the multimode resource-constrained project scheduling problem (MRCPSP) in large-scale projects, with and without resource-leveling constraints. The MRCPSP problem is known to be nondeterministic polynomial-time hard (NP-hard) and has been solved using various exact, heuristic, and metaheuristic procedures. In this paper, constraint programming (CP) is used as an advanced mathematical optimization technique that suits scheduling problems. The IBM | |
| publisher | American Society of Civil Engineers | |
| title | Multimode Resource-Constrained Scheduling and Leveling for Practical-Size Projects | |
| type | Journal Paper | |
| journal volume | 31 | |
| journal issue | 6 | |
| journal title | Journal of Management in Engineering | |
| identifier doi | 10.1061/(ASCE)ME.1943-5479.0000338 | |
| tree | Journal of Management in Engineering:;2015:;Volume ( 031 ):;issue: 006 | |
| contenttype | Fulltext | |
