메뉴 건너뛰기




Volumn 174, Issue , 2016, Pages 93-110

An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem

Author keywords

Computational time; Flexible job shop scheduling; Genetic algorithm; Hybrid algorithm; Makespan

Indexed keywords

ALGORITHMS; BENCHMARKING; COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; MANUFACTURE; OPTIMIZATION; SCHEDULING; SCHEDULING ALGORITHMS; TABU SEARCH;

EID: 84960120780     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2016.01.016     Document Type: Article
Times cited : (466)

References (73)
  • 1
    • 77955573212 scopus 로고    scopus 로고
    • A variable neighbourhood search algorithm for the flexible job shop scheduling problem
    • M. Amiri, M. Zandieh, M. Yazdani, and A. Bagheri A variable neighbourhood search algorithm for the flexible job shop scheduling problem Int. J. Prod. Res. 48 19 2010 5671 5689
    • (2010) Int. J. Prod. Res. , vol.48 , Issue.19 , pp. 5671-5689
    • Amiri, M.1    Zandieh, M.2    Yazdani, M.3    Bagheri, A.4
  • 2
    • 75049086134 scopus 로고    scopus 로고
    • An artificial immune algorithm for the flexible job shop scheduling problem
    • A. Bagheri, M. Zandieh, I. Mahdavi, and M. Yazdani An artificial immune algorithm for the flexible job shop scheduling problem Future Gener Comput. Syst. 26 2010 533 541
    • (2010) Future Gener Comput. Syst. , vol.26 , pp. 533-541
    • Bagheri, A.1    Zandieh, M.2    Mahdavi, I.3    Yazdani, M.4
  • 4
    • 76049094322 scopus 로고    scopus 로고
    • Analyzing the effect of dispatching rules on the scheduling performance through grammar based flexible scheduling system
    • A. Baykasoglu, and L. Ozbakir Analyzing the effect of dispatching rules on the scheduling performance through grammar based flexible scheduling system Int J. Prod. Econ. 124 2010 369 381
    • (2010) Int J. Prod. Econ. , vol.124 , pp. 369-381
    • Baykasoglu, A.1    Ozbakir, L.2
  • 6
    • 84938744029 scopus 로고    scopus 로고
    • List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility
    • E.G. Birgin, J.E. Ferreira, and D.P. Ronconi List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility Eur. J. Oper. Res. 247 2015 421 440
    • (2015) Eur. J. Oper. Res. , vol.247 , pp. 421-440
    • Birgin, E.G.1    Ferreira, J.E.2    Ronconi, D.P.3
  • 7
    • 77955308077 scopus 로고    scopus 로고
    • Parallel hybrid metaheuristics for the flexible job shop problem
    • W. Bozejko, M. Uchronski, and M. Wodecki Parallel hybrid metaheuristics for the flexible job shop problem Comput.Ind. Eng. 59 2010 323 333
    • (2010) Comput.Ind. Eng. , vol.59 , pp. 323-333
    • Bozejko, W.1    Uchronski, M.2    Wodecki, M.3
  • 8
    • 34250084648 scopus 로고
    • Routing and scheduling in a flexible job shop by taboo search
    • P. Brandimarte Routing and scheduling in a flexible job shop by taboo search Ann. Oper. Res. 41 3 1993 157 183
    • (1993) Ann. Oper. Res. , vol.41 , Issue.3 , pp. 157-183
    • Brandimarte, P.1
  • 9
    • 0025531716 scopus 로고
    • Job-shop scheduling with multi-purpose machines
    • P. Brucker, and R. Schile Job-shop scheduling with multi-purpose machines Computing 45 4 1990 369 375
    • (1990) Computing , vol.45 , Issue.4 , pp. 369-375
    • Brucker, P.1    Schile, R.2
  • 10
    • 84889808975 scopus 로고    scopus 로고
    • A dispatching algorithm for flexible job-shop scheduling with transfer batches: An industrial application
    • G. Calleja, and R. Pastor A dispatching algorithm for flexible job-shop scheduling with transfer batches: An industrial application Prod. Plan. Control. 25 2 2014 93 109
    • (2014) Prod. Plan. Control. , vol.25 , Issue.2 , pp. 93-109
    • Calleja, G.1    Pastor, R.2
  • 11
    • 84954400078 scopus 로고    scopus 로고
    • A research survey: Review of flexible job shop scheduling techniques
    • I.A. Chaudhry, and A.A. Khan A research survey: Review of flexible job shop scheduling techniques Int. Trans. Oper. Res. 23 2016 551 591
    • (2016) Int. Trans. Oper. Res. , vol.23 , pp. 551-591
    • Chaudhry, I.A.1    Khan, A.A.2
  • 13
    • 84862798145 scopus 로고    scopus 로고
    • Flexible job shop scheduling with parallel machines using genetic algorithm and grouping genetic algorithm
    • J.C. Chen, C.C. Wu, C.W. Chen, and K.H. Chen Flexible job shop scheduling with parallel machines using genetic algorithm and grouping genetic algorithm Exp. Syst. Appl. 39 2012 10016 10021
    • (2012) Exp. Syst. Appl. , vol.39 , pp. 10016-10021
    • Chen, J.C.1    Wu, C.C.2    Chen, C.W.3    Chen, K.H.4
  • 14
    • 84869495945 scopus 로고    scopus 로고
    • A simple and effective evolutionary algorithm for multiobjective flexible job shop scheduling
    • T.S. Chiang, and H.J. Lin A simple and effective evolutionary algorithm for multiobjective flexible job shop scheduling Int. J. Prod. Econ. 141 2013 87 98
    • (2013) Int. J. Prod. Econ. , vol.141 , pp. 87-98
    • Chiang, T.S.1    Lin, H.J.2
  • 15
    • 84870248520 scopus 로고    scopus 로고
    • Evaluation of mathematical models for flexible job shop scheduling problems
    • Y. Demir, and S.K. Isleyen Evaluation of mathematical models for flexible job shop scheduling problems Appl. Math. Model. 37 2013 977 988
    • (2013) Appl. Math. Model. , vol.37 , pp. 977-988
    • Demir, Y.1    Isleyen, S.K.2
  • 16
    • 84902836669 scopus 로고    scopus 로고
    • An effective genetic algorithm for flexible job shop scheduling with overlapping in operations
    • Y. Demir, and S.K. Isleyen An effective genetic algorithm for flexible job shop scheduling with overlapping in operations Int. J. Prod. Res. 52 13 2014 3905 3921
    • (2014) Int. J. Prod. Res. , vol.52 , Issue.13 , pp. 3905-3921
    • Demir, Y.1    Isleyen, S.K.2
  • 17
    • 84924787947 scopus 로고    scopus 로고
    • A new genetic algorithm for flexible job-shop scheduling problems
    • I. Driss, K.N. Mouss, and A. Laggoun A new genetic algorithm for flexible job-shop scheduling problems J. Mech. Sci. Technol. 29 3 2015 1273 1281
    • (2015) J. Mech. Sci. Technol. , vol.29 , Issue.3 , pp. 1273-1281
    • Driss, I.1    Mouss, K.N.2    Laggoun, A.3
  • 18
    • 51649093095 scopus 로고    scopus 로고
    • New local diversification techniques for flexible job shop scheduling problem with a multi-agent approach
    • M. Ennigrou, and K. Ghedira New local diversification techniques for flexible job shop scheduling problem with a multi-agent approach Auton. Agent Multi-Agent Syst. 17 2008 270 287
    • (2008) Auton. Agent Multi-Agent Syst. , vol.17 , pp. 270-287
    • Ennigrou, M.1    Ghedira, K.2
  • 19
    • 34547651088 scopus 로고    scopus 로고
    • Mathematical modeling and heuristic approaches to flexible job shop scheduling problems
    • P. Fattahi, M.S. Meharabad, and F. Jolai Mathematical modeling and heuristic approaches to flexible job shop scheduling problems J. Intell. Manuf. 18 2007 331 342
    • (2007) J. Intell. Manuf. , vol.18 , pp. 331-342
    • Fattahi, P.1    Meharabad, M.S.2    Jolai, F.3
  • 21
    • 38749142590 scopus 로고    scopus 로고
    • A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
    • J. Gao, L.Y. Sun, and M. Gen A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems Comput. Oper. Res. 35 2008 2892 2907
    • (2008) Comput. Oper. Res. , vol.35 , pp. 2892-2907
    • Gao, J.1    Sun, L.Y.2    Gen, M.3
  • 22
    • 84948614402 scopus 로고    scopus 로고
    • Pareto based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling
    • K.Z. Gao, P.N. Suganthan, Q.K. Pan, T.J. Chua, T.X. Cai, and C.S. Chong Pareto based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling Inform. Sci. 289 2014 76 90
    • (2014) Inform. Sci. , vol.289 , pp. 76-90
    • Gao, K.Z.1    Suganthan, P.N.2    Pan, Q.K.3    Chua, T.J.4    Cai, T.X.5    Chong, C.S.6
  • 23
    • 84933055604 scopus 로고    scopus 로고
    • A two-stage artificial bee colony algorithm scheduling flexible job shop scheduling problem with new job insertion
    • K.Z. Gao, P.N. Suganthan, T.J. Chua, C.S. Chong, T.X. Cai, and Q.K. Pan A two-stage artificial bee colony algorithm scheduling flexible job shop scheduling problem with new job insertion Exp. Syst. Appl. 42 2015 7652 7663
    • (2015) Exp. Syst. Appl. , vol.42 , pp. 7652-7663
    • Gao, K.Z.1    Suganthan, P.N.2    Chua, T.J.3    Chong, C.S.4    Cai, T.X.5    Pan, Q.K.6
  • 24
    • 69249206751 scopus 로고    scopus 로고
    • An improved genetic algorithm for the distributed and flexible job shop scheduling problem
    • L.D. Giovanni, and F. Pezzella An improved genetic algorithm for the distributed and flexible job shop scheduling problem Eur. J. Oper. Res. 200 2010 395 408
    • (2010) Eur. J. Oper. Res. , vol.200 , pp. 395-408
    • Giovanni, L.D.1    Pezzella, F.2
  • 25
    • 70449657251 scopus 로고    scopus 로고
    • Scheduling job shop associated with multiple routings with genetic and ant colony heuristics
    • B.S. Girish, and N. Jawahar Scheduling job shop associated with multiple routings with genetic and ant colony heuristics Int. J. Prod. Res. 47 14 2009 3891 3917
    • (2009) Int. J. Prod. Res. , vol.47 , Issue.14 , pp. 3891-3917
    • Girish, B.S.1    Jawahar, N.2
  • 26
    • 0004215426 scopus 로고    scopus 로고
    • Kluwer Academic Publishers Norwell MA, USA
    • F. Glover, and M. Laguna Tabu Search 1997 Kluwer Academic Publishers Norwell MA, USA
    • (1997) Tabu Search
    • Glover, F.1    Laguna, M.2
  • 27
    • 27944444515 scopus 로고    scopus 로고
    • Optimal Scheduling for Flexible Job Shop Operation
    • M.C. Gomes, A.P. Barbosa-Povoa, and A.Q. Novais Optimal Scheduling for Flexible Job Shop Operation Int. J. Prod. Res. 43 11 2005 2323 2353
    • (2005) Int. J. Prod. Res. , vol.43 , Issue.11 , pp. 2323-2353
    • Gomes, M.C.1    Barbosa-Povoa, A.P.2    Novais, A.Q.3
  • 28
    • 0016952078 scopus 로고
    • The complexity of flow shop and job shop scheduling
    • M.R. Graey, D.S. Jonmson, and R. Sethi The complexity of flow shop and job shop scheduling Math. Oper. Res 1 1976 117 129
    • (1976) Math. Oper. Res , vol.1 , pp. 117-129
    • Graey, M.R.1    Jonmson, D.S.2    Sethi, R.3
  • 30
    • 77955279508 scopus 로고    scopus 로고
    • Discrepancy search for the flexible job shop scheduling problem
    • A.B. Hmida, M. Haouari, M.J. Huguet, and P. Lopez Discrepancy search for the flexible job shop scheduling problem Comput. Ope. Res. 37 2010 2192 2201
    • (2010) Comput. Ope. Res. , vol.37 , pp. 2192-2201
    • Hmida, A.B.1    Haouari, M.2    Huguet, M.J.3    Lopez, P.4
  • 31
    • 33751418065 scopus 로고    scopus 로고
    • An effective architecture for learning and evolving flexible job shop schedules
    • N.B. Ho, J.C. Tay, and E.M.K. Lai An effective architecture for learning and evolving flexible job shop schedules Eur. J. Oper. Res. 179 2007 316 333
    • (2007) Eur. J. Oper. Res. , vol.179 , pp. 316-333
    • Ho, N.B.1    Tay, J.C.2    Lai, E.M.K.3
  • 32
    • 50649083283 scopus 로고    scopus 로고
    • Solving multiple objective flexible job shop problems by evolution and local search
    • N.B. Ho, and J.C. Tay Solving multiple objective flexible job shop problems by evolution and local search IEEE Trans Syst, Man, Cybern.-Part C: Appl. Rev. 38 5 2008 674 685
    • (2008) IEEE Trans Syst, Man, Cybern.-Part C: Appl. Rev. , vol.38 , Issue.5 , pp. 674-685
    • Ho, N.B.1    Tay, J.C.2
  • 33
    • 84871717100 scopus 로고    scopus 로고
    • Flexible job shop scheduling with due window-A two-pheromone ant colony approach
    • R.H. Huang, C.L. Yang, and W.C. Cheng Flexible job shop scheduling with due window-a two-pheromone ant colony approach Int. J. Prod. Econ. 141 2013 685 697
    • (2013) Int. J. Prod. Econ. , vol.141 , pp. 685-697
    • Huang, R.H.1    Yang, C.L.2    Cheng, W.C.3
  • 34
    • 0000062615 scopus 로고
    • Tabu search for the job shop scheduling problem with multi-purpose machines
    • J. Hurink, B. Jurisch, and M. Thole Tabu search for the job shop scheduling problem with multi-purpose machines OR Spektrum 15 1994 205 215
    • (1994) OR Spektrum , vol.15 , pp. 205-215
    • Hurink, J.1    Jurisch, B.2    Thole, M.3
  • 35
    • 0038479948 scopus 로고    scopus 로고
    • Generating robust and flexible job shop schedules using genetic algorithms
    • M.T. Jensen Generating robust and flexible job shop schedules using genetic algorithms IEEE Trans. Evol. Comput. 7 3 2003 275 288
    • (2003) IEEE Trans. Evol. Comput. , vol.7 , Issue.3 , pp. 275-288
    • Jensen, M.T.1
  • 36
    • 84894582828 scopus 로고    scopus 로고
    • Path-relinking tabu search for the multi-objective flexible job shop scheduling problem
    • S. Jia, and Z.H. Hu Path-relinking tabu search for the multi-objective flexible job shop scheduling problem Comput. Oper. Res. 47 2014 11 26
    • (2014) Comput. Oper. Res. , vol.47 , pp. 11-26
    • Jia, S.1    Hu, Z.H.2
  • 37
    • 0036588767 scopus 로고    scopus 로고
    • Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems
    • I. Kacem, S. Hammadi, and P. Borne Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems IEEE Trans. Syst., Man, Cybern., Part C: Appl. Rev. 32 1 2002 1 13
    • (2002) IEEE Trans. Syst., Man, Cybern., Part C: Appl. Rev. , vol.32 , Issue.1 , pp. 1-13
    • Kacem, I.1    Hammadi, S.2    Borne, P.3
  • 38
    • 84867883317 scopus 로고    scopus 로고
    • An efficient knowledge-based algorithm for the flexible job shop scheduling problem
    • H. Karimi, S.H.A. Rahmati, and M. Zandieh An efficient knowledge-based algorithm for the flexible job shop scheduling problem Knowl.-Based Syst. 36 2012 236 244
    • (2012) Knowl.-Based Syst. , vol.36 , pp. 236-244
    • Karimi, H.1    Rahmati, S.H.A.2    Zandieh, M.3
  • 39
    • 79961021676 scopus 로고    scopus 로고
    • Pareto based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems
    • J.Q. Li, Q.K. Pan, and K.Z. Gao Pareto based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems Int. J. Adv. Manuf. Technol. 55 2011 1159 1169
    • (2011) Int. J. Adv. Manuf. Technol. , vol.55 , pp. 1159-1169
    • Li, J.Q.1    Pan, Q.K.2    Gao, K.Z.3
  • 40
    • 79751528806 scopus 로고    scopus 로고
    • A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem
    • J.Q. Li, Q.K. Pan, P.N. Suganthan, and T.J. Chua A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem Int. J. Adv. Manuf. Technol. 52 5-8 2011 683 697
    • (2011) Int. J. Adv. Manuf. Technol. , vol.52 , Issue.5-8 , pp. 683-697
    • Li, J.Q.1    Pan, Q.K.2    Suganthan, P.N.3    Chua, T.J.4
  • 41
    • 84959012941 scopus 로고    scopus 로고
    • A hybrid algorithm for the multi-stage flow shop group scheduling with sequence-dependent setup and transportation times
    • C.D. Liou, and Y.C. Hsieh A hybrid algorithm for the multi-stage flow shop group scheduling with sequence-dependent setup and transportation times Int. J. Prod. Econ. 170 2015 258 267
    • (2015) Int. J. Prod. Econ. , vol.170 , pp. 258-267
    • Liou, C.D.1    Hsieh, Y.C.2
  • 42
    • 0002577337 scopus 로고    scopus 로고
    • Effective neighbourhood functions for the flexible job shop problem
    • M. Mastrolilli, and L.M. Gambardella Effective neighbourhood functions for the flexible job shop problem J. Sched. 3 2000 3 20
    • (2000) J. Sched. , vol.3 , pp. 3-20
    • Mastrolilli, M.1    Gambardella, L.M.2
  • 43
    • 79551635070 scopus 로고    scopus 로고
    • Modelling and solving a practical flexible job shop scheduling problem with blocking constraints
    • Y. Mati, C. Lahlou, and S.D. Peres Modelling and solving a practical flexible job shop scheduling problem with blocking constraints Int. J. Prod. Res. 49 8 2010 2169 2182
    • (2010) Int. J. Prod. Res. , vol.49 , Issue.8 , pp. 2169-2182
    • Mati, Y.1    Lahlou, C.2    Peres, S.D.3
  • 44
    • 78649330971 scopus 로고    scopus 로고
    • A pareto approach to multi-objective flexible job shop scheduling problem using particle swarm optimization and local search
    • G. Moslehi, and M. Mahnam A pareto approach to multi-objective flexible job shop scheduling problem using particle swarm optimization and local search Int. J. Prod. Econ. 129 2011 14 22
    • (2011) Int. J. Prod. Econ. , vol.129 , pp. 14-22
    • Moslehi, G.1    Mahnam, M.2
  • 45
    • 0038269297 scopus 로고    scopus 로고
    • A modified simulated annealing method for flexible job shop scheduling problem
    • Man, and Cybernetics, Piscataway
    • Najid, N.M., Peres, S.D., Zaidat, A., 2002. A modified simulated annealing method for flexible job shop scheduling problem. In: Proceedings of 2002 International Conference on Systems, Man, and Cybernetics, Piscataway, pp. 6-12
    • (2002) Proceedings of 2002 International Conference on Systems , pp. 6-12
    • Najid, N.M.1    Peres, S.D.2    Zaidat, A.3
  • 46
    • 75449102375 scopus 로고    scopus 로고
    • Mathematical models for job shop scheduling problems with routing and process plan flexibility
    • C. Ozguven, L. Ozbakir, and Y. Yavuz Mathematical models for job shop scheduling problems with routing and process plan flexibility Appl. Math. Model. 34 2010 1539 1548
    • (2010) Appl. Math. Model. , vol.34 , pp. 1539-1548
    • Ozguven, C.1    Ozbakir, L.2    Yavuz, Y.3
  • 47
    • 84971508957 scopus 로고    scopus 로고
    • Coevolutionary makespan optimisation through different ranking methods for the fuzzy flexible job shop
    • J.J. Palacios, I. Gonzalez-Rodriguez, C.R. Vela, and J. Puente Coevolutionary makespan optimisation through different ranking methods for the fuzzy flexible job shop Fuzzy Sets Syst. 278 1 2015 81 97
    • (2015) Fuzzy Sets Syst. , vol.278 , Issue.1 , pp. 81-97
    • Palacios, J.J.1    Gonzalez-Rodriguez, I.2    Vela, C.R.3    Puente, J.4
  • 49
    • 0008573551 scopus 로고
    • A hierarchical approach for the FMS scheduling problem
    • J. Paulli A hierarchical approach for the FMS scheduling problem Eur. J. Oper. Res. 86 1 1995 32 42
    • (1995) Eur. J. Oper. Res. , vol.86 , Issue.1 , pp. 32-42
    • Paulli, J.1
  • 50
    • 40249118429 scopus 로고    scopus 로고
    • A genetic algorithm for the flexible job shop scheduling problem
    • F. Pezzella, G. Morganti, and G. Ciaschetti A genetic algorithm for the flexible job shop scheduling problem Comput. Oper. Res. 35 2008 3202 3212
    • (2008) Comput. Oper. Res. , vol.35 , pp. 3202-3212
    • Pezzella, F.1    Morganti, G.2    Ciaschetti, G.3
  • 51
    • 0042261208 scopus 로고    scopus 로고
    • An integrated approach for modeling and solving the general multiprocessor job shop scheduling using tabu search
    • S.D. Peres, and J. Paulli An integrated approach for modeling and solving the general multiprocessor job shop scheduling using tabu search Ann. Oper. Res. 70 1997 281 306
    • (1997) Ann. Oper. Res. , vol.70 , pp. 281-306
    • Peres, S.D.1    Paulli, J.2
  • 52
    • 84885594286 scopus 로고    scopus 로고
    • Mathematical modelling and a meta-heuristic for flexible job shop scheduling
    • V. Roshanaei, A. Azab, and H. ElMaraghy Mathematical modelling and a meta-heuristic for flexible job shop scheduling Int. J. Prod. Res. 51 20 2013 6247 6274
    • (2013) Int. J. Prod. Res. , vol.51 , Issue.20 , pp. 6247-6274
    • Roshanaei, V.1    Azab, A.2    ElMaraghy, H.3
  • 53
    • 34247624966 scopus 로고    scopus 로고
    • Flexible job shop scheduling with routing flexibility and separable setup times using ant colony optimisation method
    • A. Rossi, and G. Dini Flexible job shop scheduling with routing flexibility and separable setup times using ant colony optimisation method Robot. Comput. Integr. Manuf. 23 2007 503 516
    • (2007) Robot. Comput. Integr. Manuf. , vol.23 , pp. 503-516
    • Rossi, A.1    Dini, G.2
  • 54
    • 84900466232 scopus 로고    scopus 로고
    • Flexible job shop scheduling with sequence-dependent setup and transportation times by ant colony with reinforced pheromone relationships
    • A. Rossi Flexible job shop scheduling with sequence-dependent setup and transportation times by ant colony with reinforced pheromone relationships Int. J. Prod. Econ. 153 2014 253 267
    • (2014) Int. J. Prod. Econ. , vol.153 , pp. 253-267
    • Rossi, A.1
  • 55
    • 84900472780 scopus 로고    scopus 로고
    • Evaluating flexibility in discrete manufacturing based on performance and efficiency
    • G. Seebacher, and H. Winkler Evaluating flexibility in discrete manufacturing based on performance and efficiency Int. J. Prod. Econ. 153 2014 340 351
    • (2014) Int. J. Prod. Econ. , vol.153 , pp. 340-351
    • Seebacher, G.1    Winkler, H.2
  • 56
    • 84055185233 scopus 로고    scopus 로고
    • A hybrid algorithm for flexible job shop scheduling problem
    • J.C. Tang, G.J. Zhang, B.B. Lin, and B.X. Zhang A hybrid algorithm for flexible job shop scheduling problem Proced. Eng. 15 2011 3678 3683
    • (2011) Proced. Eng. , vol.15 , pp. 3678-3683
    • Tang, J.C.1    Zhang, G.J.2    Lin, B.B.3    Zhang, B.X.4
  • 57
    • 38849162891 scopus 로고    scopus 로고
    • Evolving dispatching rules using genetic programming for solving multi-objective flexible job shop problems
    • J.C. Tay, and N.B. Ho Evolving dispatching rules using genetic programming for solving multi-objective flexible job shop problems Comput. Ind. Eng. 54 2008 453 473
    • (2008) Comput. Ind. Eng. , vol.54 , pp. 453-473
    • Tay, J.C.1    Ho, N.B.2
  • 58
    • 19944366600 scopus 로고    scopus 로고
    • The common cycle economic lot scheduling in flexible job shops: The finite horizon case
    • S.A. Torabi, B. Karimi, and S.M.T.F. Ghomi The common cycle economic lot scheduling in flexible job shops: The finite horizon case Int. J. Prod. Econ. 97 2005 52 65
    • (2005) Int. J. Prod. Econ. , vol.97 , pp. 52-65
    • Torabi, S.A.1    Karimi, B.2    Ghomi, S.M.T.F.3
  • 59
    • 84855798863 scopus 로고    scopus 로고
    • A tabu search algorithm for solving a multicriteria flexible job shop scheduling problem
    • G. Vilcot, and J.C. Billaut A tabu search algorithm for solving a multicriteria flexible job shop scheduling problem Int. J. Prod. Res. 49 23 2011 6963 6980
    • (2011) Int. J. Prod. Res. , vol.49 , Issue.23 , pp. 6963-6980
    • Vilcot, G.1    Billaut, J.C.2
  • 60
    • 77955473840 scopus 로고    scopus 로고
    • An effective heuristic for flexible job shop scheduling problem with maintenance activities
    • S.J. Wang, and J.B. Yu An effective heuristic for flexible job shop scheduling problem with maintenance activities Comput. Ind. Eng 59 2010 436 447
    • (2010) Comput. Ind. Eng , vol.59 , pp. 436-447
    • Wang, S.J.1    Yu, J.B.2
  • 61
    • 84859557971 scopus 로고    scopus 로고
    • An effective artificial bee colony algorithm for the flexible job shop scheduling problem
    • L. Wang, G. Zhou, Y. Xu, S.Y. Wang, and M. Liu An effective artificial bee colony algorithm for the flexible job shop scheduling problem Int J. Adv. Manuf. Technol. 60 2012 303 315
    • (2012) Int J. Adv. Manuf. Technol. , vol.60 , pp. 303-315
    • Wang, L.1    Zhou, G.2    Xu, Y.3    Wang, S.Y.4    Liu, M.5
  • 62
    • 84921823844 scopus 로고    scopus 로고
    • A heuristic for scheduling jobs on two identical parallel machines with a machine availability constraint
    • X.L. Wang, and T.C.E. Cheng A heuristic for scheduling jobs on two identical parallel machines with a machine availability constraint Int.l J. Prod. Econ. 161 2015 74 82
    • (2015) Int.l J. Prod. Econ. , vol.161 , pp. 74-82
    • Wang, X.L.1    Cheng, T.C.E.2
  • 64
    • 84869492892 scopus 로고    scopus 로고
    • Robust scheduling for multi-objective flexible job shop problems with random machine breakdowns
    • J. Xiong, L.N. Xing, and Y.W. Chen Robust scheduling for multi-objective flexible job shop problems with random machine breakdowns Int. J. Prod. Econ. 141 2013 112 126
    • (2013) Int. J. Prod. Econ. , vol.141 , pp. 112-126
    • Xiong, J.1    Xing, L.N.2    Chen, Y.W.3
  • 65
    • 70349581723 scopus 로고    scopus 로고
    • Flexible job shop scheduling with parallel variable neighborhood search algorithm
    • M. Yazdani, M. Amiri, and M. Zandieh Flexible job shop scheduling with parallel variable neighborhood search algorithm Exp. Syst. Appl. 37 2010 678 687
    • (2010) Exp. Syst. Appl. , vol.37 , pp. 678-687
    • Yazdani, M.1    Amiri, M.2    Zandieh, M.3
  • 66
    • 84880731416 scopus 로고    scopus 로고
    • An integrated search heuristic for large-scale flexible job shop scheduling problems
    • Y. Yuan, and H. Xu An integrated search heuristic for large-scale flexible job shop scheduling problems Comput. Oper. Res. 40 2013 2864 2877
    • (2013) Comput. Oper. Res. , vol.40 , pp. 2864-2877
    • Yuan, Y.1    Xu, H.2
  • 67
    • 84893389830 scopus 로고    scopus 로고
    • A hybrid harmony search algorithm for the flexible job shop scheduling problem
    • Y. Yuan, H. Xu, and J.D. Yang A hybrid harmony search algorithm for the flexible job shop scheduling problem Appl. Soft Comput. 13 2013 3259 3272
    • (2013) Appl. Soft Comput. , vol.13 , pp. 3259-3272
    • Yuan, Y.1    Xu, H.2    Yang, J.D.3
  • 68
    • 84876126006 scopus 로고    scopus 로고
    • Flexible job shop scheduling using hybrid differential evolution algorithms
    • Y. Yuan, and H. Xu Flexible job shop scheduling using hybrid differential evolution algorithms Comput. Ind. Eng. 65 2013 246 260
    • (2013) Comput. Ind. Eng. , vol.65 , pp. 246-260
    • Yuan, Y.1    Xu, H.2
  • 69
    • 84920780405 scopus 로고    scopus 로고
    • Multiobjective flexible job shop scheduling using memetic algorithms
    • Y. Yuan, and H. Xu Multiobjective flexible job shop scheduling using memetic algorithms IEEE Trans. Autom. Sci. Eng. 12 1 2015 336 353
    • (2015) IEEE Trans. Autom. Sci. Eng. , vol.12 , Issue.1 , pp. 336-353
    • Yuan, Y.1    Xu, H.2
  • 70
    • 78650682362 scopus 로고    scopus 로고
    • An effective genetic algorithm for the flexible job shop scheduling problem
    • G.H. Zhang, L. Gao, and Y. Shi An effective genetic algorithm for the flexible job shop scheduling problem Exp. Syst. Appl. 38 2011 3563 3573
    • (2011) Exp. Syst. Appl. , vol.38 , pp. 3563-3573
    • Zhang, G.H.1    Gao, L.2    Shi, Y.3
  • 71
    • 81555213556 scopus 로고    scopus 로고
    • A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times
    • Q. Zhang, H. Manier, and M.A. Manier A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times Comput. Oper. Res. 39 2012 1713 1723
    • (2012) Comput. Oper. Res. , vol.39 , pp. 1713-1723
    • Zhang, Q.1    Manier, H.2    Manier, M.A.3
  • 72
    • 84897633390 scopus 로고    scopus 로고
    • A heuristic algorithm for solving flexible job shop scheduling problem
    • M. Ziaee A heuristic algorithm for solving flexible job shop scheduling problem Int. J. Adv. Manuf. Technol. 71 2014 519 528
    • (2014) Int. J. Adv. Manuf. Technol. , vol.71 , pp. 519-528
    • Ziaee, M.1


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