الفهرس Only 14 pages are availabe for public view
 |  | from | 311 |  |  |
| | | from | 311 | | |
Abstract
Resource-constrained project scheduling problem (RCPSP) is normally characterized by makespan length as objective functions and features of resource limitations and permutation condition. The heuristic procedures broadly fall into two categories namely constructive and improvement heuristics. Schedule generation schemes (SGS) are the core of most heuristic solution procedures of RCPSP and MRCPSP. SGS start from scratch and build a feasible schedule. In our study we have resumed that the best heuristics in our computational analysis are metaheuristics based on the activity list representation and the serial SGS. In the current work some new constructive serial scheduling schemes are proposed and others are adapted for multiple resources constrained scheduling process. The performance of these scheduling schemes are evaluated and appeared promising tendencies in scheduling process for single and multiple oriented critical resources(s). R53, RQ, R43, and R26 have achieved the best performance allover the categories under consideration. R43 and ACTIM have achieved the best performance for first category while R52, R53, RQ, MWCA, MTG2, MROT-MACTRES, and MACROS have achieved the best performance for second category. MWROR, MTOR, R25, R31, R41, R49, R52, R53, and R55 have achieved the best performance for third category. The proposed scheduling schemes are integrated in a coded algorithm not only for the evaluation process of the priority orders of the project activities under consideration for n oriented critical resources but also for determining the best schedule for the project under consideration using the available variability of scheduling schemes.