메뉴 건너뛰기




Volumn 117, Issue 3, 1999, Pages 591-605

Resource levelling for projects with schedule-dependent time windows

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPETITION; HEURISTIC METHODS; PROBLEM SOLVING; RESOURCE ALLOCATION; SCHEDULING;

EID: 0032657381     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(98)00272-0     Document Type: Article
Times cited : (90)

References (32)
  • 6
    • 85017021690 scopus 로고    scopus 로고
    • Heuristic procedures for resource-constrained project scheduling with minimal and maximal time lags: The resource-levelling and minimum project duration problems
    • Brinkmann, K., Neumann, K., 1996. Heuristic procedures for resource-constrained project scheduling with minimal and maximal time lags: the resource-levelling and minimum project duration problems. Journal of Decision Systems 5, 129-155.
    • (1996) Journal of Decision Systems , vol.5 , pp. 129-155
    • Brinkmann, K.1    Neumann, K.2
  • 9
    • 0000463458 scopus 로고
    • Minimizing resource availability costs in time-limited project networks
    • Demeulemeester, E., 1995. Minimizing resource availability costs in time-limited project networks. Management Science 41, 1590-1598.
    • (1995) Management Science , vol.41 , pp. 1590-1598
    • Demeulemeester, E.1
  • 16
    • 0020763485 scopus 로고
    • Multiple resource leveling in construction systems through variation of activity intensities
    • Leachman, R.C., 1983. Multiple resource leveling in construction systems through variation of activity intensities. Naval Research Logistics Quarterly 30, 187-198.
    • (1983) Naval Research Logistics Quarterly , vol.30 , pp. 187-198
    • Leachman, R.C.1
  • 19
    • 0021161421 scopus 로고
    • Minimizing costs of resource requirements in project networks subject to a fixed completion time
    • Möhring, R.H., 1984. Minimizing costs of resource requirements in project networks subject to a fixed completion time. Operations Research 32, 89-120.
    • (1984) Operations Research , vol.32 , pp. 89-120
    • Möhring, R.H.1
  • 22
    • 0000497721 scopus 로고    scopus 로고
    • Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production
    • Neumann, K., Schwindt, C., 1997. Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production, OR Spektrum 19, 205-217.
    • (1997) OR Spektrum , vol.19 , pp. 205-217
    • Neumann, K.1    Schwindt, C.2
  • 25
    • 0031191622 scopus 로고    scopus 로고
    • A procedure for calculating the weight-matrix of a neuronal network for resource leveling
    • Savin, D., Alkass, S., Fazio, P., 1997. A procedure for calculating the weight-matrix of a neuronal network for resource leveling. Advances in Engineering Software 28, 277-283.
    • (1997) Advances in Engineering Software , vol.28 , pp. 277-283
    • Savin, D.1    Alkass, S.2    Fazio, P.3
  • 28
    • 0029368473 scopus 로고
    • Zero-one quadratic programming algorithm for resource leveling of manufacturing process schedules
    • Takamoto, M., Yamada, N., Kobayashi, Y., Nonaka, H., 1995. Zero-one quadratic programming algorithm for resource leveling of manufacturing process schedules. Systems and Computers in Japan 26, 68-76.
    • (1995) Systems and Computers in Japan , vol.26 , pp. 68-76
    • Takamoto, M.1    Yamada, N.2    Kobayashi, Y.3    Nonaka, H.4
  • 30
    • 84989436573 scopus 로고
    • A heuristic algorithm for resource leveling in multi-project, multi-resource scheduling
    • Woodworth, B.M., Willie, C.J., 1975. A heuristic algorithm for resource leveling in multi-project, multi-resource scheduling. Decision Sciences 6, 525-540.
    • (1975) Decision Sciences , vol.6 , pp. 525-540
    • Woodworth, B.M.1    Willie, C.J.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.