메뉴 건너뛰기




Volumn 36, Issue 8, 2005, Pages 533-539

A fast tabu search algorithm for the group shop scheduling problem

Author keywords

Flow shop; Group shop; Job shop; Machine scheduling; Mixed shop; Open shop

Indexed keywords

ALGORITHMS; BENCHMARKING; COMPUTATIONAL METHODS; JOB ANALYSIS; PROBLEM SOLVING; SOFTWARE ENGINEERING;

EID: 18844386279     PISSN: 09659978     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.advengsoft.2005.02.002     Document Type: Article
Times cited : (29)

References (23)
  • 1
    • 0016952078 scopus 로고
    • The complexity of flowshop and jobshop scheduling
    • M.R. Garey, D.S. Johnson, and R. Sethi The complexity of flowshop and jobshop scheduling Math Oper Res 1 1976 117 129
    • (1976) Math Oper Res , vol.1 , pp. 117-129
    • Garey, M.R.1    Johnson, D.S.2    Sethi, R.3
  • 3
    • 0001947856 scopus 로고
    • Probabilistic learning combinations of local job-shop scheduling rules
    • Prentice Hall Englewood Cliffs, NJ
    • H. Fisher, and G.L. Thompson Probabilistic learning combinations of local job-shop scheduling rules Industrial scheduling 1963 Prentice Hall Englewood Cliffs, NJ p. 225-51
    • (1963) Industrial Scheduling
    • Fisher, H.1    Thompson, G.L.2
  • 4
    • 0000165767 scopus 로고
    • An algorithm for solving the job shop problem
    • J. Carlier, and E. Pinson An algorithm for solving the job shop problem Manage Sci 35 1989 164 176
    • (1989) Manage Sci , vol.35 , pp. 164-176
    • Carlier, J.1    Pinson, E.2
  • 5
    • 0036874125 scopus 로고    scopus 로고
    • A comparative study of algorithms for the flowshop scheduling problem
    • S.Q. Liu, and H.L. Ong A comparative study of algorithms for the flowshop scheduling problem Asia-Pacific J Oper Res 19 2 2002 205 222
    • (2002) Asia-Pacific J Oper Res , vol.19 , Issue.2 , pp. 205-222
    • Liu, S.Q.1    Ong, H.L.2
  • 6
    • 0033080204 scopus 로고    scopus 로고
    • A tabu search algorithm for the open shop scheduling problem
    • C.F. Liaw A tabu search algorithm for the open shop scheduling problem Comput Oper Res 26 1999 109 126
    • (1999) Comput Oper Res , vol.26 , pp. 109-126
    • Liaw, C.F.1
  • 8
    • 85009521387 scopus 로고    scopus 로고
    • http://www.win.tue.nl/whizzkids/1997, 1997.
    • (1997)
  • 9
    • 18744404504 scopus 로고    scopus 로고
    • An ant colony optimization algorithm for shop scheduling problems
    • C. Blum, and M. Sampels An ant colony optimization algorithm for shop scheduling problems J Math Modell Algorithms 3 2004 285 308
    • (2004) J Math Modell Algorithms , vol.3 , pp. 285-308
    • Blum, C.1    Sampels, M.2
  • 10
    • 4444276809 scopus 로고    scopus 로고
    • Metaheuristics for the mixed shop scheduling problem
    • S.Q. Liu, and H.L. Ong Metaheuristics for the mixed shop scheduling problem Asia-Pacific J Oper Res 21 1 2004 97 115
    • (2004) Asia-Pacific J Oper Res , vol.21 , Issue.1 , pp. 97-115
    • Liu, S.Q.1    Ong, H.L.2
  • 12
    • 10844252155 scopus 로고    scopus 로고
    • Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem
    • Liu SQ, Ong HL, Ng KM. Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem. Adv Eng Software 2005; 36:199-205.
    • (2005) Adv Eng Software , vol.36 , pp. 199-205
    • Liu, S.Q.1    Ong, H.L.2    Ng, K.M.3
  • 13
    • 4444299918 scopus 로고
    • Les problems d'ordonnancement avec contraintes
    • SEMA. Note D.S. Paris
    • Roy B, Sussmann B. Les problems d'ordonnancement avec contraintes. Technique Report 9, SEMA. Note D.S. Paris; 1964.
    • (1964) Technique Report , vol.9
    • Roy, B.1    Sussmann, B.2
  • 14
    • 0002610737 scopus 로고
    • On a routing problem
    • R.E. Bellman On a routing problem Q Appl Math 16 1958 87 90
    • (1958) Q Appl Math , vol.16 , pp. 87-90
    • Bellman, R.E.1
  • 15
    • 0000892122 scopus 로고
    • Parallel taboo search techniques for the job shop scheduling problem
    • E. Taillard Parallel taboo search techniques for the job shop scheduling problem ORSA J Comput 6 2 1994 108 117
    • (1994) ORSA J Comput , vol.6 , Issue.2 , pp. 108-117
    • Taillard, E.1
  • 16
    • 34250074609 scopus 로고
    • Applying tabu search to the job shop scheduling problem
    • M. Dell'Amico, and M. Trubian Applying tabu search to the job shop scheduling problem Ann Oper Res 41 1993 231 252
    • (1993) Ann Oper Res , vol.41 , pp. 231-252
    • Dell'Amico, M.1    Trubian, M.2
  • 17
    • 0022865373 scopus 로고
    • Future paths for integer programming and links to artificial intelligence
    • F. Glover Future paths for integer programming and links to artificial intelligence Comput Oper Res 13 1986 533 549
    • (1986) Comput Oper Res , vol.13 , pp. 533-549
    • Glover, F.1
  • 18
    • 0003327323 scopus 로고
    • The steepest ascent mildest descent heuristic for combinatorial programming
    • Capri
    • Hansen P. The steepest ascent mildest descent heuristic for combinatorial programming. Talk presented at the Congress on Numerical Methods in Combinatorial Optimization 1986, Capri.
    • (1986) Congress on Numerical Methods in Combinatorial Optimization
    • Hansen, P.1
  • 19
    • 0000411214 scopus 로고
    • Tabu search-part I
    • F. Glover Tabu search-part I ORSA J Comput 1 3 1989 190 206
    • (1989) ORSA J Comput , vol.1 , Issue.3 , pp. 190-206
    • Glover, F.1
  • 20
    • 0001724713 scopus 로고
    • Tabu search-part II
    • F. Glover Tabu search-part II ORSA J Comput 2 1 1990 4 32
    • (1990) ORSA J Comput , vol.2 , Issue.1 , pp. 4-32
    • Glover, F.1
  • 21
    • 0003994089 scopus 로고
    • Resource constrained project scheduling: An experimental investigation of heuristic scheduling techniques (supplement)
    • Carnegie Mellon University Pittsburgh
    • S. Lawrence Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement) Technical report, Graduate School of Industrial Administration 1984 Carnegie Mellon University Pittsburgh
    • (1984) Technical Report, Graduate School of Industrial Administration
    • Lawrence, S.1
  • 22
    • 0023977010 scopus 로고
    • The shifting bottleneck procedure for job shop scheduling
    • J. Adams, E. Balas, and D. Zawack The shifting bottleneck procedure for job shop scheduling Manage Sci 34 3 1988 391 401
    • (1988) Manage Sci , vol.34 , Issue.3 , pp. 391-401
    • Adams, J.1    Balas, E.2    Zawack, D.3
  • 23
    • 85009519975 scopus 로고    scopus 로고
    • http://www.lsi.upc.es/~cblum/.


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