메뉴 건너뛰기




Volumn 4, Issue , 2012, Pages 25-32

A swarm intelligence approach to the early/tardy scheduling problem

Author keywords

Artificial bee colony algorithm; Constrained optimization; Early tardy scheduling; Heuristic; Swarm intelligence

Indexed keywords

ABC ALGORITHMS; ARTIFICIAL BEE COLONIES; ARTIFICIAL BEE COLONY ALGORITHMS; COMPUTATIONAL RESULTS; EARLY/TARDY SCHEDULING; EARLY/TARDY SCHEDULING PROBLEM; HEURISTIC; HEURISTIC APPROACH; LOCAL SEARCH; MACHINE IDLE; SWARM INTELLIGENCE;

EID: 84858447444     PISSN: 22106502     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.swevo.2011.12.002     Document Type: Article
Times cited : (38)

References (30)
  • 2
    • 78650661928 scopus 로고    scopus 로고
    • A hybrid permutation-coded evolutionary algorithm for the early/tardy scheduling problem
    • A. Singh A hybrid permutation-coded evolutionary algorithm for the early/tardy scheduling problem Asia-Pacific Journal of Operational Research 27 2010 713 725
    • (2010) Asia-Pacific Journal of Operational Research , vol.27 , pp. 713-725
    • Singh, A.1
  • 4
    • 13844249320 scopus 로고
    • A pressing matter
    • K. Korman A pressing matter Video 1994 46 50
    • (1994) Video , pp. 46-50
    • Korman, K.1
  • 5
    • 84858449044 scopus 로고
    • Group technology and cellular manufacturing in the Westvaco Los Angeles VH department
    • University of Southern California
    • K. Landis, Group technology and cellular manufacturing in the Westvaco Los Angeles VH department, Project Report in IOM 581, School of Business, University of Southern California, 1993.
    • (1993) Project Report in IOM 581, School of Business
    • Landis, K.1
  • 7
    • 0031076201 scopus 로고
    • Single machine earliness and tardiness scheduling
    • G. Li Single machine earliness and tardiness scheduling European Journal of Operational Research 96 1977 546 558
    • (1977) European Journal of Operational Research , vol.96 , pp. 546-558
    • Li, G.1
  • 8
    • 0033165933 scopus 로고    scopus 로고
    • A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
    • C.F. Liaw A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem Computers & Operations Research 26 1999 679 693
    • (1999) Computers & Operations Research , vol.26 , pp. 679-693
    • Liaw, C.F.1
  • 9
    • 17644417123 scopus 로고    scopus 로고
    • Improved lower bounds for the early/tardy scheduling problem with no idle time
    • DOI 10.1057/palgrave.jors.2601865
    • J.M.S. Valente, and R.A.F.S. Alves Improved lower bounds for the early/tardy scheduling problem with no idle time Journal of the Operational Research Society 56 2005 604 612 (Pubitemid 40567546)
    • (2005) Journal of the Operational Research Society , vol.56 , Issue.5 , pp. 604-612
    • Valente, J.M.S.1    Alves, R.A.F.S.2
  • 11
    • 0000245614 scopus 로고
    • The single machine early-tardy problem
    • P.S. Ow, and T.E. Morton The single machine early-tardy problem Management Sciences 35 1989 177 191
    • (1989) Management Sciences , vol.35 , pp. 177-191
    • Ow, P.S.1    Morton, T.E.2
  • 12
    • 4744370447 scopus 로고    scopus 로고
    • Improved heuristics for the early/tardy scheduling problem with no idle time
    • J.M.S. Valente, and R.A.F.S. Alves Improved heuristics for the early/tardy scheduling problem with no idle time Computers & Operations Research 32 2005 557 569
    • (2005) Computers & Operations Research , vol.32 , pp. 557-569
    • Valente, J.M.S.1    Alves, R.A.F.S.2
  • 13
    • 0001096735 scopus 로고
    • Genetic algorithms and random keys for sequencing and optimization
    • J.C. Bean Genetic algorithms and random keys for sequencing and optimization ORSA Journal of Computing 6 1994 154 160
    • (1994) ORSA Journal of Computing , vol.6 , pp. 154-160
    • Bean, J.C.1
  • 16
    • 56749104341 scopus 로고    scopus 로고
    • A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
    • M.F. Tasgetiren, Q.-K. Pan, and Y.C. Liang A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times Computers & Operations Research 36 2009 1900 1915
    • (2009) Computers & Operations Research , vol.36 , pp. 1900-1915
    • Tasgetiren, M.F.1    Pan, Q.-K.2    Liang, Y.C.3
  • 17
    • 35148827874 scopus 로고    scopus 로고
    • An idea based on honey bee swarm for numerical optimization
    • Computer Engineering Department, Erciyes University, Turkey
    • D. Karaboga, An idea based on honey bee swarm for numerical optimization, Technical Report TR06, Computer Engineering Department, Erciyes University, Turkey, 2005.
    • (2005) Technical Report TR06
    • Karaboga, D.1
  • 18
    • 37249039513 scopus 로고    scopus 로고
    • An Artificial bee colony (ABC) algorithm for numeric function optimization
    • Indianapolis, In, USA
    • B. Basturk, D. Karaboga, An Artificial bee colony (ABC) algorithm for numeric function optimization, in: Proceeding of the IEEE Swarm Intelligence Symposium, Indianapolis, In, USA, 2006.
    • (2006) Proceeding of the IEEE Swarm Intelligence Symposium
    • Basturk, B.1    Karaboga, D.2
  • 19
    • 35148821762 scopus 로고    scopus 로고
    • A powerful and efficient algorithm for numerical function optimization: Artificial bee colony (ABC) algorithm
    • DOI 10.1007/s10898-007-9149-x
    • D. Karaboga, and B. Basturk A powerful and efficient algorithm for numerical function optimization: Artificial Bee Colony (ABC) algorithm Journal of Global Optimization 39 2007 459 471 (Pubitemid 47551831)
    • (2007) Journal of Global Optimization , vol.39 , Issue.3 , pp. 459-471
    • Karaboga, D.1    Basturk, B.2
  • 21
    • 34548479029 scopus 로고    scopus 로고
    • On the performance of artificial bee colony (ABC) algorithm
    • DOI 10.1016/j.asoc.2007.05.007, PII S1568494607000531
    • D. Karaboga, and B. Basturk On the performance of Artificial Bee Colony (ABC) algorithm Applied Soft Computing 8 2008 687 697 (Pubitemid 47374599)
    • (2008) Applied Soft Computing Journal , vol.8 , Issue.1 , pp. 687-697
    • Karaboga, D.1    Basturk, B.2
  • 22
    • 58549117667 scopus 로고    scopus 로고
    • An Artificial Bee Colony algorithm for the leaf-constrained minimum spanning tree problem
    • A. Singh An Artificial Bee Colony algorithm for the leaf-constrained minimum spanning tree problem Applied Soft Computing 9 2009 625 631
    • (2009) Applied Soft Computing , vol.9 , pp. 625-631
    • Singh, A.1
  • 23
    • 77953649650 scopus 로고    scopus 로고
    • A swarm intelligence approach to the quadratic minimum spanning tree problem
    • S. Sundar, and A. Singh A swarm intelligence approach to the quadratic minimum spanning tree problem Information Sciences 180 2010 3182 3191
    • (2010) Information Sciences , vol.180 , pp. 3182-3191
    • Sundar, S.1    Singh, A.2
  • 24
    • 79953031480 scopus 로고    scopus 로고
    • A discrete Artificial Bee Colony algorithm for the lot-streaming flow shop scheduling problem
    • Q.-K. Pan, M.F. Tasgetiren, P.N. Suganthan, and T.J. Chua A discrete Artificial Bee Colony algorithm for the lot-streaming flow shop scheduling problem Information Sciences 181 2011 2455 2468
    • (2011) Information Sciences , vol.181 , pp. 2455-2468
    • Pan, Q.-K.1    Tasgetiren, M.F.2    Suganthan, P.N.3    Chua, T.J.4
  • 25
    • 79957526144 scopus 로고    scopus 로고
    • A discrete Artificial Bee Colony algorithm for the total flowtime minimization in permutation flow shops
    • M.F. Tasgetiren, Q.-K. Pan, P.N. Suganthan, and H.-L. Chen Angela A discrete Artificial Bee Colony algorithm for the total flowtime minimization in permutation flow shops Information Sciences 181 2011 3459 3475
    • (2011) Information Sciences , vol.181 , pp. 3459-3475
    • Tasgetiren, M.F.1    Pan, Q.-K.2    Suganthan, P.N.3    Chen Angela, H.-L.4
  • 26
    • 75149134664 scopus 로고    scopus 로고
    • A survey: Algorithms simulating bee swarm intelligence
    • D. Karaboga, and B. Akay A survey: algorithms simulating bee swarm intelligence Artificial Intelligence Review 31 2009 61 85
    • (2009) Artificial Intelligence Review , vol.31 , pp. 61-85
    • Karaboga, D.1    Akay, B.2
  • 27
    • 0036778942 scopus 로고    scopus 로고
    • A new evolutionary approach to cutting stock problems with and without contiguity
    • DOI 10.1016/S0305-0548(01)00039-9, PII S0305054801000399
    • K.-H. Liang, X. Yao, C. Newton, and D. Hoffman A new evolutionary approach to cutting stock problems with and without contiguity Computers & Operations Research 29 2002 1641 1659 (Pubitemid 34589743)
    • (2002) Computers and Operations Research , vol.29 , Issue.12 , pp. 1641-1659
    • Liang, K.-H.1    Yao, X.2    Newton, C.3    Hoffman, D.4
  • 28
    • 41149174854 scopus 로고    scopus 로고
    • Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties
    • DOI 10.1016/j.cor.2007.04.006, PII S0305054807000883
    • J.M.S. Valente, and R.A.F.S. Alves Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties Computers & Operations Research 35 2008 3696 3713 (Pubitemid 351443070)
    • (2008) Computers and Operations Research , vol.35 , Issue.11 , pp. 3696-3713
    • Valente, J.M.S.1    Alves, R.A.F.S.2
  • 30
    • 79960535211 scopus 로고    scopus 로고
    • A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms
    • J. Derrac, S. Garca, D. Molina, and F. Herrera A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms Swarm and Evolutionary Computation 1 2011 3 18
    • (2011) Swarm and Evolutionary Computation , vol.1 , pp. 3-18
    • Derrac, J.1    Garca, S.2    Molina, D.3    Herrera, F.4


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