메뉴 건너뛰기




Volumn 36, Issue 2 PART 2, 2009, Pages 3857-3865

An experienced learning genetic algorithm to solve the single machine total weighted tardiness scheduling problem

Author keywords

Exponential smoothing method; Genetic algorithm; Total weighted tardiness

Indexed keywords

CHROMOSOMES; GENETIC ALGORITHMS; JOB SHOP SCHEDULING; SCHEDULING ALGORITHMS;

EID: 56349084087     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2008.02.040     Document Type: Article
Times cited : (34)

References (24)
  • 1
    • 0032045130 scopus 로고    scopus 로고
    • A new lower bounding scheme for the total weighted tardiness problem
    • Akturk M.S., and Yildirim M.B. A new lower bounding scheme for the total weighted tardiness problem. Computers and Operations Research 25 4 (1998) 265-278
    • (1998) Computers and Operations Research , vol.25 , Issue.4 , pp. 265-278
    • Akturk, M.S.1    Yildirim, M.B.2
  • 2
    • 0037694027 scopus 로고    scopus 로고
    • A problem space algorithm for single machine weighted tardiness problems
    • Avci S., Akturk M.S., and Storer R.H. A problem space algorithm for single machine weighted tardiness problems. IIE Transactions 35 (2003) 479-486
    • (2003) IIE Transactions , vol.35 , pp. 479-486
    • Avci, S.1    Akturk, M.S.2    Storer, R.H.3
  • 3
    • 3042716051 scopus 로고    scopus 로고
    • A branch and bound algorithm to minimize total weighted tardiness on a single processor
    • Babu P., Peridy L., and Pinson E. A branch and bound algorithm to minimize total weighted tardiness on a single processor. Annals of Operations Research 129 (2004) 33-46
    • (2004) Annals of Operations Research , vol.129 , pp. 33-46
    • Babu, P.1    Peridy, L.2    Pinson, E.3
  • 4
    • 33750011412 scopus 로고    scopus 로고
    • A tabu search algorithm for the single machine total weighted tardiness problem
    • Bilge U., Kurtulan M., and Kirac F. A tabu search algorithm for the single machine total weighted tardiness problem. European Journal of Operational Research 176 (2007) 1423-1435
    • (2007) European Journal of Operational Research , vol.176 , pp. 1423-1435
    • Bilge, U.1    Kurtulan, M.2    Kirac, F.3
  • 5
    • 0013238227 scopus 로고    scopus 로고
    • An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
    • Congram R.K., Potts C.N., and Van de Velde S.L. An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS Journal on Computing 14 1 (2002) 52-67
    • (2002) INFORMS Journal on Computing , vol.14 , Issue.1 , pp. 52-67
    • Congram, R.K.1    Potts, C.N.2    Van de Velde, S.L.3
  • 6
    • 0001234583 scopus 로고    scopus 로고
    • Local search heuristics for single machine total weighted tardiness scheduling problem
    • Crauwels H.A.J., Potts C.N., and Van Wassenhove L.N. Local search heuristics for single machine total weighted tardiness scheduling problem. INFORMS Journal on Computing 10 3 (1998) 341-350
    • (1998) INFORMS Journal on Computing , vol.10 , Issue.3 , pp. 341-350
    • Crauwels, H.A.J.1    Potts, C.N.2    Van Wassenhove, L.N.3
  • 7
    • 0142029539 scopus 로고    scopus 로고
    • An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
    • Grosso A., Della Croce F., and Tadei R. An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem. Operations Research Letters 32 (2004) 68-72
    • (2004) Operations Research Letters , vol.32 , pp. 68-72
    • Grosso, A.1    Della Croce, F.2    Tadei, R.3
  • 9
    • 0031222081 scopus 로고    scopus 로고
    • A performance comparison of heuristics for the total weighted tardiness problem
    • Huegler P.A., and Vasko F.J. A performance comparison of heuristics for the total weighted tardiness problem. Computers and Industrial Engineering 32 4 (1997) 753-767
    • (1997) Computers and Industrial Engineering , vol.32 , Issue.4 , pp. 753-767
    • Huegler, P.A.1    Vasko, F.J.2
  • 10
    • 3042836706 scopus 로고    scopus 로고
    • A weighted modified due date rule for sequencing to minimize weighted tardiness
    • Kanet J.J., and Li X. A weighted modified due date rule for sequencing to minimize weighted tardiness. Journal of Scheduling 7 (2004) 261-276
    • (2004) Journal of Scheduling , vol.7 , pp. 261-276
    • Kanet, J.J.1    Li, X.2
  • 12
    • 56349116996 scopus 로고    scopus 로고
    • Madureira, A., Ramos, C., & Sliva, S.d.C. (2001). A GA based scheduling system for dynamic single machine problem. In Proceeding of the 4th IEEE international symbosium on assembly and task planning soft research park (pp. 28-129). Japan.
    • Madureira, A., Ramos, C., & Sliva, S.d.C. (2001). A GA based scheduling system for dynamic single machine problem. In Proceeding of the 4th IEEE international symbosium on assembly and task planning soft research park (pp. 28-129). Japan.
  • 13
    • 27544441566 scopus 로고    scopus 로고
    • An intensive search evolutionary algorithm for single-machine total-weighted-tardiness scheduling problems
    • Maheswaran R., and Ponnambalam S.G. An intensive search evolutionary algorithm for single-machine total-weighted-tardiness scheduling problems. International Journal of Advanced Manufacturing Technology 26 (2005) 1150-1156
    • (2005) International Journal of Advanced Manufacturing Technology , vol.26 , pp. 1150-1156
    • Maheswaran, R.1    Ponnambalam, S.G.2
  • 16
    • 56349094093 scopus 로고    scopus 로고
    • Morton, T.E., Rachamadugu, R.M., & Vepsalainen, A., (1984). Accurate myopic heuristics for tardiness scheduling. GSIA Working Paper No. 36-83-84. Pitsburgh: Carnegie-Mellon University.
    • Morton, T.E., Rachamadugu, R.M., & Vepsalainen, A., (1984). Accurate myopic heuristics for tardiness scheduling. GSIA Working Paper No. 36-83-84. Pitsburgh: Carnegie-Mellon University.
  • 18
    • 0022023671 scopus 로고
    • A branch and bound algorithm for the total weighted tardiness problem
    • Potts C.N., and Van Wassenhove L.N. A branch and bound algorithm for the total weighted tardiness problem. Operations Research 33 (1985) 363-377
    • (1985) Operations Research , vol.33 , pp. 363-377
    • Potts, C.N.1    Van Wassenhove, L.N.2
  • 19
    • 84912978525 scopus 로고
    • Single machine tardiness sequencing heuristics
    • Potts C.N., and Van Wassenhove L.N. Single machine tardiness sequencing heuristics. IIE Transactions 23 (1991) 346-354
    • (1991) IIE Transactions , vol.23 , pp. 346-354
    • Potts, C.N.1    Van Wassenhove, L.N.2
  • 21
    • 0017972181 scopus 로고
    • Dynamic programming solution for sequencing problems with precedence constraints
    • Schrage L., and Baker K.R. Dynamic programming solution for sequencing problems with precedence constraints. Operations Research 26 (1978) 444-449
    • (1978) Operations Research , vol.26 , pp. 444-449
    • Schrage, L.1    Baker, K.R.2
  • 23
    • 33749545539 scopus 로고    scopus 로고
    • Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem
    • Tasgetiren M.F., Liang Y.C., Sevkli M., and Gencyilmaz G. Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem. International Journal of Production Research 44 (2006) 4737-4754
    • (2006) International Journal of Production Research , vol.44 , pp. 4737-4754
    • Tasgetiren, M.F.1    Liang, Y.C.2    Sevkli, M.3    Gencyilmaz, G.4
  • 24
    • 0036778940 scopus 로고    scopus 로고
    • A genetic algorithm to minimize maximum lateness on a batch processing machine
    • Wang C.S., and Uzsoy R. A genetic algorithm to minimize maximum lateness on a batch processing machine. Computers & Operations Research 29 (2002) 1621-1640
    • (2002) Computers & Operations Research , vol.29 , pp. 1621-1640
    • Wang, C.S.1    Uzsoy, R.2


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