메뉴 건너뛰기




Volumn 59, Issue 2, 2010, Pages 323-333

Parallel hybrid metaheuristics for the flexible job shop problem

Author keywords

Flexible job shop problem; Hybrid metaheuristics; Population based algorithm; Scheduling; Tabu search

Indexed keywords

COMPUTATIONAL EXPERIMENT; FLEXIBLE JOB-SHOP PROBLEM; FLEXIBLE JOB-SHOP SCHEDULING PROBLEM; GRAPHICS PROCESSING UNIT; HYBRID METAHEURISTICS; MACHINE SELECTION; META HEURISTIC ALGORITHM; OPERATION SCHEDULING; POPULATION-BASED ALGORITHM;

EID: 77955308077     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2010.05.004     Document Type: Article
Times cited : (76)

References (20)
  • 2
    • 0037696818 scopus 로고    scopus 로고
    • Flexible job shop scheduling by tabu search. Graduate program in operations research and industrial engineering
    • The University of Texas at Austin
    • Barnes, J. W., Chambers, J. B. (1996). Flexible job shop scheduling by tabu search. Graduate program in operations research and industrial engineering, The University of Texas at Austin, Technical Report Series: ORP96-09.
    • (1996) Technical Report Series: ORP96-09
    • Barnes, J.W.1    Chambers, J.B.2
  • 3
    • 67349145992 scopus 로고    scopus 로고
    • Solving permutational routing problems by population-based metaheuristics
    • W. Boejko, and M. Wodecki Solving permutational routing problems by population-based metaheuristics Computers & Industrial Engineering 57 2009 269 276
    • (2009) Computers & Industrial Engineering , vol.57 , pp. 269-276
    • Boejko, W.1    Wodecki, M.2
  • 4
    • 34250084648 scopus 로고
    • Routing and scheduling in a flexible job shop by tabu search
    • P. Brandimarte Routing and scheduling in a flexible job shop by tabu search Annals of Operations Research 41 1993 157 183
    • (1993) Annals of Operations Research , vol.41 , pp. 157-183
    • Brandimarte, P.1
  • 5
    • 0042261208 scopus 로고    scopus 로고
    • An integrated approach for modeling and solving the general multiprocessor job shop scheduling problem using tabu search
    • S. Dauzre-Pérs, and J. Pauli An integrated approach for modeling and solving the general multiprocessor job shop scheduling problem using tabu search Annals of Operations Research 70 3 1997 281 306
    • (1997) Annals of Operations Research , vol.70 , Issue.3 , pp. 281-306
    • Dauzre-Pérs, S.1    Pauli, J.2
  • 7
    • 38749142590 scopus 로고    scopus 로고
    • A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
    • J. Gao, L. Sun, and M. Gen A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems Computers & Operations Research 35 2008 2892 2907
    • (2008) Computers & Operations Research , vol.35 , pp. 2892-2907
    • Gao, J.1    Sun, L.2    Gen, M.3
  • 10
    • 4344650514 scopus 로고    scopus 로고
    • GENACE: An efficient cultural algorithm for solving the flexible job-shop problem
    • Ho, N. B., Tay, J. C. (2004). GENACE: An efficient cultural algorithm for solving the flexible job-shop problem. In IEEE international conference on robotics and automation (pp. 1759-1766).
    • (2004) IEEE International Conference on Robotics and Automation , pp. 1759-1766
    • Ho, N.B.1    Tay, J.C.2
  • 11
    • 0000062615 scopus 로고
    • Tabu search for the job shop scheduling problem with multi-purpose machine
    • E. Hurink, B. Jurisch, and M. Thole Tabu search for the job shop scheduling problem with multi-purpose machine Operations Research Spektrum 15 1994 205 215
    • (1994) Operations Research Spektrum , vol.15 , pp. 205-215
    • Hurink, E.1    Jurisch, B.2    Thole, M.3
  • 13
    • 0036464279 scopus 로고    scopus 로고
    • Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems
    • I. Kacem, S. Hammadi, and P. Borne Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems IEEE Transactions on Systems, Man, and Cybernetics, Part C 32 1 2002 1 13
    • (2002) IEEE Transactions on Systems, Man, and Cybernetics, Part C , vol.32 , Issue.1 , pp. 1-13
    • Kacem, I.1    Hammadi, S.2    Borne, P.3
  • 14
    • 0002577337 scopus 로고    scopus 로고
    • Effective neighborhood functions for the flexible job shop problem
    • M. Mastrolilli, and L.M. Gambardella Effective neighborhood functions for the flexible job shop problem Journal of Scheduling 3 1 2000 3 20
    • (2000) Journal of Scheduling , vol.3 , Issue.1 , pp. 3-20
    • Mastrolilli, M.1    Gambardella, L.M.2
  • 15
    • 0001204823 scopus 로고    scopus 로고
    • A fast tabu search algorithm for the permutation flow-shop problem
    • DOI 10.1016/0377-2217(95)00037-2
    • E. Nowicki, and C. Smutnicki A fast tabu search algorithm for the permutation flow-shop problem European Journal of Operational Research 91 1996 160 175 (Pubitemid 126369642)
    • (1996) European Journal of Operational Research , vol.91 , Issue.1 , pp. 160-175
    • Nowicki, E.1    Smutnicki, C.2
  • 16
    • 0008573551 scopus 로고
    • A hierarchical approach for the FMS schduling problem
    • J. Pauli A hierarchical approach for the FMS schduling problem European Journal of Operational Research 86 1 1995 32 42
    • (1995) European Journal of Operational Research , vol.86 , Issue.1 , pp. 32-42
    • Pauli, J.1
  • 19
    • 0036723306 scopus 로고    scopus 로고
    • A taxonomy of hybrid metaheuristics
    • E.-G. Talbi A taxonomy of hybrid metaheuristics Journal of Heuristics 8 5 2002 541 564
    • (2002) Journal of Heuristics , vol.8 , Issue.5 , pp. 541-564
    • Talbi, E.-G.1


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