메뉴 건너뛰기




Volumn 61, Issue 4, 2010, Pages 611-619

A modified tabu search algorithm for cost-based job shop problem

Author keywords

Cost based problem; Filter structure; Job shop problem; Memory structure; Neighbourhood structure; Tabu search

Indexed keywords

ITERATIVE METHODS; JUST IN TIME PRODUCTION; TABU SEARCH;

EID: 77949432425     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2009.9     Document Type: Article
Times cited : (10)

References (24)
  • 1
    • 0023977010 scopus 로고
    • The shifting bottleneck procedure for job shop scheduling
    • Adams J, Balas E and Zawack D (1988). The shifting bottleneck procedure for job shop scheduling. Mngt Sci 34: 391-401.
    • (1988) Mngt Sci , vol.34 , pp. 391-401
    • Adams, J.1    Balas, E.2    Zawack, D.3
  • 2
    • 0002381223 scopus 로고
    • Machine scheduling via disjunctive graphs: An implicit enumeration algorithm
    • Balas E (1969). Machine scheduling via disjunctive graphs: An implicit enumeration algorithm. Opns Res 17: 941-957.
    • (1969) Opns Res , vol.17 , pp. 941-957
    • Balas, E.1
  • 3
    • 56449107505 scopus 로고
    • OR-library: Distributing test problems by electronic mail
    • Beasley J (1990). OR-library: Distributing test problems by electronic mail. J Opl Res Soc 41: 1069-1072. http://people.brunel.ac.uk/~mastjjb/jeb/info. html.
    • (1990) J Opl Res Soc , vol.41 , pp. 1069-1072
    • Beasley, J.1
  • 4
    • 0020013653 scopus 로고
    • A state-of-the-art survey of dispatching rules for manufacturing job shop operations
    • Blackstone JHJ, Phillips DT and Hogg GL (1982). A state-of-the-art survey of dispatching rules for manufacturing job shop operations. Int J Prod Res 20: 27-45.
    • (1982) Int J Prod Res , vol.20 , pp. 27-45
    • Blackstone, J.H.J.1    Phillips, D.T.2    Hogg, G.L.3
  • 5
    • 26644446942 scopus 로고    scopus 로고
    • Minimizing total weighted tardiness in a generalized job shop
    • De Bontridder K (2005). Minimizing total weighted tardiness in a generalized job shop. J Scheduling 8: 479-496.
    • (2005) J Scheduling , vol.8 , pp. 479-496
    • De Bontridder, K.1
  • 6
    • 0016929914 scopus 로고
    • Due dates in job shop scheduling
    • Eilon S and Chowdhury IG (1976). Due dates in job shop scheduling. Int J Prod Res 14: 223-237.
    • (1976) Int J Prod Res , vol.14 , pp. 223-237
    • Eilon, S.1    Chowdhury, I.G.2
  • 8
    • 0000411214 scopus 로고
    • Tabu search-part i
    • Glover F (1989). Tabu search-part i. ORSA J Comput 1: 193-200.
    • (1989) ORSA J Comput , vol.1 , pp. 193-200
    • Glover, F.1
  • 10
    • 0031103522 scopus 로고    scopus 로고
    • A tabu search-based approach for scheduling job-shop type flexible manufacturing systems
    • Logendran R and Sonthinen A (1997). A tabu search-based approach for scheduling job-shop type flexible manufacturing systems. J Opl Res Soc 48: 264-277.
    • (1997) J Opl Res Soc , vol.48 , pp. 264-277
    • Logendran, R.1    Sonthinen, A.2
  • 12
    • 33845805156 scopus 로고    scopus 로고
    • Performance evaluation of priority dispatching rules in multi-level assembly job shops with jobs having weights for flowtime and tardiness
    • Natarajan K, Mohanasundaram K, Babu BS, Suresh S, Raj KAAD and Rajendran C (2007). Performance evaluation of priority dispatching rules in multi-level assembly job shops with jobs having weights for flowtime and tardiness. Int J Adv Manuf Technol 31: 751-761.
    • (2007) Int J Adv Manuf Technol , vol.31 , pp. 751-761
    • Natarajan, K.1    Mohanasundaram, K.2    Babu, B.S.3    Suresh, S.4    Raj, K.A.A.D.5    Rajendran, C.6
  • 13
    • 5244278595 scopus 로고    scopus 로고
    • A fast taboo search algorithm for the job shop problem
    • Nowicki E and Smutnicki C (1996). A fast taboo search algorithm for the job shop problem. Mngt Sci 42: 797-813.
    • (1996) Mngt Sci , vol.42 , pp. 797-813
    • Nowicki, E.1    Smutnicki, C.2
  • 14
    • 17444396374 scopus 로고    scopus 로고
    • An advanced tabu search algorithm for the job shop problem
    • Nowicki E and Smutnicki C (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
  • 16
    • 0033079535 scopus 로고    scopus 로고
    • A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop
    • Pinedo M and Singer M (1999). A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. Nav Res Logist 46: 1-17.
    • (1999) Nav Res Logist , vol.46 , pp. 1-17
    • Pinedo, M.1    Singer, M.2
  • 17
    • 1042289055 scopus 로고    scopus 로고
    • Tardiness minimization in a flexible job shop: A tabu search approach
    • Scrich C, Armentano V and Laguna M (2004). Tardiness minimization in a flexible job shop: A tabu search approach. J Intell Manuf 15: 103-115.
    • (2004) J Intell Manuf , vol.15 , pp. 103-115
    • Scrich, C.1    Armentano, V.2    Laguna, M.3
  • 18
    • 0000892122 scopus 로고
    • Parallel taboo search techniques for the job shop scheduling problem
    • Taillard ED (1994). Parallel taboo search techniques for the job shop scheduling problem. ORSA J Comput 6: 108-117.
    • (1994) ORSA J Comput , vol.6 , pp. 108-117
    • Taillard, E.D.1
  • 19
    • 0344152920 scopus 로고    scopus 로고
    • Scheduling in dynamic assembly job shops with jobs having different holding and tardiness costs
    • Thiagarajan S and Rajendran C (2003). Scheduling in dynamic assembly job shops with jobs having different holding and tardiness costs. Int J Prod Res 41: 4453-4483.
    • (2003) Int J Prod Res , vol.41 , pp. 4453-4483
    • Thiagarajan, S.1    Rajendran, C.2
  • 20
    • 28044452691 scopus 로고    scopus 로고
    • Scheduling in dynamic assembly job-shops to minimize the sum of weighted earliness, weighted tardiness and weighted flowtime of jobs
    • Thiagarajan S and Rajendran C (2005). Scheduling in dynamic assembly job-shops to minimize the sum of weighted earliness, weighted tardiness and weighted flowtime of jobs. Comput Ind Eng 49: 463-503.
    • (2005) Comput Ind Eng , vol.49 , pp. 463-503
    • Thiagarajan, S.1    Rajendran, C.2
  • 22
    • 0023399009 scopus 로고
    • Priority rules for job shops with weighted tardiness costs
    • Vepsalainen APJ and Morton TE (1987). Priority rules for job shops with weighted tardiness costs. Mngt Sci 33: 1035-1047.
    • (1987) Mngt Sci , vol.33 , pp. 1035-1047
    • Vepsalainen, A.P.J.1    Morton, T.E.2
  • 23
    • 0037302910 scopus 로고    scopus 로고
    • Problem difficulty for tabu search in job shop scheduling
    • Watson JP, Beck JC, Howe AE and Whitley LD (2003). Problem difficulty for tabu search in job shop scheduling. Artif Intell 143: 189-217.
    • (2003) Artif Intell , vol.143 , pp. 189-217
    • Watson, J.P.1    Beck, J.C.2    Howe, A.E.3    Whitley, L.D.4
  • 24
    • 30844442595 scopus 로고    scopus 로고
    • Deconstructing Nowicki and Smutnicki's i-TSAB tabu search algorithm for the job-shop scheduling problem
    • Watson JP, Howe AE and Whitley LD (2006). Deconstructing Nowicki and Smutnicki's i-TSAB tabu search algorithm for the job-shop scheduling problem. Comput Opns Res 33: 2623-2644.
    • (2006) Comput Opns Res , vol.33 , pp. 2623-2644
    • Watson, J.P.1    Howe, A.E.2    Whitley, L.D.3


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