메뉴 건너뛰기




Volumn 45, Issue 4, 1999, Pages 543-559

Project scheduling under partially renewable resource constraints

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LAWS AND LEGISLATION; MATHEMATICAL MODELS; OPTIMIZATION; PROJECT MANAGEMENT; RESOURCE ALLOCATION;

EID: 18144452822     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.45.4.543     Document Type: Article
Times cited : (75)

References (37)
  • 1
    • 0001849846 scopus 로고
    • Heuristic algorithms for resource-constrained project scheduling: A review and an empirical analysis
    • Slłowiński, R., J. Wȩglarz, Eds. Elsevier, Amsterdam
    • Alvarez-Valdes, R., J. M. Tamarit. 1989. Heuristic algorithms for resource-constrained project scheduling: a review and an empirical analysis. Slłowiński, R., J. Wȩglarz, Eds. Advances in Project Scheduling. Elsevier, Amsterdam, 113-134.
    • (1989) Advances in Project Scheduling , pp. 113-134
    • Alvarez-Valdes, R.1    Tamarit, J.M.2
  • 2
    • 84989743918 scopus 로고
    • A new heuristic solution method in resourceconstrained project scheduling
    • Bell, C. E., J. Han. 1991. A new heuristic solution method in resourceconstrained project scheduling. Naval Res. Logistics 38 315-331.
    • (1991) Naval Res. Logistics , vol.38 , pp. 315-331
    • Bell, C.E.1    Han, J.2
  • 3
    • 0025385096 scopus 로고
    • Solving resource-constrained project scheduling problems by A* search
    • _, K. Park. 1990. Solving resource-constrained project scheduling problems by A* search. Naval Res. Logistics 37 61-84.
    • (1990) Naval Res. Logistics , vol.37 , pp. 61-84
    • Park, K.1
  • 5
    • 0025701919 scopus 로고
    • Some efficient multi-heuristic procedures for resourceconstrained project scheduling
    • Boctor, F. F. 1990. Some efficient multi-heuristic procedures for resourceconstrained project scheduling. European J. Oper. Res. 49 3-13.
    • (1990) European J. Oper. Res. , vol.49 , pp. 3-13
    • Boctor, F.F.1
  • 7
    • 0032096810 scopus 로고    scopus 로고
    • A branch and bound algorithm for the resource-constrained project scheduling problem
    • Brucker, P., S. Knust, A. Schoo, O. Thiele. 1998. A branch and bound algorithm for the resource-constrained project scheduling problem. European J. Oper. Res. 107 272-288.
    • (1998) European J. Oper. Res. , vol.107 , pp. 272-288
    • Brucker, P.1    Knust, S.2    Schoo, A.3    Thiele, O.4
  • 8
    • 0038527478 scopus 로고
    • Une méthode arborescente pour résoudre les problemes cumulatifs
    • Carlier, J., B. Latapie. 1991. Une méthode arborescente pour résoudre les problemes cumulatifs. Recherche Operationnelle 25 311-340.
    • (1991) Recherche Operationnelle , vol.25 , pp. 311-340
    • Carlier, J.1    Latapie, B.2
  • 9
    • 0023362513 scopus 로고
    • Project scheduling with resource constraints: A branch and bound approach
    • Christofides, N., R. Alvarez-Valdes, J. M. Tamarit. 1987. Project scheduling with resource constraints: a branch and bound approach. European J. Oper. Res. 29 262-273.
    • (1987) European J. Oper. Res. , vol.29 , pp. 262-273
    • Christofides, N.1    Alvarez-Valdes, R.2    Tamarit, J.M.3
  • 10
    • 0016972372 scopus 로고
    • Heuristics for scheduling resource-constrained projects: An experimental investigation
    • Cooper, D. F. 1976. Heuristics for scheduling resource-constrained projects: an experimental investigation. Management Sci. 22 1186-1194.
    • (1976) Management Sci. , vol.22 , pp. 1186-1194
    • Cooper, D.F.1
  • 11
    • 0000813734 scopus 로고
    • An algorithm for optimal project scheduling under multiple resource constraints
    • Davis, E. W., G. E. Heidorn. 1971. An algorithm for optimal project scheduling under multiple resource constraints. Management Sci. 17 803-816.
    • (1971) Management Sci. , vol.17 , pp. 803-816
    • Davis, E.W.1    Heidorn, G.E.2
  • 12
    • 0002907360 scopus 로고
    • A branch-and-bound procedure for the multiple resource-constrained project scheduling problem
    • Demeulemeester, E., W. Herroelen. 1992. A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Management Sci. 38 1803-1818.
    • (1992) Management Sci. , vol.38 , pp. 1803-1818
    • Demeulemeester, E.1    Herroelen, W.2
  • 13
    • 0031272722 scopus 로고    scopus 로고
    • New benchmark results for the resourceconstrained project scheduling problem
    • _. 1997. New benchmark results for the resourceconstrained project scheduling problem. Management Sci. 43 1485-1492.
    • (1997) Management Sci. , vol.43 , pp. 1485-1492
  • 14
    • 0026376478 scopus 로고
    • Scheduling of project networks by job assignment
    • Drexl, A. 1991. Scheduling of project networks by job assignment. Management Sci. 37 1590-1602.
    • (1991) Management Sci. , vol.37 , pp. 1590-1602
    • Drexl, A.1
  • 15
    • 0027666457 scopus 로고
    • Nonpreemptive multi-mode resourceconstrained project scheduling
    • _, J. Grünewald. 1993. Nonpreemptive multi-mode resourceconstrained project scheduling. IIE Trans. 25 (5) 74-81.
    • (1993) IIE Trans. , vol.25 , Issue.5 , pp. 74-81
    • Grünewald, J.1
  • 18
    • 0023385165 scopus 로고
    • Semi-greedy heuristics: An empirical study
    • Hart, J. P., A. W. Shogan. 1987. Semi-greedy heuristics: an empirical study. Oper. Res. Letters 6 107-114.
    • (1987) Oper. Res. Letters , vol.6 , pp. 107-114
    • Hart, J.P.1    Shogan, A.W.2
  • 20
    • 0002866635 scopus 로고
    • The critical-path method: Resources planning and scheduling
    • J. F. Muth, G. L. Thompson, Eds. Prentice-Hall, NJ
    • Kelley, J. E. Jr. 1963. The critical-path method: resources planning and scheduling. J. F. Muth, G. L. Thompson, Eds. Industrial Scheduling. Prentice-Hall, NJ, 347-365.
    • (1963) Industrial Scheduling , pp. 347-365
    • Kelley J.E., Jr.1
  • 22
    • 0030121479 scopus 로고    scopus 로고
    • Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
    • _. 1996a. Serial and parallel resource-constrained project scheduling methods revisited: theory and computation. European J. Oper. Res. 90 320-333.
    • (1996) European J. Oper. Res. , vol.90 , pp. 320-333
  • 23
    • 0030231487 scopus 로고    scopus 로고
    • Efficient priority rules for the resource-constrained project scheduling problem
    • _. 1996b. Efficient priority rules for the resource-constrained project scheduling problem. J. Oper. Management 14 179-192.
    • (1996) J. Oper. Management , vol.14 , pp. 179-192
  • 24
    • 0001896880 scopus 로고    scopus 로고
    • Adaptive search for solving hard project scheduling problems
    • _, A. Drexl. 1996. Adaptive search for solving hard project scheduling problems. Naval Res. Logistics 43 23-40.
    • (1996) Naval Res. Logistics , vol.43 , pp. 23-40
    • Drexl, A.1
  • 25
    • 0000698758 scopus 로고
    • Characterization and generation of a general class of resource-constrained project scheduling problems
    • _, A. Sprecher, A. Drexl. 1995. Characterization and generation of a general class of resource-constrained project scheduling problems. Management Sci. 41 1693-1703.
    • (1995) Management Sci. , vol.41 , pp. 1693-1703
    • Sprecher, A.1    Drexl, A.2
  • 26
    • 0000802876 scopus 로고
    • A greedy randomized adaptive search procedure for the two-partition problem
    • Laguna, M., T. A. Feo, H. C. Elrod. 1994. A greedy randomized adaptive search procedure for the two-partition problem. Oper. Res. 42 677-687.
    • (1994) Oper. Res. , vol.42 , pp. 677-687
    • Laguna, M.1    Feo, T.A.2    Elrod, H.C.3
  • 27
    • 33845274958 scopus 로고
    • Strength and adaptability of problem-space based neighborhoods for resource constrained scheduling
    • Leon, V. J., R. Balakrishnan. 1995. Strength and adaptability of problem-space based neighborhoods for resource constrained scheduling. OR Spektrum 17 173-182.
    • (1995) OR Spektrum , vol.17 , pp. 173-182
    • Leon, V.J.1    Balakrishnan, R.2
  • 28
    • 0026822242 scopus 로고
    • An iterative scheduling technique for resource-constrained project scheduling
    • Li, R. K.-Y., J. Willis. 1992. An iterative scheduling technique for resource-constrained project scheduling. European J. Oper. Res. 56 370-379.
    • (1992) European J. Oper. Res. , vol.56 , pp. 370-379
    • Li, R.K.-Y.1    Willis, J.2
  • 29
    • 0032070635 scopus 로고    scopus 로고
    • An exact algorithm for project scheduling with resource constraints based on a new mathematical formulation
    • Mingozzi, A., V. Maniezzo, S. Ricciardelli, L. Bianco. 1998. An exact algorithm for project scheduling with resource constraints based on a new mathematical formulation. Management Sci. 44(5) 714-729.
    • (1998) Management Sci. , vol.44 , Issue.5 , pp. 714-729
    • Mingozzi, A.1    Maniezzo, V.2    Ricciardelli, S.3    Bianco, L.4
  • 30
    • 0028195268 scopus 로고
    • A comparative study of computational procedures for the resource constrained project scheduling problem
    • Oguz, O., H. Bala. 1994. A comparative study of computational procedures for the resource constrained project scheduling problem. European J. Oper. Res. 72 406-416.
    • (1994) European J. Oper. Res. , vol.72 , pp. 406-416
    • Oguz, O.1    Bala, H.2
  • 31
    • 0017268482 scopus 로고
    • Scheduling a project under multiple resource constraints: A zero-one programming approach
    • Patterson, J. H., G. W. Roth. 1976. Scheduling a project under multiple resource constraints: a zero-one programming approach. AIIE Trans. 8 449-455.
    • (1976) AIIE Trans. , vol.8 , pp. 449-455
    • Patterson, J.H.1    Roth, G.W.2
  • 32
    • 0014574409 scopus 로고
    • Multiproject scheduling with limited resources: A zero-one programming approach
    • Pritsker, A. A. B., L. J. Watters, P. M. Wolfe. 1969. Multiproject scheduling with limited resources: a zero-one programming approach. Management Sci. 16 93-107.
    • (1969) Management Sci. , vol.16 , pp. 93-107
    • Pritsker, A.A.B.1    Watters, L.J.2    Wolfe, P.M.3
  • 33
    • 0040347827 scopus 로고
    • Scheduling of project networks
    • Radermacher, F. J. 1985/86. Scheduling of project networks. Ann. Oper. Res. 4 227-252.
    • (1985) Ann. Oper. Res. , vol.4 , pp. 227-252
    • Radermacher, F.J.1
  • 34
    • 84989730007 scopus 로고
    • Local search techniques for the generalized resource constrained project scheduling problem
    • Sampson, S. E., E. N. Weiss. 1993. Local search techniques for the generalized resource constrained project scheduling problem. Naval Res. Logistics 40 365-375.
    • (1993) Naval Res. Logistics , vol.40 , pp. 365-375
    • Sampson, S.E.1    Weiss, E.N.2
  • 35
    • 0018011301 scopus 로고
    • Multiple resource-constrained scheduling using branch and bound
    • Stinson, J. P., E. W. Davis, B. M. Khumawala. 1978. Multiple resource-constrained scheduling using branch and bound. AIIE Trans. 10 252-259.
    • (1978) AIIE Trans. , vol.10 , pp. 252-259
    • Stinson, J.P.1    Davis, E.W.2    Khumawala, B.M.3
  • 36
    • 0017997005 scopus 로고
    • An efficient integer programming algorithm with network cuts for solving resourceconstrained project scheduling problems
    • Talbot, F. B., J. H. Patterson. 1978. An efficient integer programming algorithm with network cuts for solving resourceconstrained project scheduling problems. Management Sci. 24 1163-1174.
    • (1978) Management Sci. , vol.24 , pp. 1163-1174
    • Talbot, F.B.1    Patterson, J.H.2
  • 37
    • 0001303226 scopus 로고
    • Some properties of schedules for large projects with limited resources
    • Wiest, J. D. 1964. Some properties of schedules for large projects with limited resources. Oper. Res. 12 395-418.
    • (1964) Oper. Res. , vol.12 , pp. 395-418
    • Wiest, J.D.1


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