메뉴 건너뛰기




Volumn 54, Issue 12, 2003, Pages 1275-1282

Erratum: New heuristic for the dynamic layout problem (Journal of the Operational Research Society (2003) 54 (1275-1282) doi:10.1057/palgrave.jors.2601646);New heuristic for the dynamic layout problem

Author keywords

Heuristics; Layout planning; Mathematical programming

Indexed keywords

BUDGET CONTROL; COSTS; FACILITIES; FLOW PATTERNS; HEURISTIC METHODS; MATHEMATICAL PROGRAMMING; PLANNING; PROBLEM SOLVING; RELOCATION; SIMULATED ANNEALING;

EID: 0346276928     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601978     Document Type: Erratum
Times cited : (45)

References (12)
  • 1
    • 0023364439 scopus 로고
    • The facility layout problem
    • Kusiak A and Heragu SS (1987), The facility layout problem. Eur J Opl Res 29: 229-251.
    • (1987) Eur J Opl Res , vol.29 , pp. 229-251
    • Kusiak, A.1    Heragu, S.S.2
  • 2
    • 0022516277 scopus 로고
    • The dynamics of plant layout
    • Rosenblatt MJ (1986). The dynamics of plant layout. Mgmt Sci 32: 76-86.
    • (1986) Mgmt Sci , vol.32 , pp. 76-86
    • Rosenblatt, M.J.1
  • 3
    • 0026827205 scopus 로고
    • Solutions for the constrained dynamic facility layout problem
    • Balakrishnan J, Jacobs RF and Venkataramanan MA (1992). Solutions for the constrained dynamic facility layout problem. Eur J Opl Res 57: 280-286.
    • (1992) Eur J Opl Res , vol.57 , pp. 280-286
    • Balakrishnan, J.1    Jacobs, R.F.2    Venkataramanan, M.A.3
  • 4
    • 0027632929 scopus 로고
    • A heuristic for the dynamic facility layout problem
    • Urban TL (1993). A heuristic for the dynamic facility layout problem. IIE Trans 25: 57-63.
    • (1993) IIE Trans , vol.25 , pp. 57-63
    • Urban, T.L.1
  • 5
    • 0027559579 scopus 로고
    • Quadratic assignment algorithms for the dynamic layout problem
    • Lacksonen TA and Enscore EE (1993). Quadratic assignment algorithms for the dynamic layout problem. Int J Prod Res 31: 503-517.
    • (1993) Int J Prod Res , vol.31 , pp. 503-517
    • Lacksonen, T.A.1    Enscore, E.E.2
  • 6
    • 0028518432 scopus 로고
    • Genetic search and the dynamic facility layout problem
    • Conway DG and Venkataramanan MA (1994). Genetic search and the dynamic facility layout problem. Comput Opns Res 21: 955-960.
    • (1994) Comput Opns Res , vol.21 , pp. 955-960
    • Conway, D.G.1    Venkataramanan, M.A.2
  • 7
    • 0034003451 scopus 로고    scopus 로고
    • Genetic search and the dynamic layout problem
    • Balakrishnan J and Cheng CH (2000). Genetic search and the dynamic layout problem. Comp Opns Res 27: 587-593.
    • (2000) Comp Opns Res , vol.27 , pp. 587-593
    • Balakrishnan, J.1    Cheng, C.H.2
  • 8
    • 0035546638 scopus 로고    scopus 로고
    • A simulated annealing algorithm for dynamic layout problem
    • Baykasoglu A and Gindy NNZ (2001). A simulated annealing algorithm for dynamic layout problem. Comput Opns Res 28: 1403-1426.
    • (2001) Comput Opns Res , vol.28 , pp. 1403-1426
    • Baykasoglu, A.1    Gindy, N.N.Z.2
  • 9
    • 0032134718 scopus 로고    scopus 로고
    • Dynamic layout algorithms: A state-of-the-art survey
    • Balakrishnan J and Cheng CH (1998). Dynamic layout algorithms: a state-of-the-art survey. OMEGA 26: 507-521.
    • (1998) OMEGA , vol.26 , pp. 507-521
    • Balakrishnan, J.1    Cheng, C.H.2
  • 11
    • 0030092646 scopus 로고    scopus 로고
    • Algorithm 754: FORTRAN subroutines for approximate solution of dense quadratic assignment problems using GRASP
    • Resende MGC, Pardalos PM and Li Y (1996). Algorithm 754: FORTRAN subroutines for approximate solution of dense quadratic assignment problems using GRASP. ACM Trans Math Software 22: 104-118.
    • (1996) ACM Trans Math Software , vol.22 , pp. 104-118
    • Resende, M.G.C.1    Pardalos, P.M.2    Li, Y.3
  • 12
    • 0034079265 scopus 로고    scopus 로고
    • A greedy genetic algorithm for the quadratic assignment problem
    • Ahuja RK, Orlin JB and Tiwari A (2000). A greedy genetic algorithm for the quadratic assignment problem. Comput Opns Res 27: 917-934.
    • (2000) Comput Opns Res , vol.27 , pp. 917-934
    • Ahuja, R.K.1    Orlin, J.B.2    Tiwari, A.3


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