메뉴 건너뛰기




Volumn 82, Issue 3, 1995, Pages 383-408

Activity nets: A guided tour through some recent developments

Author keywords

Activity nets; Complexity; Financial considerations; Project representation

Indexed keywords

COMPUTER SOFTWARE; COSTS; CRITICAL PATH ANALYSIS; DECISION MAKING; OPTIMIZATION; PERSONAL COMPUTERS; PERT; PIECEWISE LINEAR TECHNIQUES; PLANNING; PROJECT MANAGEMENT; SCHEDULING; SUPERVISORY PERSONNEL;

EID: 0029635345     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(94)00184-E     Document Type: Article
Times cited : (100)

References (71)
  • 1
    • 0024715589 scopus 로고
    • A classified bibliography of research on stochastic PERT networks: 1966–1987
    • (1989) INFOR , vol.27 , pp. 272-296
    • Adlakha1    Kulkarni2
  • 10
    • 0042613495 scopus 로고
    • Letter to the Editor—Bibliography on Project Planning and Control by Network Analysis: 1959–1961
    • (1962) Operations Research , vol.10 , pp. 728-731
    • Bigelow1
  • 14
    • 0003769108 scopus 로고
    • Payments in projects: A contractor's model
    • The H. John Heinz III School of Public Policy and Management, Carnegie Mellon University, Pittsburgh, PA 15213
    • (1993) Research Report
    • Dayanand1    Padman2
  • 15
    • 9644287171 scopus 로고
    • On the use of the complexity index as a measure of complexity in activity networks
    • Department of Applied Economics, Katholieke Universiteit Leuven, Huis Renaer, Debériotstraat 36, B-3000 Leuven, Belgium
    • (1993) Research Report No. 9332
    • De Reyck1    Herroelen2
  • 18
    • 84910908007 scopus 로고
    • Resource constrained project crashing
    • (1992) Omega , vol.17 , pp. 106-111
    • Deckro1    Hebert2
  • 20
    • 0348024595 scopus 로고
    • A branchand-bound procedure for the generalized resource-constrained project scheduling problem
    • Department of Applied Economic Sciences, Katholieke Universiteit Leuven, Leuven, Belgium
    • (1992) Research Report 9206
    • Demeulemeester1    Herroelen2
  • 21
    • 84910892834 scopus 로고
    • Project management with the PC: Part I and Part II
    • (1984) PC Magazine , vol.3 , Issue.21 , pp. 109-156
    • Edwards1
  • 22
    • 84910892834 scopus 로고
    • Project management with the PC: Part I and Part II
    • (1984) PC Magazine , vol.3 , Issue.24 , pp. 193-277
    • Edwards1
  • 39
  • 44
    • 0041403092 scopus 로고
    • Network planning by the extended METRA Potential Method
    • 3rd ed., Department of Industrial Engineering, University of Technology Eindhoven, Netherlands
    • (1975) Report KS-1.1
    • Kerbosh1    Schell2
  • 46
    • 0009318561 scopus 로고
    • Characterization and generation of a general class of resource-constrained project scheduling problems: Easy and hard instances
    • 3rd ed., Institut für Betriebswirtschaftslehere, Christian-Albrechts Universität zu Kiel
    • (1992) Research Report N0301
    • Kolisch1    Sprecher2    Drexl3
  • 47
    • 0018517514 scopus 로고
    • Complexity of the minimum-dummy-activities problem in a PERT network
    • (1979) Networks , vol.9 , pp. 189-194
    • Krishnamoorthy1    Deo2
  • 49
    • 0043114424 scopus 로고
    • Letter to the Editor—Bibliography on Network-Based Project Planning and Control Techniques: 1962–1965
    • (1966) Operations Research , vol.14 , pp. 925-931
    • Lerda-Olberg1
  • 50
    • 0002493851 scopus 로고
    • Optimal representation of activity networks as directed acyclic graphs
    • 3rd ed., Program in Operations Research, North Carolina State University, Raleigh, NC 27695-7913
    • (1991) Ph.D. Thesis
    • Michael1
  • 55
    • 84910898573 scopus 로고
    • Exact and heuristic solution procedures for the constrained-resource, project scheduling problem: Volumes I, II, and III
    • privately circulated
    • (1983) Research Monograph
    • Patterson1
  • 56
    • 0017268482 scopus 로고
    • Scheduling a project under multiple resource constraints: A zero-one programming approach
    • (1976) IIE Transactions , vol.8 , pp. 449-455
    • Patterson1    Roth2
  • 60
    • 0000478729 scopus 로고
    • Solving resource-constrained network problems by implicit enumeration — nonpremptive case
    • (1970) Operations Research , vol.18 , pp. 225-235
    • Schrage1
  • 61
  • 66
    • 0021392496 scopus 로고
    • On the computational complexity of the minimum dummy activity problem in a PERT network
    • (1984) Networks , vol.14 , pp. 37-45
    • Syslo1
  • 67
    • 0017997005 scopus 로고
    • An efficient integer programming algorithm with network cuts for solving resource-constrained scheduling problems
    • (1978) Management Science , vol.24 , pp. 1163-1174
    • Talbot1    Patterson2


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