메뉴 건너뛰기




Volumn 16, Issue 10, 2000, Pages 765-771

Tabu search algorithm for job shop scheduling

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC METHODS; SIMULATED ANNEALING;

EID: 0033699671     PISSN: 02683768     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001700070030     Document Type: Article
Times cited : (62)

References (17)
  • 6
    • 0030192702 scopus 로고    scopus 로고
    • A tabu search procedure for periodic jobshop scheduling
    • Ju-Seog Song and Tae-Eog Lee, "A tabu search procedure for periodic jobshop scheduling", Computers and Industrial Engineering, 30(3), pp. 433-447, 1996.
    • (1996) Computers and Industrial Engineering , vol.30 , Issue.3 , pp. 433-447
    • Song, J.-S.1    Lee, T.-E.2
  • 7
    • 0032114780 scopus 로고    scopus 로고
    • A composite heuristic for the single machine early/tardy job scheduling problem
    • Maria Teresa Almedia and Mario Centeno, "A composite heuristic for the single machine early/tardy job scheduling problem", Computers and Operations Research, 25(7/8), pp. 625-635, 1998.
    • (1998) Computers and Operations Research , vol.25 , Issue.7-8 , pp. 625-635
    • Almedia, M.T.1    Centeno, M.2
  • 8
    • 0032022574 scopus 로고    scopus 로고
    • Improving job-shop scheduling through critical pairwise exchanges
    • C. Chu, J. M. Proth and C. Wang, "Improving job-shop scheduling through critical pairwise exchanges", International Journal of Production Research, 36(3), pp. 683-694, 1998.
    • (1998) International Journal of Production Research , vol.36 , Issue.3 , pp. 683-694
    • Chu, C.1    Proth, J.M.2    Wang, C.3
  • 9
    • 0029288391 scopus 로고
    • Solving johshop scheduling problem with tabu search
    • W. Barnes and J. B. Chambers, "Solving johshop scheduling problem with tabu search", IIE Transactions, 27, pp. 257-263, 1995.
    • (1995) IIE Transactions , vol.27 , pp. 257-263
    • Barnes, W.1    Chambers, J.B.2
  • 10
    • 0027872654 scopus 로고
    • Two-stage heuristic procedure for scheduling job shops
    • R. Vancheeswaran and M. A. Townsend,. "Two-stage heuristic procedure for scheduling job shops", Journal of Manufacturing Systems, 12(4), pp. 315-325, 1995.
    • (1995) Journal of Manufacturing Systems , vol.12 , Issue.4 , pp. 315-325
    • Vancheeswaran, R.1    Townsend, M.A.2
  • 11
    • 0001251144 scopus 로고
    • Job-shop scheduling: Computational study of local search and large-step optimisation methods
    • Helena Ramalhinho Lourenco, "Job-shop scheduling: Computational study of local search and large-step optimisation methods", European Journal of Operational Research, 83, pp. 347-364, 1995.
    • (1995) European Journal of Operational Research , vol.83 , pp. 347-364
    • Lourenco, H.R.1
  • 12
    • 0031102683 scopus 로고    scopus 로고
    • Using tabu search to solve the common due date early/tardy machine scheduling problem
    • R. J. W. James, "Using tabu search to solve the common due date early/tardy machine scheduling problem", Computers and Operations Research, 24(3), pp. 199-208, 1997.
    • (1997) Computers and Operations Research , vol.24 , Issue.3 , pp. 199-208
    • James, R.J.W.1
  • 13
    • 0030143260 scopus 로고    scopus 로고
    • A comparison of neighbourhood search techniques for multi-objective combinatorial problems
    • Richard Marett and Mike Wright, "A comparison of neighbourhood search techniques for multi-objective combinatorial problems", Computers and Operations Research, 23(5), pp. 465-483, 1996.
    • (1996) Computers and Operations Research , vol.23 , Issue.5 , pp. 465-483
    • Marett, R.1    Wright, M.2
  • 17
    • 0343352754 scopus 로고    scopus 로고
    • Internet address: www.mscmga.ms.ic.ac.uk.


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