| 000 | 01862naa a2200193uu 4500 | ||
|---|---|---|---|
| 001 | 0032510132637 | ||
| 003 | OSt | ||
| 005 | 20190211170653.0 | ||
| 008 | 100325s2009 xx ||||gr |0|| 0 eng d | ||
| 100 | 1 |
_aWULIANG, Peng _939203 |
|
| 245 | 1 | 0 | _aA multi-mode resource-constrained discrete timecost tradeoff problem and its genetic algorithm based solution |
| 260 |
_aExeter, UK : _bElsevier, _cAugust 2009 |
||
| 520 | 3 | _aThe discrete timecost tradeoff problem (DTCTP) is an important subject in the project scheduling theory and applications. Due to the fact that the resources used in projects in modern enterprises mainly belong to renewable resources, e.g. manpower resources, the general DTCTP is extended to a new multi-mode resource-constrained DTCTP model (MRC-DTCTP). The multi-mode resource-constrained project scheduling problem (MRCPSP) was referred and the renewable resource constraints were added to the general DTCTP. By predefining the resource price, the renewable resources are related to the project costs, including direct cost and indirect cost. Every activity can be executed in the crashing way in which the project direct costs are used to shorten the activity duration. According to the characteristics of the MRC-DTCTP, an improved genetic algorithm for solving it was developed and its effectiveness was verified by compared with the exact algorithm. Finally an entire timecost tradeoff curve for a project network was drawn through computing project deadline problem, and the advantages of the MRC-DTCTP were investigated based on computation results. | |
| 700 | 1 |
_aCHENGEN, Wang _939204 |
|
| 773 | 0 | 8 |
_tInternational Journal of Project Management _g27, 6, p. 600-609 _dExeter, UK : Elsevier, August 2009 _xISSN 02637863 _w |
| 942 | _cS | ||
| 998 |
_a20100325 _b1013^b _cDaiane |
||
| 998 |
_a20100326 _b1052^b _cCarolina |
||
| 999 |
_aConvertido do Formato PHL _bPHL2MARC21 1.1 _c32106 _d32106 |
||
| 041 | _aeng | ||