메뉴 건너뛰기




Volumn 129, Issue 1, 2011, Pages 14-22

A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search

Author keywords

Flexible job shop scheduling; Local search; Multi objective optimization; Particle swarm optimization

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; COMMUNICATION BEHAVIOR; EVOLUTIONARY COMPUTATION TECHNIQUES; FLEXIBLE JOB-SHOP PROBLEM; FLEXIBLE JOB-SHOP SCHEDULING; FLEXIBLE JOB-SHOP SCHEDULING PROBLEM; JOB SHOP SCHEDULING PROBLEMS; JOB-SHOP; LOCAL SEARCH; LOCAL SEARCH ALGORITHM; MULTI OBJECTIVE; NEW APPROACHES; PARTICLE SWARM; PARTICLE SWARM ALGORITHM;

EID: 78649330971     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2010.08.004     Document Type: Article
Times cited : (316)

References (27)
  • 1
    • 0037146442 scopus 로고    scopus 로고
    • Linguistic-based meta-heuristic optimization model for flexible job shop scheduling
    • A. Baykasolu Linguistic-based meta-heuristic optimization model for flexible job shop scheduling International Journal of Production Research 40 2002 4523 4543
    • (2002) International Journal of Production Research , vol.40 , pp. 4523-4543
    • Baykasolu, A.1
  • 2
    • 4944252227 scopus 로고    scopus 로고
    • Using multiple objective tabu search and grammars to model and solve multi-objective flexible job shop scheduling problems
    • A. Baykasolu, L. zbakir, and A. Snmez Using multiple objective tabu search and grammars to model and solve multi-objective flexible job shop scheduling problems Journal of Intelligent Manufacturing 15 2004 777 785
    • (2004) Journal of Intelligent Manufacturing , vol.15 , pp. 777-785
    • Baykasolu, A.1    Zbakir, L.2    Snmez, A.3
  • 3
    • 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 Annals of Operations Research 41 1993 157 183
    • (1993) Annals of Operations Research , vol.41 , pp. 157-183
    • Brandimarte, P.1
  • 4
    • 0025531716 scopus 로고
    • Job-shop scheduling with multi-purpose machines
    • P. Brucker, and R. Schlie Job-shop scheduling with multi-purpose machines Computing 45 1990 369 375
    • (1990) Computing , vol.45 , pp. 369-375
    • Brucker, P.1    Schlie, R.2
  • 7
    • 0042261208 scopus 로고    scopus 로고
    • An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
    • S. Dauzre-Prs, and J. Paulli An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search Annals of Operations Research 70 1997 281 306
    • (1997) Annals of Operations Research , vol.70 , pp. 281-306
    • Dauzre-Prs, S.1    Paulli, J.2
  • 9
    • 38749142590 scopus 로고    scopus 로고
    • A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
    • J. Gao, L. Sun, and M. Gen A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems Computers and Operations Research 35 2008 2892 2907
    • (2008) Computers and Operations Research , vol.35 , pp. 2892-2907
    • Gao, J.1    Sun, L.2    Gen, M.3
  • 13
    • 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 Operations Research Spectrum 15 1994 205 215
    • (1994) Operations Research Spectrum , vol.15 , pp. 205-215
    • Hurink, J.1    Jurisch, B.2    Thole, M.3
  • 14
    • 0036464279 scopus 로고    scopus 로고
    • Approach by localization and multi objective evolutionary optimization for flexible job-shop scheduling problems
    • I. Kacem, S. Hammadi, and P. Borne Approach by localization and multi objective evolutionary optimization for flexible job-shop scheduling problems IEEE Transactions on Systems, Man, and Cybernetics 2002 1 13
    • (2002) IEEE Transactions on Systems, Man, and Cybernetics , pp. 1-13
    • Kacem, I.1    Hammadi, S.2    Borne, P.3
  • 15
    • 0037201140 scopus 로고    scopus 로고
    • Pareto-optimality approach for flexible job-shop scheduling problems. Hybridization of evolutionary algorithms and fuzzy logic
    • I. Kacem, S. Hammadi, and P. Borne Pareto-optimality approach for flexible job-shop scheduling problems. Hybridization of evolutionary algorithms and fuzzy logic Mathematics and Computers in Simulation 60 2002 245 276
    • (2002) Mathematics and Computers in Simulation , vol.60 , pp. 245-276
    • Kacem, I.1    Hammadi, S.2    Borne, P.3
  • 17
    • 0002577337 scopus 로고    scopus 로고
    • Effective neighborhood functions for the flexible job shop problem
    • M. Mastrolilli, and L.M. Gambardella Effective neighborhood functions for the flexible job shop problem Journal of Scheduling 3 2002 3 20
    • (2002) Journal of Scheduling , vol.3 , pp. 3-20
    • Mastrolilli, M.1    Gambardella, L.M.2
  • 18
    • 0035719796 scopus 로고    scopus 로고
    • An integrated greedy heuristic for a flexible job shop scheduling problem
    • Man and Cybernetics
    • Mati, Y., Rezg, N., Xie, X., 2001. An integrated greedy heuristic for a flexible job shop scheduling problem. IEEE International Conference on Systems, Man and Cybernetics,25342539.
    • (2001) IEEE International Conference on Systems , pp. 2534-2539
    • Mati, Y.1    Rezg, N.2    Xie, X.3
  • 19
    • 84942162725 scopus 로고    scopus 로고
    • Strategies for finding local guides in multi-objective particle swarm optimization (MOPSO)
    • Mostaghim, S., Teich, J.R., 2003. Strategies for finding local guides in multi-objective particle swarm optimization (MOPSO). In Proceedings of the IEEE Swarm Intelligence Symposium, pp. 2633.
    • (2003) Proceedings of the IEEE Swarm Intelligence Symposium , pp. 26-33
    • Mostaghim, S.1    Teich, J.R.2
  • 20
    • 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 Computers and Industrial Engineering 54 2008 453 473
    • (2008) Computers and Industrial Engineering , vol.54 , pp. 453-473
    • Tay, J.C.1    Ho, N.B.2
  • 21
    • 77955467320 scopus 로고    scopus 로고
    • A genetic local search algorithm for minimizing total flow time in the permutation flow shop scheduling problem
    • Tseng, L.Y., Lin, Y.T., 2010. A genetic local search algorithm for minimizing total flow time in the permutation flow shop scheduling problem. International Journal of Production Economics 127(1), 121128
    • (2010) International Journal of Production Economics , vol.127 , Issue.1 , pp. 121-128
    • Tseng, L.Y.1    Lin, Y.T.2
  • 23
    • 17444376021 scopus 로고    scopus 로고
    • Multiagent scheduling method with earliness and tardiness objectives in flexible job shops
    • Z. Wu, and M.X. Weng Multiagent scheduling method with earliness and tardiness objectives in flexible job shops IEEE Transactions on System, Man, and Cybernetics-Part B 35 2 2005 293 301
    • (2005) IEEE Transactions on System, Man, and Cybernetics-Part B , vol.35 , Issue.2 , pp. 293-301
    • Wu, Z.1    Weng, M.X.2
  • 24
    • 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
    • W. Xia, and Z. Wu An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems Computers and Industrial Engineering 48 2005 409 425 (Pubitemid 40274933)
    • (2005) Computers and Industrial Engineering , vol.48 , Issue.2 , pp. 409-425
    • Xia, W.1    Wu, Z.2
  • 25
    • 53749102032 scopus 로고    scopus 로고
    • Multi-objective flexible job shop schedule: Design and evaluation by simulation modeling
    • L-N. Xing, Y-W. Chen, and K-W. Yang Multi-objective flexible job shop schedule: design and evaluation by simulation modeling Applied Soft Computing 9 2009 362 376
    • (2009) Applied Soft Computing , vol.9 , pp. 362-376
    • Xing, L.-N.1    Chen, Y.-W.2    Yang, K.-W.3
  • 26
    • 67349126259 scopus 로고    scopus 로고
    • An efficient search method for multi-objective flexible job shop scheduling problems
    • L-N. Xing, Y-W. Chen, and K-W. Yang An efficient search method for multi-objective flexible job shop scheduling problems Journal of Intelligent Manufacturing 20 3 2009 283 293
    • (2009) Journal of Intelligent Manufacturing , vol.20 , Issue.3 , pp. 283-293
    • Xing, L.-N.1    Chen, Y.-W.2    Yang, K.-W.3
  • 27
    • 67349174559 scopus 로고    scopus 로고
    • An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem
    • G. Zhang, X. Shao, P. Li, and L. Gao An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem Computers and Industrial Engineering 56 4 2009 1309 1318
    • (2009) Computers and Industrial Engineering , vol.56 , Issue.4 , pp. 1309-1318
    • Zhang, G.1    Shao, X.2    Li, P.3    Gao, L.4


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