메뉴 건너뛰기




Volumn 52, Issue 3, 2000, Pages 489-499

Solving the discrete-continuous project scheduling problem via its discretization

Author keywords

Continuous resources; Discrete resources; Multi mode project scheduling; Simulated annealing

Indexed keywords


EID: 18044401370     PISSN: 14322994     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001860000094     Document Type: Article
Times cited : (25)

References (13)
  • 3
    • 0030124780 scopus 로고    scopus 로고
    • A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes
    • Boctor FF (1996) A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes. European Journal of Operational Research 90:349 361
    • (1996) European Journal of Operational Research , vol.90 , pp. 349361
    • Boctor, F.F.1
  • 4
    • 0021819411 scopus 로고
    • Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
    • Černy V (1985) Thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm. Journal of Optimization Theory And Applications 45:41-51
    • (1985) Journal of Optimization Theory and Applications , vol.45 , pp. 41-51
    • Černy, V.1
  • 5
    • 0002907360 scopus 로고
    • A branch-and-bound procedure for the multiple resource-constrained project scheduling problem
    • Demeulemeester E, Herrolen W (1992) A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Management Science 38(12):1803-1818
    • (1992) Management Science , vol.38 , Issue.12 , pp. 1803-1818
    • Demeulemeester, E.1    Herrolen, W.2
  • 6
    • 0027666457 scopus 로고
    • Nonpreemptive multi-mode resource-constrained project scheduling
    • Drexl A, Grünewald J (1993) Nonpreemptive multi-mode resource-constrained project scheduling. IIEE Transactions 25:74-81
    • (1993) IIEE Transactions , vol.25 , pp. 74-81
    • Drexl, A.1    Grünewald, J.2
  • 7
    • 0040577754 scopus 로고    scopus 로고
    • Project scheduling with multiple modes: A comparison of exact algorithms
    • Hartmann S, Drexl A (1998) Project scheduling with multiple modes: A comparison of exact algorithms. Networks 32:283-297
    • (1998) Networks , vol.32 , pp. 283-297
    • Hartmann, S.1    Drexl, A.2
  • 12
    • 21344485821 scopus 로고
    • Resource-constrained project scheduling: Exact methods for the multimode case
    • Springer, Berlin
    • Sprecher A (1994) Resource-constrained project scheduling: Exact methods for the multimode case. Lecture Notes in Economics and Mathematical Systems, No 409, Springer, Berlin
    • (1994) Lecture Notes in Economics and Mathematical Systems , Issue.409
    • Sprecher, A.1


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