메뉴 건너뛰기




Volumn 8457 LNCS, Issue , 2014, Pages 130-144

Hybrids of integer programming and aco for resource constrained job scheduling

Author keywords

[No Author keywords available]

Indexed keywords

ANT COLONY OPTIMIZATION; ARTIFICIAL INTELLIGENCE; CONSTRAINED OPTIMIZATION; HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; LINEAR PROGRAMMING;

EID: 84903649725     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-07644-7_10     Document Type: Conference Paper
Times cited : (18)

References (24)
  • 1
    • 53349118245 scopus 로고    scopus 로고
    • An iterated-local-search heuristic for the resourceconstrained weighted earliness-Tardiness project scheduling problem
    • Ballestin, F., Trautmann, N.: An Iterated-local-search Heuristic for the Resourceconstrained Weighted Earliness-Tardiness Project Scheduling Problem. International Journal of Production Research 46, 6231-6249 (2008)
    • (2008) International Journal of Production Research , vol.46 , pp. 6231-6249
    • Ballestin, F.1    Trautmann, N.2
  • 4
    • 0003713964 scopus 로고
    • 2nd edn. Athena Scientific, New Hampshire
    • Bertsekas, D.: Nonlinear Programming, 2nd edn. Athena Scientific, New Hampshire (1995)
    • (1995) Nonlinear Programming
    • Bertsekas, D.1
  • 6
    • 0344236266 scopus 로고    scopus 로고
    • Metaheuristics in combinatorial optimization: Overview and conceptual comparison
    • Blum, C., Roli, A.: Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison. ACM Computing Surveys 35, 268-308 (2003)
    • (2003) ACM Computing Surveys , vol.35 , pp. 268-308
    • Blum, C.1    Roli, A.2
  • 7
    • 64549099460 scopus 로고    scopus 로고
    • Benders decomposition, lagrangean relaxation and metaheuristic design
    • Boschetti, M., Maniezzo, V.: Benders Decomposition, Lagrangean Relaxation and Metaheuristic Design. Journal of Heuristics 15(3), 283-312 (2009)
    • (2009) Journal of Heuristics , vol.15 , Issue.3 , pp. 283-312
    • Boschetti, M.1    Maniezzo, V.2
  • 12
    • 11844294921 scopus 로고    scopus 로고
    • The lagrangian relaxation method for solving integer programming problems
    • Fisher, M.: The Lagrangian Relaxation Method for Solving Integer Programming Problems. Management Science 50(12), 1861-1871 (2004)
    • (2004) Management Science , vol.50 , Issue.12 , pp. 1861-1871
    • Fisher, M.1
  • 17
    • 80052569757 scopus 로고    scopus 로고
    • Resource constraint scheduling with a fractional shared resource
    • Singh, G., Ernst, A.T.: Resource Constraint Scheduling with a Fractional Shared Resource. Operations Research Letters 39(5), 363-368 (2011)
    • (2011) Operations Research Letters , vol.39 , Issue.5 , pp. 363-368
    • Singh, G.1    Ernst, A.T.2
  • 19
    • 79959317307 scopus 로고    scopus 로고
    • A multi-Agent system for decentralised fractional shared resource constraint scheduling
    • Singh, G., Weiskircher, R.: A Multi-Agent System for Decentralised Fractional Shared Resource Constraint Scheduling. Web Intelligence and Agent Systems 9(2), 99-108 (2011)
    • (2011) Web Intelligence and Agent Systems 9 , vol.2 , pp. 99-108
    • Singh, G.1    Weiskircher, R.2
  • 20
    • 84977757703 scopus 로고    scopus 로고
    • Parallel ant colony optimization for resource constrained job scheduling
    • Thiruvady, D., Ernst, A.T., Singh, G.: Parallel Ant Colony Optimization for Resource Constrained Job Scheduling. Annals of Operations Research, 1-18 (2014)
    • (2014) Annals of Operations Research , pp. 1-18
    • Thiruvady, D.1    Ernst, A.T.2    Singh, G.3


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