메뉴 건너뛰기




Volumn 30, Issue 1, 1998, Pages 91-99

Project scheduling algorithms for re-layout projects

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; SCHEDULING;

EID: 0031677622     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408179808966440     Document Type: Article
Times cited : (10)

References (12)
  • 1
    • 1142292641 scopus 로고
    • Plant layout in practice
    • Nicol, L.M., (1983) Plant layout in practice. Material Flow, 1 (3), 101–107.
    • (1983) Material Flow , vol.1 , Issue.3 , pp. 101-107
    • Nicol, L.M.1
  • 3
    • 33749834100 scopus 로고    scopus 로고
    • The facility layout problem recent trends and perspectives
    • Meller, R.D., and Gau, K.-Y., (1996) The facility layout problem recent trends and perspectives. Journal of Manufacturing Systems, 15 (5) 351–366.
    • (1996) Journal of Manufacturing Systems , vol.15 , Issue.5 , pp. 351-366
    • Meller, R.D.1    Gau, K.-Y.2
  • 4
    • 0022097645 scopus 로고
    • A computer model for investigating the re-layout of batch production areas
    • Driscoll, J., and Sawyer, J.H.F., (1985) A computer model for investigating the re-layout of batch production areas. International Journal of Production Research, 23 (4), 783–794.
    • (1985) International Journal of Production Research , vol.23 , Issue.1 , pp. 783-794
    • Driscoll, J.1    Sawyer, J.H.F.2
  • 7
    • 84974863272 scopus 로고
    • Static and dynamic layout problems with varying areas
    • Lacksonen, T., (1994) Static and dynamic layout problems with varying areas. Journal of the Operational Research Society, 45 (1), 59–69.
    • (1994) Journal of the Operational Research Society , vol.45 , Issue.1 , pp. 59-69
    • Lacksonen, T.1
  • 8
    • 0002907360 scopus 로고
    • A branch-and-bound procedure for the multiple resource-constrained project scheduling problem
    • Demeulemeester, E., and Herroelen, 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    Herroelen, W.2
  • 9
    • 0025701919 scopus 로고
    • Some efficient multi-heuristic procedures for resource-constrained project scheduling
    • Boctor, F.F., (1990) Some efficient multi-heuristic procedures for resource-constrained project scheduling. European Journal of Operational Research, 49, 3–13.
    • (1990) European Journal of Operational Research , vol.49 , pp. 3-13
    • Boctor, F.F.1
  • 10
    • 0016028677 scopus 로고
    • A horizon-varying, zero-one approach to project scheduling
    • Patterson, J.H., and Huber, W.D., (1974) A horizon-varying, zero-one approach to project scheduling. Management Science, 20 (6), 990–998.
    • (1974) Management Science , vol.20 , Issue.6 , pp. 990-998
    • Patterson, J.H.1    Huber, W.D.2
  • 11
    • 84989436573 scopus 로고
    • A heuristic algorithm for resource leveling in multi-project, multi-resource scheduling
    • Woodworth, B.M., and Willie, C.T., (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.T.2


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