메뉴 건너뛰기




Volumn 2, Issue 4, 2007, Pages 531-537

A tabu search algorithm for job shop scheduling problem with industrial scheduling case study

Author keywords

Algorithm; Combinatorial optimisation; Job shop scheduling; Manufacturing industry; Tabu search

Indexed keywords


EID: 77953207802     PISSN: 18169503     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (9)

References (15)
  • 1
    • 0342592297 scopus 로고    scopus 로고
    • Tabu search for minimizing total tardiness in a job shop
    • Armentano, V.A. and C.R. Scrich, 2000. Tabu search for minimizing total tardiness in a job shop. Int. J. Prod. Econ.,63: 131-140.
    • (2000) Int. J. Prod. Econ. , vol.63 , pp. 131-140
    • Armentano, V.A.1    Scrich, C.R.2
  • 2
    • 0029288391 scopus 로고
    • Solving the Job shop Scheduling Problem with Tabu Search
    • Barnes, W.J. and J.B. Chambers, 1995. Solving the Job shop Scheduling Problem with Tabu Search. IEEE. Trans., 27: 257-263.
    • (1995) IEEE. Trans. , vol.27 , pp. 257-263
    • Barnes, W.J.1    Chambers, J.B.2
  • 3
    • 0032022574 scopus 로고    scopus 로고
    • Improving job-shop schedules through critical pairwise exchanges
    • Chu, C., J.M. Proth and C. Wang, 1998. Improving job-shop schedules through critical pairwise exchanges. Int. J. Prod. Res., 36: 683- 694.
    • (1998) Int. J. Prod. Res. , vol.36
    • Chu, C.1    Proth, J.M.2    Wang, C.3
  • 4
    • 0042261208 scopus 로고    scopus 로고
    • An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
    • Dauzere-Peres, S. and Jan J. Paulli, 1997. An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. Ann. Operations Res., 70: 281-306.
    • (1997) Ann. Operations Res. , vol.70 , pp. 281-306
    • Dauzere-Peres, S.1    Paulli, J.J.2
  • 5
    • 3142732812 scopus 로고    scopus 로고
    • The Strategies and Parameters of Tabu Search for Job Shop Scheduling
    • Geyik, F. and I.H. Cedimoglu, 2004. The Strategies and Parameters of Tabu Search for Job Shop Scheduling. J. Intelligent Manufacturing, 15: 439-448.
    • (2004) J. Intelligent Manufacturing , vol.15 , pp. 439-448
    • Geyik, F.1    Cedimoglu, I.H.2
  • 6
    • 0000411214 scopus 로고
    • Tabu Search-Part I, Operations Research Society of America
    • Glover, F., 1989. Tabu Search-Part I, Operations Research Society of America. J. Comput., 1: 190-206.
    • (1989) J. Comput. , vol.1 , pp. 190-206
    • Glover, F.1
  • 8
    • 0034269642 scopus 로고    scopus 로고
    • New and Stronger Job-Shop Neighbourhoods: A focus on the method of Nowicki and Smutnicki
    • Jain, A.S., B. Rangaswamy and S. Meeran, 2000. New and Stronger Job-Shop Neighbourhoods: A focus on the method of Nowicki and Smutnicki. J. Heuristics, 6: 457-480.
    • (2000) J. Heuristics , vol.6 , pp. 457-480
    • Jain, A.S.1    Rangaswamy, B.2    Meeran, S.3
  • 9
    • 0026461248 scopus 로고
    • Job Shop Scheduling by Simulated Annealing
    • Laarhoven, V.P., E. Aarts and J. Lenstra, 1992. Job Shop Scheduling by Simulated Annealing, Operations Res., 40: 113-125.
    • (1992) Operations Res , vol.40 , pp. 113-125
    • Laarhoven, V.P.1    Aarts, E.2    Lenstra, J.3
  • 10
    • 5244278595 scopus 로고    scopus 로고
    • A Fast Taboo Search Algorithm for the Job Shop Problem
    • Nowicki, E. and C. Smutnicki, 1996. A Fast Taboo Search Algorithm for the Job Shop Problem. Manage. Sci., 42: 797-813.
    • (1996) Manage. Sci. , vol.42 , pp. 797-813
    • Nowicki, E.1    Smutnicki, C.2
  • 11
    • 17444396374 scopus 로고    scopus 로고
    • An Advanced Tabu Search Algorithm for the Job Shop Problem
    • Nowicki, E. and C. Smutnicki, 2005. An Advanced Tabu Search Algorithm for the Job Shop Problem. J. Scheduling, 8: 145-159.
    • (2005) J. Scheduling , vol.8 , pp. 145-159
    • Nowicki, E.1    Smutnicki, C.2
  • 12
    • 0033894498 scopus 로고    scopus 로고
    • A Tabu Search Method guided by Shifting Bottleneck for the Job Shop Scheduling Problem
    • Pezzella, F. andE. Merelli, 2000. A Tabu Search Method guided by Shifting Bottleneck for the Job Shop Scheduling Problem. Eur. J. Operational Res., 120: 297-310.
    • (2000) Eur. J. Operational Res. , vol.120 , pp. 297-310
    • Pezzella, F.1    Merelli, E.2
  • 14
    • 0000892122 scopus 로고
    • Parallel Taboo Search Techniques for the Job Shop Scheduling Problem, ORSA
    • Taillard, D., 1994. Parallel Taboo Search Techniques for the Job Shop Scheduling Problem, ORSA. J. Comput., 6: 108-116.
    • (1994) J. Comput. , vol.6 , pp. 108-116
    • Taillard, D.1


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