메뉴 건너뛰기




Volumn 31, Issue 2, 2012, Pages 232-239

A multi-objective electromagnetism algorithm for a bi-objective flowshop scheduling problem

Author keywords

Bi objective flowshop scheduling; Electromagnetism algorithm; Makespan; Total weighted tardiness; Transportation times

Indexed keywords

ELECTROMAGNETISM ALGORITHM; FLOW-SHOP SCHEDULING; MAKESPAN; TOTAL-WEIGHTED TARDINESS; TRANSPORTATION TIMES;

EID: 84858333711     PISSN: 02786125     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jmsy.2011.08.002     Document Type: Article
Times cited : (50)

References (40)
  • 2
    • 33846594932 scopus 로고    scopus 로고
    • Earliness tardiness production planning and scheduling in flexible flowshop systems under finite planning horizon
    • DOI 10.1016/j.amc.2006.05.188, PII S0096300306007855
    • M. Iranpoor, S.M.T. Fatemi Ghomi, and A. Mohamadinia Earliness tardiness production planning and scheduling in flexible flowshop systems under finite planning horizon Applied Mathematics and Computation 184 2 2007 950 964 (Pubitemid 46176151)
    • (2007) Applied Mathematics and Computation , vol.184 , Issue.2 , pp. 950-964
    • Iranpoor, M.1    Fatemi Ghomi, S.M.T.2    Mohamadinia, A.3
  • 3
    • 25444456205 scopus 로고    scopus 로고
    • A hybrid scatter search/electromagnetism meta-heuristic for project scheduling
    • DOI 10.1016/j.ejor.2004.08.020, PII S0377221704005594, Feature Cluster on Scatter Search Methods for Optimization
    • D. Debels, B.D. Reyck, R. Leus, and M.A. Vanhoucke Hybrid scatter search/electromagnetism meta-heuristic for project scheduling European Journal of Operational Research 169 2006 638 653 (Pubitemid 41375712)
    • (2006) European Journal of Operational Research , vol.169 , Issue.2 , pp. 638-653
    • Debels, D.1    De Reyck, B.2    Leus, R.3    Vanhoucke, M.4
  • 4
    • 72149115421 scopus 로고    scopus 로고
    • Modeling and scheduling a case of flexible flowshops: Total weighted tardiness minimization
    • B. Naderi, M. Zandieh, and M.A.H.A. Shirazi Modeling and scheduling a case of flexible flowshops: total weighted tardiness minimization Computers & Industrial Engineering 57 4 2009 1258 1267
    • (2009) Computers & Industrial Engineering , vol.57 , Issue.4 , pp. 1258-1267
    • Naderi, B.1    Zandieh, M.2    Shirazi, M.A.H.A.3
  • 5
    • 0002434711 scopus 로고
    • A solution to a special case of flow shop scheduling problems
    • S.E. Elmaghraby, Springer New York
    • M.S. Salvador A solution to a special case of flow shop scheduling problems S.E. Elmaghraby, Symposium of the theory of scheduling and its applications 1973 Springer New York 83 91
    • (1973) Symposium of the Theory of Scheduling and Its Applications , pp. 83-91
    • Salvador, M.S.1
  • 7
    • 33745220037 scopus 로고    scopus 로고
    • Flexible flow shop scheduling: Optimum, heuristics and artificial intelligence solutions
    • DOI 10.1111/j.1468-0394.2005.00297.x
    • H. Wang Flexible flowshop scheduling: optimum, heuristics, and artificial intelligence solutions Expert Systems 22 2 2005 78 85 (Pubitemid 43906636)
    • (2005) Expert Systems , vol.22 , Issue.2 , pp. 78-85
    • Wang, H.1
  • 10
    • 0032050653 scopus 로고    scopus 로고
    • The flow shop with parallel machines: A tabu search approach
    • PII S0377221797002609
    • E. Nowicki, and C. Smutnicki The flow shop with parallel machines: a tabu search approach European Journal of Operational Research 106 2-3 1998 226 253 (Pubitemid 128399650)
    • (1998) European Journal of Operational Research , vol.106 , Issue.2-3 , pp. 226-253
    • Nowicki, E.1    Smutnicki, C.2
  • 12
    • 0029224965 scopus 로고
    • A genetic algorithm for flowshop sequencing
    • C.R. Reeves A genetic algorithm for flowshop sequencing Computers & Operations Research 22 1 1995 5 13
    • (1995) Computers & Operations Research , vol.22 , Issue.1 , pp. 5-13
    • Reeves, C.R.1
  • 13
    • 52049091896 scopus 로고    scopus 로고
    • A memetic algorithm for the flexible flow line scheduling problem with processor blocking
    • R. Tavakkoli-Moghaddam, N. Safaei, and F. Sassani A memetic algorithm for the flexible flow line scheduling problem with processor blocking Computers and Operations Research 36 2009 402 414
    • (2009) Computers and Operations Research , vol.36 , pp. 402-414
    • Tavakkoli-Moghaddam, R.1    Safaei, N.2    Sassani, F.3
  • 15
    • 0035314562 scopus 로고    scopus 로고
    • Multicriteria scheduling problems: A survey
    • V. T'kindt, and J.C. Billaut Multicriteria scheduling problems: a survey RAIRO Operation Research 35 2001 143 163
    • (2001) RAIRO Operation Research , vol.35 , pp. 143-163
    • T'Kindt, V.1    Billaut, J.C.2
  • 17
    • 0037410718 scopus 로고    scopus 로고
    • A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines
    • J.K. Cochran, S.M. Horng, and J.W. Fowler A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines Computers and Operations Research 30 2003 1087 1092
    • (2003) Computers and Operations Research , vol.30 , pp. 1087-1092
    • Cochran, J.K.1    Horng, S.M.2    Fowler, J.W.3
  • 18
    • 21244498631 scopus 로고    scopus 로고
    • The Hierarchical Fair Competition (HFC) framework for sustainable Evolutionary Algorithms
    • DOI 10.1162/1063656054088530
    • J. Hu, E. Goodman, K. Seo, Z. Fan, and R. Rosenberg The hierarchical fair competition framework for sustainable evolutionary algorithms Evolutionary Computation 13 2 2005 241 277 (Pubitemid 40892154)
    • (2005) Evolutionary Computation , vol.13 , Issue.2 , pp. 241-277
    • Hu, J.1    Goodman, E.2    Seo, K.3    Fan, Z.4    Rosenberg, R.5
  • 19
    • 4344649636 scopus 로고    scopus 로고
    • Covering Pareto-optimal fronts by subswarms in multiobjective particle swarm optimization
    • S. Mostaghim, and J. Teich Covering Pareto-optimal fronts by subswarms in multiobjective particle swarm optimization Evolutionary Computation 2 2004 1404 1411
    • (2004) Evolutionary Computation , vol.2 , pp. 1404-1411
    • Mostaghim, S.1    Teich, J.2
  • 20
    • 24144460572 scopus 로고    scopus 로고
    • Two-phase sub population genetic algorithm for parallel machine-scheduling problem
    • P.C. Chang, S.H. Chen, and K.L. Lin Two-phase sub population genetic algorithm for parallel machine-scheduling problem Expert Systems with Applications 29 3 2005 705 712
    • (2005) Expert Systems with Applications , vol.29 , Issue.3 , pp. 705-712
    • Chang, P.C.1    Chen, S.H.2    Lin, K.L.3
  • 21
    • 34248197886 scopus 로고    scopus 로고
    • Differential evolution algorithms using hybrid mutation
    • DOI 10.1007/s10589-007-9014-3
    • P. Kaelo, and M.M. Ali Differential evolution algorithms using hybrid mutation Computational Optimization Application 37 2007 231 246 (Pubitemid 46709794)
    • (2007) Computational Optimization and Applications , vol.37 , Issue.2 , pp. 231-246
    • Kaelo, P.1    Ali, M.M.2
  • 23
    • 0035885224 scopus 로고    scopus 로고
    • Makespan minimization for flow-shop problems with transportation times and a single robot
    • DOI 10.1016/S0166-218X(00)00316-4, PII S0166218X00003164
    • J. Hurink, and S. Knust Makespan minimization for flow-shop problems with transportation times and a single robot Discrete Applied Mathematics 112 2001 199 216 (Pubitemid 33676141)
    • (2001) Discrete Applied Mathematics , vol.112 , Issue.1-3 , pp. 199-216
    • Hurink, J.1    Knust, S.2
  • 26
    • 84867922216 scopus 로고    scopus 로고
    • An electromagnetism-like mechanism for global optimization
    • I. Bïrbïl, and S.C. Fang An electromagnetism-like mechanism for global optimization Journal of Global Optimization 25 2003 263 282
    • (2003) Journal of Global Optimization , vol.25 , pp. 263-282
    • Bïrbïl, I.1    Fang, S.C.2
  • 27
    • 37049022197 scopus 로고    scopus 로고
    • An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
    • DOI 10.1016/j.ejor.2006.07.029, PII S0377221706008277
    • R. Ruiz, and T. Stützle An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives European Journal of Operational Research 187 3 2008 1143 1159 (Pubitemid 350245722)
    • (2008) European Journal of Operational Research , vol.187 , Issue.3 , pp. 1143-1159
    • Ruiz, R.1    Stutzle, T.2
  • 28
    • 0000852513 scopus 로고
    • Multi-objective optimization using non-dominated sorting genetic algorithms
    • N. Srinivas, and K. Deb Multi-objective optimization using non-dominated sorting genetic algorithms Evolutionary Computation 2 3 1995 221 248
    • (1995) Evolutionary Computation , vol.2 , Issue.3 , pp. 221-248
    • Srinivas, N.1    Deb, K.2
  • 30
    • 0033318858 scopus 로고    scopus 로고
    • Multiobjective evolutionary algorithms a comparative case study and the strength pareto approach
    • DOI 10.1109/4235.797969
    • E. Zitzler, and L. Thiele Multi-objective evolutionary algorithms: a comparative case study and the strength Pareto approach IEEE Transactions evolutionary Computation 3 1999 257 271 (Pubitemid 30544879)
    • (1999) IEEE Transactions on Evolutionary Computation , vol.3 , Issue.4 , pp. 257-271
    • Zitzler Eckart1    Thiele Lothar2
  • 31
    • 33749042087 scopus 로고    scopus 로고
    • A genetic algorithm approach for multi-objective optimization of supply chain networks
    • DOI 10.1016/j.cie.2006.07.011, PII S0360835206000763, Computational Intelligence and Information Technology: Applications to Industrial Engineering
    • F. Altiparmak, M. Gen, L. Lin, and T. Paksoy A genetic algorithm approach for multi-objective optimization of supply chain networks Computers & Industrial Engineering 51 2006 196 215 (Pubitemid 44466273)
    • (2006) Computers and Industrial Engineering , vol.51 , Issue.1 , pp. 196-215
    • Altiparmak, F.1    Gen, M.2    Lin, L.3    Paksoy, T.4
  • 33
    • 0038661962 scopus 로고    scopus 로고
    • Performance evaluation of acceptance probability functions for multi-objective SA
    • DOI 10.1016/S0305-0548(01)00109-5, PII S0305054801001095
    • H. Kubotani, and K. Yoshimura Performance evaluation of acceptance probability functions for multi-objective SA Computers & Operations Research 30 2003 427 442 (Pubitemid 36650129)
    • (2003) Computers and Operations Research , vol.30 , Issue.3 , pp. 427-442
    • Kubotani, H.1    Yoshimura, K.2
  • 34
    • 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 on Computing 20 2008 451 471
    • (2008) INFORMS Journal on Computing , vol.20 , pp. 451-471
    • Minella, G.1    Ruiz, R.2    Ciavotta, M.3
  • 36
    • 34248139109 scopus 로고    scopus 로고
    • A tutorial on the performance assessment of stochastic multi-objective optimizers
    • Computer Engineering and Networks Laboratory (TIK). ETH Zurich
    • Knowles J, Thiele L, Zitzler E. A tutorial on the performance assessment of stochastic multi-objective optimizers. Technical Report 214. Computer Engineering and Networks Laboratory (TIK). ETH Zurich 2006.
    • (2006) Technical Report 214
    • Knowles, J.1    Thiele, L.2    Zitzler, E.3
  • 37
    • 33847245879 scopus 로고    scopus 로고
    • On operators and search space topology in multi-objective flowshop scheduling
    • M.J. Geiger On operators and search space topology in multi-objective flowshop scheduling European Journal of Operational Research 181 1 2007 195 196
    • (2007) European Journal of Operational Research , vol.181 , Issue.1 , pp. 195-196
    • Geiger, M.J.1
  • 40
    • 0027201278 scopus 로고
    • Benchmarks for basic scheduling problems
    • DOI 10.1016/0377-2217(93)90182-M
    • E. Taillard Benchmarks for basic scheduling problems European Journal of Operational Research 64 2 1993 278 285 (Pubitemid 23599340)
    • (1993) European Journal of Operational Research , vol.64 , Issue.2 , pp. 278-285
    • Taillard, E.1


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