메뉴 건너뛰기




Volumn 48, Issue 6, 2001, Pages 468-483

Heuristics for the multi-resource generalized assignment problem

Author keywords

0 1 integer programming; Generalized assignment problem; Heuristics

Indexed keywords

CONSTRAINT THEORY; HEURISTIC METHODS; INTEGER PROGRAMMING; PROBLEM SOLVING; RESOURCE ALLOCATION;

EID: 0035449507     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/nav.1029     Document Type: Article
Times cited : (18)

References (30)
  • 2
    • 0003799987 scopus 로고    scopus 로고
    • Improving service productivity: Integer programming helps to improve the layout of a parts distribution center
    • (1996) OR Insight , vol.9 , pp. 2-7
    • Butler, T.1    Mazzola, J.B.2
  • 5
    • 0019477279 scopus 로고
    • The Lagrangian relaxation method for solving integer programming problems
    • (1981) Manage Sci , vol.27 , pp. 1-18
    • Fisher, M.1
  • 10
    • 0017911225 scopus 로고
    • On obtaining the "best" multipliers for a Lagrangian relaxation for integer programming
    • (1978) Comput Oper Res , vol.5 , pp. 55-71
    • Gavish, B.1
  • 12
  • 22
    • 0003740212 scopus 로고
    • Generalized assignment with nonlinear capacity interaction
    • (1989) Manage Sci , vol.35 , pp. 923-940
    • Mazzola, J.B.1
  • 26
    • 0000211426 scopus 로고
    • An integer programming model for the allocation of databases in a distributed computer system
    • (1986) Eur J Oper Res , vol.26 , pp. 401-411
    • Pirkul, H.1
  • 30
    • 0003875254 scopus 로고
    • The generalized assignment problem: Algorithms, multiplier adjustment methods, and multiple resource constraints
    • Ph.D. dissertation, University of North Carolina, Chapel Hill; (unpublished)
    • (1987)
    • Wilcox, S.P.1


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