메뉴 건너뛰기




Volumn 60, Issue 1-4, 2012, Pages 303-315

An effective artificial bee colony algorithm for the flexible job-shop scheduling problem

Author keywords

Artificial bee colony algorithm; Critical path; Flexible job shop scheduling problem; Machine assignment; Makespan; Operation sequence

Indexed keywords

ARTIFICIAL BEE COLONY ALGORITHMS; CRITICAL PATHS; FLEXIBLE JOB-SHOP SCHEDULING PROBLEM; MACHINE ASSIGNMENT; MAKESPAN; OPERATION SEQUENCES;

EID: 84859557971     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-011-3610-1     Document Type: Article
Times cited : (183)

References (38)
  • 1
    • 0025531716 scopus 로고
    • Job-shop scheduling with multi-purpose machines
    • 1088078 10.1007/BF02238804
    • P Bruker R Schlie 1990 Job-shop scheduling with multi-purpose machines Computing 45 4 369 375 1088078 10.1007/BF02238804
    • (1990) Computing , vol.45 , Issue.4 , pp. 369-375
    • Bruker, P.1    Schlie, R.2
  • 2
    • 34250084648 scopus 로고
    • Routing and scheduling in a flexible job shop by tabu search
    • 0775.90227 10.1007/BF02023073
    • P Brandimarte 1993 Routing and scheduling in a flexible job shop by tabu search Ann Oper Res 41 3 157 183 0775.90227 10.1007/BF02023073
    • (1993) Ann Oper Res , vol.41 , Issue.3 , pp. 157-183
    • Brandimarte, P.1
  • 3
    • 0008573551 scopus 로고
    • A hierarchical approach for the FMS scheduling problem
    • 0902.90086 10.1016/0377-2217(95)00059-Y
    • J Paulli 1995 A hierarchical approach for the FMS scheduling problem Eur J Operat Res 86 1 32 42 0902.90086 10.1016/0377-2217(95)00059-Y
    • (1995) Eur J Operat Res , vol.86 , Issue.1 , pp. 32-42
    • Paulli, J.1
  • 4
    • 0037201140 scopus 로고    scopus 로고
    • Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic
    • 1939480 1006.90044 10.1016/S0378-4754(02)00019-8
    • I Kacem S Hammadi P Borne 2002 Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic Math Comput Simul 60 3-5 245 276 1939480 1006.90044 10.1016/S0378- 4754(02)00019-8
    • (2002) Math Comput Simul , vol.60 , Issue.35 , pp. 245-276
    • Kacem, I.1    Hammadi, S.2    Borne, P.3
  • 5
    • 0036464279 scopus 로고    scopus 로고
    • Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems
    • DOI 10.1109/TSMCC.2002.1009117, PII S1094697702046801
    • I Kacem S Hammadi P Borne 2002 Approach by localization and multi-objective evolutionary optimization for flexible job-shop scheduling problems IEEE Trans Sys Man Cybern Part C 32 1 1 13 10.1109/TSMCC.2002.1009117 (Pubitemid 34789920)
    • (2002) IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews , vol.32 , Issue.1 , pp. 1-13
    • Kacem, I.1    Hammadi, S.2    Borne, P.3
  • 6
    • 14044268702 scopus 로고    scopus 로고
    • An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems
    • DOI 10.1016/j.cie.2005.01.018, PII S0360835205000197
    • WJ Xia ZM Wu 2005 An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems Comput Ind Eng 48 2 409 425 2161680 10.1016/j.cie.2005.01.018 (Pubitemid 40274933)
    • (2005) Computers and Industrial Engineering , vol.48 , Issue.2 , pp. 409-425
    • Xia, W.1    Wu, Z.2
  • 7
    • 33751418065 scopus 로고    scopus 로고
    • An effective architecture for learning and evolving flexible job-shop schedules
    • DOI 10.1016/j.ejor.2006.04.007, PII S0377221706002219
    • NB Ho JC Tay EMK Lai 2007 An effective architecture for learning and evolving flexible job-shop schedules Eur J Operat Res 179 2 316 333 1180.90121 10.1016/j.ejor.2006.04.007 (Pubitemid 44821629)
    • (2007) European Journal of Operational Research , vol.179 , Issue.2 , pp. 316-333
    • Ho, N.B.1    Tay, J.C.2    Lai, E.M.-K.3
  • 9
    • 34547651088 scopus 로고    scopus 로고
    • Mathematical modeling and heuristic approaches to flexible job shop scheduling problems
    • DOI 10.1007/s10845-007-0026-8
    • P Fattahi M Saidi F Jolai 2007 Mathematical modeling and heuristic approaches to flexible job shop scheduling problems J of Int Manuf 18 3 331 342 10.1007/s10845-007-0026-8 (Pubitemid 47209689)
    • (2007) Journal of Intelligent Manufacturing , vol.18 , Issue.3 , pp. 331-342
    • Fattahi, P.1    Saidi Mehrabad, M.2    Jolai, F.3
  • 10
    • 38749142590 scopus 로고    scopus 로고
    • A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
    • DOI 10.1016/j.cor.2007.01.001, PII S0305054807000020
    • J Gao LY Sun M Gen 2008 A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems Com Oper Res 35 9 2892 2907 2586405 1144.90379 10.1016/j.cor.2007.01.001 (Pubitemid 351186807)
    • (2008) Computers and Operations Research , vol.35 , Issue.9 , pp. 2892-2907
    • Gao, J.1    Sun, L.2    Gen, M.3
  • 11
    • 52649152349 scopus 로고    scopus 로고
    • A study of the flexible job shop scheduling problem with parallel machines and reentrant process
    • 10.1007/s00170-007-1227-1
    • JC Chen KH Chen JJ Wu CW Chen 2008 A study of the flexible job shop scheduling problem with parallel machines and reentrant process Int J Adv Manuf Tech 39 3-4 344 354 10.1007/s00170-007-1227-1
    • (2008) Int J Adv Manuf Tech , vol.39 , Issue.34 , pp. 344-354
    • Chen, J.C.1    Chen, K.H.2    Wu, J.J.3    Chen, C.W.4
  • 12
    • 56749095424 scopus 로고    scopus 로고
    • Variable neighborhood genetic algorithm for the flexible job shop scheduling problems
    • 10.1007/978-3-540-88518-4-54
    • GH Zhang L Gao XY Li PG Li 2008 Variable neighborhood genetic algorithm for the flexible job shop scheduling problems Lect Notes Com Sci 5315 503 512 10.1007/978-3-540-88518-4-54
    • (2008) Lect Notes Com Sci , vol.5315 , pp. 503-512
    • Zhang, G.H.1    Gao, L.2    Li, X.Y.3    Li, P.G.4
  • 13
    • 62549161373 scopus 로고    scopus 로고
    • Multistage-based genetic algorithm for flexible job-shop scheduling problem
    • 10.1007/978-3-540-95978-6-13
    • M Gen J Gao L Lin 2009 Multistage-based genetic algorithm for flexible job-shop scheduling problem Studies Com Int 187 183 196 10.1007/978-3-540-95978- 6-13
    • (2009) Studies Com Int , vol.187 , pp. 183-196
    • Gen, M.1    Gao, J.2    Lin, L.3
  • 14
    • 77649234984 scopus 로고    scopus 로고
    • A knowledge-based ant colony optimization for flexible job shop scheduling problems
    • 10.1016/j.asoc.2009.10.006
    • LN Xing YW Chen P Wang QS Zhao J Xiong 2010 A knowledge-based ant colony optimization for flexible job shop scheduling problems Applied Soft Com 10 3 888 896 10.1016/j.asoc.2009.10.006
    • (2010) Applied Soft Com , vol.10 , Issue.3 , pp. 888-896
    • Xing, L.N.1    Chen, Y.W.2    Wang, P.3    Zhao, Q.S.4    Xiong, J.5
  • 15
    • 70349581723 scopus 로고    scopus 로고
    • Flexible job-shop scheduling with parallel variable neighborhood search algorithm
    • 10.1016/j.eswa.2009.06.007
    • M Yazdani M Amiri M Zandieh 2010 Flexible job-shop scheduling with parallel variable neighborhood search algorithm Expert Sys Appl 37 1 678 687 10.1016/j.eswa.2009.06.007
    • (2010) Expert Sys Appl , vol.37 , Issue.1 , pp. 678-687
    • Yazdani, M.1    Amiri, M.2    Zandieh, M.3
  • 16
    • 78149466035 scopus 로고    scopus 로고
    • An efficient architecture for scheduling flexible job-shop with machine availability constraints
    • 10.1007/s00170-010-2621-7
    • E Moradi SMT Fatemi Ghomi M Zandieh 2010 An efficient architecture for scheduling flexible job-shop with machine availability constraints Int J Adv Manuf Tech 51 1-4 325 339 10.1007/s00170-010-2621-7
    • (2010) Int J Adv Manuf Tech , vol.51 , Issue.14 , pp. 325-339
    • Moradi, E.1    Fatemi Ghomi, S.M.T.2    Zandieh, M.3
  • 17
    • 77953622630 scopus 로고    scopus 로고
    • A parallel genetic algorithm for a flexible job-shop scheduling problem with sequence dependent setups
    • 10.1007/s00170-009-2388-x
    • FM Defersha M Chen 2010 A parallel genetic algorithm for a flexible job-shop scheduling problem with sequence dependent setups Int J Adv Manuf Tech 49 1-4 263 279 10.1007/s00170-009-2388-x
    • (2010) Int J Adv Manuf Tech , vol.49 , Issue.14 , pp. 263-279
    • Defersha, F.M.1    Chen, M.2
  • 18
    • 78650682362 scopus 로고    scopus 로고
    • An effective genetic algorithm for the flexible job-shop scheduling problem
    • 10.1016/j.eswa.2010.08.145
    • GH Zhang L Gao Y Shi 2011 An effective genetic algorithm for the flexible job-shop scheduling problem Experts Sys Appl 38 4 3563 3573 10.1016/j.eswa.2010.08.145
    • (2011) Experts Sys Appl , vol.38 , Issue.4 , pp. 3563-3573
    • Zhang, G.H.1    Gao, L.2    Shi, Y.3
  • 19
    • 79751528806 scopus 로고    scopus 로고
    • A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem
    • 10.1007/s00170-010-2743-y
    • JQ Li QK Pan PN Suganthan TJ Chua 2011 A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem Int J Adv Manuf Tech 52 5-8 683 697 10.1007/s00170-010-2743-y
    • (2011) Int J Adv Manuf Tech , vol.52 , Issue.58 , pp. 683-697
    • Li, J.Q.1    Pan, Q.K.2    Suganthan, P.N.3    Chua, T.J.4
  • 20
    • 0042261208 scopus 로고    scopus 로고
    • An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
    • 1456804 0890.90097 10.1023/A:1018930406487
    • S Dauzere-Peres J Paulli 1997 An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search Ann Oper Res 70 281 306 1456804 0890.90097 10.1023/A:1018930406487
    • (1997) Ann Oper Res , vol.70 , pp. 281-306
    • Dauzere-Peres, S.1    Paulli, J.2
  • 21
    • 0002577337 scopus 로고    scopus 로고
    • Effective neighborhood functions for the flexible job shop problem
    • 1990216 1028.90018 10.1002/(SICI)1099-1425(200001/02)3:1<3::AID- JOS32>3.0.CO;2-Y
    • M Mastrolilli LM Gambardella 2000 Effective neighborhood functions for the flexible job shop problem J Sched 3 1 3 20 1990216 1028.90018 10.1002/(SICI)1099-1425(200001/02)3:1<3::AID-JOS32>3.0.CO;2-Y
    • (2000) J Sched , vol.3 , Issue.1 , pp. 3-20
    • Mastrolilli, M.1    Gambardella, L.M.2
  • 22
    • 0037146442 scopus 로고    scopus 로고
    • Linguistic-based meta-heuristic optimization model for flexible job shop scheduling
    • 10.1080/00207540210147043
    • A Baykasoglu 2002 Linguistic-based meta-heuristic optimization model for flexible job shop scheduling Int J Product Res 44 17 4523 4543 10.1080/00207540210147043
    • (2002) Int J Product Res , vol.44 , Issue.17 , pp. 4523-4543
    • Baykasoglu, A.1
  • 23
    • 33646400835 scopus 로고    scopus 로고
    • Flexible job-shop scheduling problem under resource constraints
    • 1095.90035 10.1080/00207540500386012
    • FTS Chan TC Wong LY Chan 2006 Flexible job-shop scheduling problem under resource constraints Int J Product Res 44 11 2071 2089 1095.90035 10.1080/00207540500386012
    • (2006) Int J Product Res , vol.44 , Issue.11 , pp. 2071-2089
    • Chan, F.T.S.1    Wong, T.C.2    Chan, L.Y.3
  • 24
    • 40249118429 scopus 로고    scopus 로고
    • A genetic algorithm for the Flexible Job-shop Scheduling Problem
    • DOI 10.1016/j.cor.2007.02.014, PII S0305054807000524
    • F Pezzella G Morganti G Ciaschetti 2008 A genetic algorithm for the flexible job-shop scheduling problem Comput Oper Res 35 10 3202 3212 1162.90014 10.1016/j.cor.2007.02.014 (Pubitemid 351335142)
    • (2008) Computers and Operations Research , vol.35 , Issue.10 , pp. 3202-3212
    • Pezzella, F.1    Morganti, G.2    Ciaschetti, G.3
  • 25
    • 38849162891 scopus 로고    scopus 로고
    • Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems
    • DOI 10.1016/j.cie.2007.08.008, PII S0360835207002008
    • JC Tay NB Ho 2008 Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems Comput Ind Eng 54 3 453 473 10.1016/j.cie.2007.08.008 (Pubitemid 351199798)
    • (2008) Computers and Industrial Engineering , vol.54 , Issue.3 , pp. 453-473
    • Tay, J.C.1    Ho, N.B.2
  • 26
    • 78649330971 scopus 로고    scopus 로고
    • A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search
    • 10.1016/j.ijpe.2010.08.004
    • G Moslehi M Mahnam 2011 A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search Int J Product Econ 129 1 14 22 10.1016/j.ijpe.2010.08.004
    • (2011) Int J Product Econ , vol.129 , Issue.1 , pp. 14-22
    • Moslehi, G.1    Mahnam, M.2
  • 28
    • 64149103429 scopus 로고    scopus 로고
    • A new design method based on artificial bee colony algorithm for digital IIR filters
    • 2524570 1166.93351 10.1016/j.jfranklin.2008.11.003
    • N Karaboga 2009 A new design method based on artificial bee colony algorithm for digital IIR filters J Frankl Inst 346 4 328 348 2524570 1166.93351 10.1016/j.jfranklin.2008.11.003
    • (2009) J Frankl Inst , vol.346 , Issue.4 , pp. 328-348
    • Karaboga, N.1
  • 29
    • 67349273050 scopus 로고    scopus 로고
    • A comparative study of artificial bee colony algorithm
    • 2541051 10.1016/j.amc.2009.03.090
    • D Karaboga B Akay 2009 A comparative study of artificial bee colony algorithm Appl Math Comput 24 1 108 132 2541051 10.1016/j.amc.2009.03.090
    • (2009) Appl Math Comput , vol.24 , Issue.1 , pp. 108-132
    • Karaboga, D.1    Akay, B.2
  • 30
    • 34548479029 scopus 로고    scopus 로고
    • On the performance of artificial bee colony (ABC) algorithm
    • DOI 10.1016/j.asoc.2007.05.007, PII S1568494607000531
    • D Karaboga B Basturk 2008 On the performance of artificial bee colony (ABC) algorithm Applied Soft Comput 8 1 687 697 10.1016/j.asoc.2007.05.007 (Pubitemid 47374599)
    • (2008) Applied Soft Computing Journal , vol.8 , Issue.1 , pp. 687-697
    • Karaboga, D.1    Basturk, B.2
  • 31
    • 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 B Basturk 2007 A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm J Global Optim 39 3 459 471 2346178 1149.90186 10.1007/s10898-007-9149-x (Pubitemid 47551831)
    • (2007) Journal of Global Optimization , vol.39 , Issue.3 , pp. 459-471
    • Karaboga, D.1    Basturk, B.2
  • 32
    • 67651138854 scopus 로고    scopus 로고
    • Artificial bee colony algorithm and its application to generalized assignment problem
    • I-Tech Education and Publishing, Vienna
    • Baykasoglu A, Ozbakir L, Tapkan P (2007) Artificial bee colony algorithm and its application to generalized assignment problem. In: Swarm intelligence focus on ant and particle swarm optimization. I-Tech Education and Publishing, Vienna, pp 113-144
    • (2007) Swarm Intelligence Focus on Ant and Particle Swarm Optimization , pp. 113-144
    • Baykasoglu, A.1    Ozbakir, L.2    Tapkan, P.3
  • 34
    • 79953031480 scopus 로고    scopus 로고
    • A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem
    • 2784709 10.1016/j.ins.2009.12.025
    • QK Pan MF Tasgetiren PN Suganthan TJ Chua 2011 A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem Inf Sci 181 12 2455 2468 2784709 10.1016/j.ins.2009.12.025
    • (2011) Inf Sci , vol.181 , Issue.12 , pp. 2455-2468
    • Pan, Q.K.1    Tasgetiren, M.F.2    Suganthan, P.N.3    Chua, T.J.4
  • 35
    • 78650179774 scopus 로고    scopus 로고
    • A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem
    • 10.1007/s00170-010-2642-2
    • XJ Wang L Gao CY Zhang XY Shao 2010 A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem Int J Adv Manuf Tech 51 5-8 757 767 10.1007/s00170-010-2642-2
    • (2010) Int J Adv Manuf Tech , vol.51 , Issue.58 , pp. 757-767
    • Wang, X.J.1    Gao, L.2    Zhang, C.Y.3    Shao, X.Y.4
  • 36
    • 15344343721 scopus 로고    scopus 로고
    • A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem
    • DOI 10.1016/j.cie.2004.12.008, PII S0360835204001883, Selected Papers from the 30th International Conference on Computers and Industrial Engineering
    • M Watanabe K Ida M Gen 2005 A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem Comput Ind Eng 48 4 743 752 10.1016/j.cie.2004.12.008 (Pubitemid 40391494)
    • (2005) Computers and Industrial Engineering , vol.48 , Issue.4 , pp. 743-752
    • Watanabe, M.1    Ida, K.2    Gen, M.3
  • 37
    • 67349174559 scopus 로고    scopus 로고
    • An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem
    • 10.1016/j.cie.2008.07.021
    • GH Zhang XY Shao PG Li L Gao 2009 An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem Comput Ind Eng 56 4 1309 1318 10.1016/j.cie.2008.07.021
    • (2009) Comput Ind Eng , vol.56 , Issue.4 , pp. 1309-1318
    • Zhang, G.H.1    Shao, X.Y.2    Li, P.G.3    Gao, L.4
  • 38
    • 4344650514 scopus 로고    scopus 로고
    • GENACE: An efficient cultural algorithm for solving the flexible job-shop problem
    • Tay JC, Wibowo D (2004) GENACE: an efficient cultural algorithm for solving the flexible job-shop problem. In: Proc. of the IEEE Congress on Evolutionary Computation, pp 1759-1766
    • (2004) Proc. of the IEEE Congress on Evolutionary Computation , pp. 1759-1766
    • Tay, J.C.1    Wibowo, D.2


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