메뉴 건너뛰기




Volumn 38, Issue 5, 2011, Pages 5986-5999

NNMA: An effective memetic algorithm for solving multiobjective permutation flow shop scheduling problems

Author keywords

Makespan; Memetic algorithm; Multiobjective optimization; NEH heuristic; Permutation flow shop scheduling; Total flow time

Indexed keywords

MAKESPAN; MEMETIC ALGORITHMS; NEH HEURISTIC; PERMUTATION FLOW-SHOP SCHEDULING; TOTAL FLOWTIME;

EID: 79151476944     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2010.11.022     Document Type: Article
Times cited : (59)

References (39)
  • 1
    • 4344592872 scopus 로고    scopus 로고
    • A partial enumeration heuristic for multi-objective flowshop scheduling problems
    • J.E.C. Arroyo, and V.A. Armentano A partial enumeration heuristic for multi-objective flowshop scheduling problems Journal of the Operational Research Society 55 2004 1000 1007
    • (2004) Journal of the Operational Research Society , vol.55 , pp. 1000-1007
    • Arroyo, J.E.C.1    Armentano, V.A.2
  • 3
    • 84931310003 scopus 로고    scopus 로고
    • Pareto-optimal solutions for multi-objective production scheduling problems
    • First international conference on evolutionary multi-criterion optimization, EMO
    • T.P. Bagchi Pareto-optimal solutions for multi-objective production scheduling problems E. Zitzler, K. Deb, L. Thiele, C.A. Coello Coello, D. Corne, First international conference on evolutionary multi-criterion optimization, EMO LNCS 1993 2001 Springer Heidelberg 458 471
    • (2001) LNCS , vol.1993 , pp. 458-471
    • Bagchi, T.P.1
  • 4
    • 67349094635 scopus 로고    scopus 로고
    • A multi-phase covering Pareto-optimal front method to multi-objective scheduling in a realistic hybrid flowshop using a hybrid metaheuristic
    • J. Behnamian, S.M.T. Fatemi Ghomi, and M. Zandieh A multi-phase covering Pareto-optimal front method to multi-objective scheduling in a realistic hybrid flowshop using a hybrid metaheuristic Expert Systems with Applications 36 2009 11057 11069
    • (2009) Expert Systems with Applications , vol.36 , pp. 11057-11069
    • Behnamian, J.1    Fatemi Ghomi, S.M.T.2    Zandieh, M.3
  • 5
    • 0032131027 scopus 로고    scopus 로고
    • Hybrid genetic algorithms for a multiple-objective scheduling problem
    • S. Cavalieri, and P. Gaiardelli Hybrid genetic algorithms for a multiple-objective scheduling problem Journal of Intelligent Manufacturing 9 1998 361 367
    • (1998) Journal of Intelligent Manufacturing , vol.9 , pp. 361-367
    • Cavalieri, S.1    Gaiardelli, P.2
  • 6
    • 0037063773 scopus 로고    scopus 로고
    • The development of gradual-priority weighting approach for the multi-objective flowshop scheduling problem
    • P.-C. Chang, J.-C. Hsieh, and S.-G. Lin The development of gradual-priority weighting approach for the multi-objective flowshop scheduling problem International Journal of Production Economics 79 2002 171 183
    • (2002) International Journal of Production Economics , vol.79 , pp. 171-183
    • Chang, P.-C.1    Hsieh, J.-C.2    Lin, S.-G.3
  • 7
    • 33847658312 scopus 로고    scopus 로고
    • Sub-population genetic algorithm with mining gene structures for multiobjective flowshop scheduling problems
    • P.-C. Chang, S.-H. Chen, and C.-H. Liu Sub-population genetic algorithm with mining gene structures for multiobjective flowshop scheduling problems Expert Systems with Applications 33 2007 762 771
    • (2007) Expert Systems with Applications , vol.33 , pp. 762-771
    • Chang, P.-C.1    Chen, S.-H.2    Liu, C.-H.3
  • 8
    • 55749104384 scopus 로고    scopus 로고
    • Multiobjective permutation flowshop scheduling by an adaptive genetic local search algorithm
    • Cheng, H. C.; Chiang, T. C.; & Fu, L. C. (2008). Multiobjective permutation flowshop scheduling by an adaptive genetic local search algorithm. In IEEE congress on evolutionary computation (pp. 1596-1602).
    • (2008) IEEE Congress on Evolutionary Computation , pp. 1596-1602
    • Cheng, H.C.1    Chiang, T.C.2    Fu, L.C.3
  • 9
    • 55349112552 scopus 로고    scopus 로고
    • A rule-centric memetic algorithm to minimize the number of tardy jobs in the job shop
    • T.C. Chiang, and L.C. Fu A rule-centric memetic algorithm to minimize the number of tardy jobs in the job shop International Journal of Production Research 46 2008 6913 6931
    • (2008) International Journal of Production Research , vol.46 , pp. 6913-6931
    • Chiang, T.C.1    Fu, L.C.2
  • 11
    • 0005871804 scopus 로고    scopus 로고
    • PESA-II: Region-based selection in evolutionary multiobjective optimization
    • L. Spector, E. Goodman, A. Wu, W.B. Langdon, H.-M. Voigt, M. Gen, et al. (Eds.)
    • Corne, D. W.; Jerram, N. R.; Knowles, J. D.; & Oates, M. J. (2001). PESA-II: region-based selection in evolutionary multiobjective optimization. In L. Spector, E. Goodman, A. Wu, W.B. Langdon, H.-M. Voigt, M. Gen, et al. (Eds.), Genetic and evolutionary computation conference, GECCO-2001 (pp. 283-290).
    • (2001) Genetic and Evolutionary Computation Conference, GECCO-2001 , pp. 283-290
    • Corne, D.W.1    Jerram, N.R.2    Knowles, J.D.3    Oates, M.J.4
  • 14
    • 0037120618 scopus 로고    scopus 로고
    • Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimization
    • J.M. Framinan, R. Leisten, and R. Ruiz-Usano Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimization European Journal of Operational Research 141 2002 559 569
    • (2002) European Journal of Operational Research , vol.141 , pp. 559-569
    • Framinan, J.M.1    Leisten, R.2    Ruiz-Usano, R.3
  • 15
    • 7544243412 scopus 로고    scopus 로고
    • Comparison of heuristics for flowtime minimization in permutation flowshops
    • J.M. Framinan, R. Leisten, and R. Ruiz-Usano Comparison of heuristics for flowtime minimization in permutation flowshops Computers and Operations Research 32 2005 1237 1254
    • (2005) Computers and Operations Research , vol.32 , pp. 1237-1254
    • Framinan, J.M.1    Leisten, R.2    Ruiz-Usano, R.3
  • 16
    • 33847245879 scopus 로고    scopus 로고
    • On operators and search space topology in multi-objective flow shop scheduling
    • M.J. Geiger On operators and search space topology in multi-objective flow shop scheduling European Journal of Operational Research 181 2007 195 206
    • (2007) European Journal of Operational Research , vol.181 , pp. 195-206
    • Geiger, M.J.1
  • 17
    • 58149242173 scopus 로고    scopus 로고
    • A discrete particle swarm optimization algorithm for the multiobjective permutation flowshop sequencing problem
    • Cao (Ed.)
    • Guo, W.; Chen, G.; Huang, M.; & Chen, S. (2007). A discrete particle swarm optimization algorithm for the multiobjective permutation flowshop sequencing problem. In Cao (Ed.), Fuzzy information and engineering (Vol. 40, pp. 323-331).
    • (2007) Fuzzy Information and Engineering , vol.40 , pp. 323-331
    • Guo, W.1    Chen, G.2    Huang, M.3    Chen, S.4
  • 18
  • 19
    • 0038273913 scopus 로고    scopus 로고
    • Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling
    • H. Ishibuchi, T. Yoshida, and T. Murata Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling IEEE Transactions on Evolutionary Computation 7 2003 204 223
    • (2003) IEEE Transactions on Evolutionary Computation , vol.7 , pp. 204-223
    • Ishibuchi, H.1    Yoshida, T.2    Murata, T.3
  • 20
    • 0036715683 scopus 로고    scopus 로고
    • Combining convergence and diversity in evolutionary multiobjective optimization
    • M. Laumanns, L. Thiele, K. Deb, and E. Zitzler Combining convergence and diversity in evolutionary multiobjective optimization Evolutionary Computation 10 2002 263 282
    • (2002) Evolutionary Computation , vol.10 , pp. 263-282
    • Laumanns, M.1    Thiele, L.2    Deb, K.3    Zitzler, E.4
  • 22
    • 34249018250 scopus 로고    scopus 로고
    • A hybrid quantum-inspired genetic algorithm for multiobjective flow shop scheduling
    • B.-B. Li, and L. Wang A hybrid quantum-inspired genetic algorithm for multiobjective flow shop scheduling IEEE Transactions on Systems, Man, and Cybernetics - Part B 37 2007 576 591
    • (2007) IEEE Transactions on Systems, Man, and Cybernetics - Part B , vol.37 , pp. 576-591
    • Li, B.-B.1    Wang, L.2
  • 23
    • 61349108680 scopus 로고    scopus 로고
    • A review and evaluation of multi-objective algorithms for the flowshop scheduling problem
    • G. Minella, R. Ruiz, and M. Ciavotta A review and evaluation of multi-objective algorithms for the flowshop scheduling problem INFORMS Journal of Computing 20 2008 451 471
    • (2008) INFORMS Journal of Computing , vol.20 , pp. 451-471
    • Minella, G.1    Ruiz, R.2    Ciavotta, M.3
  • 24
    • 0020699921 scopus 로고
    • A heuristic algorithm for the m-machine, n-job flowshop sequencing problem
    • M. Nawaz, E.E. Enscore Jr.; and I. Ham A heuristic algorithm for the m-machine, n-job flowshop sequencing problem OMEGA 11 1983 91 95
    • (1983) OMEGA , vol.11 , pp. 91-95
    • Nawaz, M.1    Enscore Jr., E.E.2    Ham, I.3
  • 26
    • 29344433807 scopus 로고    scopus 로고
    • A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs
    • T. Pasupathy, C. Rajendran, and R.K. Suresh A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs International Journal of Advanced Manufacturing Technology 27 2006 804 815
    • (2006) International Journal of Advanced Manufacturing Technology , vol.27 , pp. 804-815
    • Pasupathy, T.1    Rajendran, C.2    Suresh, R.K.3
  • 27
    • 0029635352 scopus 로고
    • Heuristics for scheduling in flowshop with multiple objectives
    • C. Rajendran Heuristics for scheduling in flowshop with multiple objectives European Journal of Operational Research 83 1995 540 555
    • (1995) European Journal of Operational Research , vol.83 , pp. 540-555
    • Rajendran, C.1
  • 28
    • 1642559633 scopus 로고    scopus 로고
    • Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs
    • C. Rajendran, and H. Ziegler Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs European Journal of Operational Research 155 2004 426 438
    • (2004) European Journal of Operational Research , vol.155 , pp. 426-438
    • Rajendran, C.1    Ziegler, H.2
  • 29
    • 13444251134 scopus 로고    scopus 로고
    • A comprehensive review and evaluation of permutation flowshop heuristics
    • R. Ruiz, and C. Maroto A comprehensive review and evaluation of permutation flowshop heuristics European Journal of Operational Research 165 2005 479 494
    • (2005) European Journal of Operational Research , vol.165 , pp. 479-494
    • Ruiz, R.1    Maroto, C.2
  • 30
    • 0030192321 scopus 로고    scopus 로고
    • Scheduling in flowshop and cellular manufacturing systems with multiple objectives - A genetic algorithmic approach
    • J. Sridhar, and C. Rajendran Scheduling in flowshop and cellular manufacturing systems with multiple objectives - a genetic algorithmic approach Production Planning and Control 7 1996 374 382
    • (1996) Production Planning and Control , vol.7 , pp. 374-382
    • Sridhar, J.1    Rajendran, C.2
  • 32
    • 84931394603 scopus 로고    scopus 로고
    • A hybrid evolutionary approach for multicriteria optimization problems: Application to the flow shop
    • First international conference on evolutionary multi-criterion optimization, EMO 2001, Springer Heidelberg
    • E.-G. Talbi, M. Rahoual, M.H. Mabed, and C. Dhaenens A hybrid evolutionary approach for multicriteria optimization problems: application to the flow shop First international conference on evolutionary multi-criterion optimization, EMO 2001 LNCS 1993 2001 Springer Heidelberg 416 428
    • (2001) LNCS , vol.1993 , pp. 416-428
    • Talbi, E.-G.1    Rahoual, M.2    Mabed, M.H.3    Dhaenens, C.4
  • 33
    • 62549158707 scopus 로고    scopus 로고
    • A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
    • L.Y. Tseng, and Y-T. Lin A hybrid genetic local search algorithm for the permutation flowshop scheduling problem European Journal of Operational Research 198 2009 84 92
    • (2009) European Journal of Operational Research , vol.198 , pp. 84-92
    • Tseng, L.Y.1    Lin, Y.-T.2
  • 34
    • 13544263208 scopus 로고    scopus 로고
    • A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
    • T.K. Varadharajan, and C. Rajendran A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs European Journal of Operational Research 167 2005 772 795
    • (2005) European Journal of Operational Research , vol.167 , pp. 772-795
    • Varadharajan, T.K.1    Rajendran, C.2
  • 35
    • 58849112643 scopus 로고    scopus 로고
    • Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
    • Y. Zhang, X. Li, and Q. Wang Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization European Journal of Operational Research 196 2009 869 876
    • (2009) European Journal of Operational Research , vol.196 , pp. 869-876
    • Zhang, Y.1    Li, X.2    Wang, Q.3
  • 36
    • 34548108555 scopus 로고    scopus 로고
    • MOEA/D: A multiobjective evolutionary algorithm based on decomposition
    • Q. Zhang, and H. Li MOEA/D: A multiobjective evolutionary algorithm based on decomposition IEEE Transactions on Evolutionary Computation 11 2007 712 731
    • (2007) IEEE Transactions on Evolutionary Computation , vol.11 , pp. 712-731
    • Zhang, Q.1    Li, H.2
  • 38
    • 35048846146 scopus 로고    scopus 로고
    • Indicator-based selection in multiobjective search
    • X. Yao, E. Burke, J.A. Lozano, J. Smith, J.J. Merelo-Guervós, J.A. Bullinaria, et al. (Eds.)
    • Zitzler, E.; & Künzli, S. (2004) Indicator-based selection in multiobjective search. In X. Yao, E. Burke, J.A. Lozano, J. Smith, J.J. Merelo-Guervós, J.A. Bullinaria, et al. (Eds.), Parallel problem solving from nature, PPSN VIII (pp. 832-842).
    • (2004) Parallel Problem Solving from Nature, PPSN VIII , pp. 832-842
    • Zitzler, E.1    Künzli, S.2
  • 39
    • 54449086192 scopus 로고    scopus 로고
    • Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
    • G.I. Zobolas, C.D. Tarantilis, and G. Ioannou Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm Computers and Operations Research 36 2009 1249 1267
    • (2009) Computers and Operations Research , vol.36 , pp. 1249-1267
    • Zobolas, G.I.1    Tarantilis, C.D.2    Ioannou, G.3


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