메뉴 건너뛰기




Volumn 39, Issue 9-10, 2008, Pages 965-974

An effective hybrid genetic algorithm for the job shop scheduling problem

Author keywords

Crossover operator; Genetic algorithm; Job shop scheduling problem; Local search

Indexed keywords

ALGORITHMS; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; MACHINE SHOPS; NUCLEAR PROPULSION; SCHEDULING;

EID: 55649092878     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-007-1354-8     Document Type: Article
Times cited : (89)

References (22)
  • 2
    • 34249754216 scopus 로고
    • A generalized permutation approach to job shop scheduling with genetic algorithms
    • C Bierwirth 1995 A generalized permutation approach to job shop scheduling with genetic algorithms OR Spektrum 17 87 92
    • (1995) OR Spektrum , vol.17 , pp. 87-92
    • Bierwirth, C.1
  • 3
    • 0029224911 scopus 로고
    • A genetic algorithm for the job shop problem
    • 1
    • FD Croce R Tadei G Volta 1995 A genetic algorithm for the job shop problem Comput Oper Res 22 1 15 24
    • (1995) Comput Oper Res , vol.22 , pp. 15-24
    • Croce, F.D.1    Tadei, R.2    Volta, G.3
  • 4
    • 0026461248 scopus 로고
    • Job shop scheduling by simulated annealing
    • 1
    • PV Laarhoven E Aarts JK Lenstra 1992 Job shop scheduling by simulated annealing Oper Res 40 1 113 125
    • (1992) Oper Res , vol.40 , pp. 113-125
    • Laarhoven, P.V.1    Aarts, E.2    Lenstra, J.K.3
  • 5
    • 0000892122 scopus 로고
    • Parallel taboo search techniques for the job-shop scheduling problem
    • 2
    • ED Taillard 1994 Parallel taboo search techniques for the job-shop scheduling problem ORSA J Comput 6 2 108 117
    • (1994) ORSA J Comput , vol.6 , pp. 108-117
    • Taillard, E.D.1
  • 6
    • 5244278595 scopus 로고    scopus 로고
    • A fast taboo search algorithm for the job shop problem
    • 6
    • E Nowicki C Smutnicki 1996 A fast taboo search algorithm for the job shop problem Manag Sci 42 6 797 813
    • (1996) Manag Sci , vol.42 , pp. 797-813
    • Nowicki, E.1    Smutnicki, C.2
  • 7
    • 0033102020 scopus 로고    scopus 로고
    • Deterministic job-shop scheduling:Past,present and future
    • AS Jain S Meeran 1999 Deterministic job-shop scheduling:Past,present and future Eur J Oper Res 113 390 434
    • (1999) Eur J Oper Res , vol.113 , pp. 390-434
    • Jain, A.S.1    Meeran, S.2
  • 8
    • 0030212629 scopus 로고    scopus 로고
    • The job shop scheduling problem: Conventional and new solution techniques
    • J Blazewicz W Domschke E Pesch 1996 The job shop scheduling problem: Conventional and new solution techniques Eur J Oper Res 93 1 33
    • (1996) Eur J Oper Res , vol.93 , pp. 1-33
    • Blazewicz, J.1    Domschke, W.2    Pesch, E.3
  • 9
    • 0031236881 scopus 로고    scopus 로고
    • Degree of population diversity -a perspective on premature convergence in genetic algorithms and its Markov-chain analysis
    • 5
    • Y Leung Y Gao ZB Xu 1997 Degree of population diversity -a perspective on premature convergence in genetic algorithms and its Markov-chain analysis IEEE Trans Neural Netw 8 5 1165 1176
    • (1997) IEEE Trans Neural Netw , vol.8 , pp. 1165-1176
    • Leung, Y.1    Gao, Y.2    Xu, Z.B.3
  • 10
    • 0032592184 scopus 로고    scopus 로고
    • A tutorial survey of job shop scheduling problems using genetic algorithms, part II: Hybrid genetic search strategies
    • R Cheng M Gen Y Tsujimura 1999 A tutorial survey of job shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies Comput Ind Eng 36 343 364
    • (1999) Comput Ind Eng , vol.36 , pp. 343-364
    • Cheng, R.1    Gen, M.2    Tsujimura, Y.3
  • 15
    • 0030242695 scopus 로고    scopus 로고
    • A tutorial survey of job-shop scheduling problems using genetic algorithms -I. representation
    • 9
    • R Cheng M Gen Y Tsujimura 1996 A tutorial survey of job-shop scheduling problems using genetic algorithms -I. representation Comput Ind Eng 30 9 83 97
    • (1996) Comput Ind Eng , vol.30 , pp. 83-97
    • Cheng, R.1    Gen, M.2    Tsujimura, Y.3
  • 16
    • 0034269642 scopus 로고    scopus 로고
    • New and "stronger" job-shop neighborhoods: A focus on the method of Nowicki and Smutnicki (1996)
    • AS Jain B Rangaswamy S Meeran 2000 New and "stronger" job-shop neighborhoods: A focus on the method of Nowicki and Smutnicki (1996) Journal of Heuristics 6 457 480
    • (2000) Journal of Heuristics , vol.6 , pp. 457-480
    • Jain, A.S.1    Rangaswamy, B.2    Meeran, S.3
  • 17
    • 4344575427 scopus 로고    scopus 로고
    • A hybrid genetic algorithm for the job sShop scheduling problem
    • optimization-online.org/DB_FILE/2002/09/538.pdf
    • Gonçalves JF and et al (2002) A hybrid genetic algorithm for the job sShop scheduling problem. AT&T Labs Research Technical Report, doi: optimization-online.org/DB_FILE/2002/09/538.pdf
    • (2002) AT&T Labs Research Technical Report
    • Gonçalves, J.F.1    Al, E.2
  • 20
    • 0037379102 scopus 로고    scopus 로고
    • Parallel GRASP with path-relinking for job shop scheduling
    • RM Aiex S Binato MGC Resende 2003 Parallel GRASP with path-relinking for job shop scheduling Parallel Comput 29 393 430
    • (2003) Parallel Comput , vol.29 , pp. 393-430
    • Aiex, R.M.1    Binato, S.2    Resende, M.G.C.3
  • 21
    • 0033894498 scopus 로고    scopus 로고
    • A tabu search method guided by shifting bottleneck for the job shop scheduling problem
    • F Pezzella E Merelli 2000 A tabu search method guided by shifting bottleneck for the job shop scheduling problem Eur J Oper Res 120 297 310
    • (2000) Eur J Oper Res , vol.120 , pp. 297-310
    • Pezzella, F.1    Merelli, E.2
  • 22
    • 0031997369 scopus 로고    scopus 로고
    • Guided local search with shifting bottleneck for job-shop scheduling
    • 2
    • E Balas A Vazacopoulos 1998 Guided local search with shifting bottleneck for job-shop scheduling Manag Sci 44 2 262 275
    • (1998) Manag Sci , vol.44 , pp. 262-275
    • Balas, E.1    Vazacopoulos, A.2


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