메뉴 건너뛰기




Volumn 170, Issue , 2015, Pages 258-267

A hybrid algorithm for the multi-stage flow shop group scheduling with sequence-dependent setup and transportation times

Author keywords

Genetic algorithms; Group scheduling; Multi stage flow shop; Particle swarm optimization; Sequence dependent setup time

Indexed keywords

ALGORITHMS; GENETIC ALGORITHMS; JOB SHOP SCHEDULING; MACHINE SHOP PRACTICE; PARTICLE SWARM OPTIMIZATION (PSO); PROBLEM SOLVING; SCHEDULING; SCHEDULING ALGORITHMS;

EID: 84959012941     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2015.10.002     Document Type: Article
Times cited : (49)

References (39)
  • 1
    • 0033114757 scopus 로고    scopus 로고
    • A review of scheduling research involving setup considerations
    • A. Allahverdi, J.N.D. Gupta, and T. Aldowaisian A review of scheduling research involving setup considerations Omega 27 1999 219 239
    • (1999) Omega , vol.27 , pp. 219-239
    • Allahverdi, A.1    Gupta, J.N.D.2    Aldowaisian, T.3
  • 2
  • 3
    • 0025256245 scopus 로고
    • Scheduling groups of jobs in the two machine flowshop
    • K.R. Baker Scheduling groups of jobs in the two machine flowshop Math. Comput. Model 13 1990 29 36
    • (1990) Math. Comput. Model , vol.13 , pp. 29-36
    • Baker, K.R.1
  • 4
    • 0037449244 scopus 로고    scopus 로고
    • Genetic and Nelder-Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions
    • R. Chelouah, and P. Siarry Genetic and Nelder-Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions Eur. J. Oper. Res. 148 2 2003 335 348
    • (2003) Eur. J. Oper. Res. , vol.148 , Issue.2 , pp. 335-348
    • Chelouah, R.1    Siarry, P.2
  • 5
    • 0000647451 scopus 로고    scopus 로고
    • A review of flowshop scheduling research with setup times
    • T.C.E. Cheng, J.N.D. Gupta, and G. Wang A review of flowshop scheduling research with setup times Prod. Oper. Manag. 9 2000 262 282
    • (2000) Prod. Oper. Manag. , vol.9 , pp. 262-282
    • Cheng, T.C.E.1    Gupta, J.N.D.2    Wang, G.3
  • 6
    • 76349096683 scopus 로고    scopus 로고
    • Scheduling problems with deteriorating jobs and learning effects including proportional setup times
    • T.C.E. Cheng, W.C. Lee, and C.C. Wu Scheduling problems with deteriorating jobs and learning effects including proportional setup times Comput. Ind. Eng. 58 2010 326 331
    • (2010) Comput. Ind. Eng. , vol.58 , pp. 326-331
    • Cheng, T.C.E.1    Lee, W.C.2    Wu, C.C.3
  • 7
    • 78650264629 scopus 로고    scopus 로고
    • Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times
    • T.C.E. Cheng, W.C. Lee, and C.C. Wu Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times Appl. Math. Model. 35 2011 1861 1867
    • (2011) Appl. Math. Model. , vol.35 , pp. 1861-1867
    • Cheng, T.C.E.1    Lee, W.C.2    Wu, C.C.3
  • 8
    • 84964291419 scopus 로고    scopus 로고
    • International Scientific and Technical Encyclopedia
    • ISTE publishing company London, UK
    • M. Clerc Particle Swarm Optimization 2006 ISTE (International Scientific and Technical Encyclopedia) publishing company London, UK
    • (2006) Particle Swarm Optimization
    • Clerc, M.1
  • 9
    • 20344369817 scopus 로고    scopus 로고
    • An algorithm for scheduling batches of parts in a multi-cell flexible manufacturing system
    • S.R. Das, and C. Canel An algorithm for scheduling batches of parts in a multi-cell flexible manufacturing system Int. J. Prod. Econ. 97 3 2005 247 262
    • (2005) Int. J. Prod. Econ. , vol.97 , Issue.3 , pp. 247-262
    • Das, S.R.1    Canel, C.2
  • 10
    • 33947119065 scopus 로고    scopus 로고
    • Hybrid simplex search and particle swarm optimization for unconstrained optimization problems
    • S.F. Fan, and E. Zahara Hybrid simplex search and particle swarm optimization for unconstrained optimization problems Eur. J. Oper. Res. 181 2 2007 527 548
    • (2007) Eur. J. Oper. Res. , vol.181 , Issue.2 , pp. 527-548
    • Fan, S.F.1    Zahara, E.2
  • 11
    • 14644435008 scopus 로고    scopus 로고
    • Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups
    • P.M. Franca, J.N.D. Gupta, A.S. Mendes, P. Moscato, and K.J. Veltink Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups Comput. Ind. Eng. 48 3 2005 491 506
    • (2005) Comput. Ind. Eng. , vol.48 , Issue.3 , pp. 491-506
    • Franca, P.M.1    Gupta, J.N.D.2    Mendes, A.S.3    Moscato, P.4    Veltink, K.J.5
  • 12
    • 0030130032 scopus 로고    scopus 로고
    • An evaluation of group scheduling heuristics in a flow-line manufacturing cell
    • G.V. Frazier An evaluation of group scheduling heuristics in a flow-line manufacturing cell Int. J. Prod. Res. 34 4 1996 959 976
    • (1996) Int. J. Prod. Res. , vol.34 , Issue.4 , pp. 959-976
    • Frazier, G.V.1
  • 13
    • 0016952078 scopus 로고
    • The complexity of flowshop and jobshop scheduling
    • M.D. Garey, D.S. Johnson, and R. Sethi The complexity of flowshop and jobshop scheduling Math. Oper. Res. 1 2 1976 117 129
    • (1976) Math. Oper. Res. , vol.1 , Issue.2 , pp. 117-129
    • Garey, M.D.1    Johnson, D.S.2    Sethi, R.3
  • 17
    • 84942784536 scopus 로고    scopus 로고
    • Heuristics and metaheuristics for the distributed assembly permutation flowshop scheduling problem with sequence dependent setup times
    • S. Hatami, R. Ruiz, and C. Andrés-Romano Heuristics and metaheuristics for the distributed assembly permutation flowshop scheduling problem with sequence dependent setup times Int. J. Prod. Econ. 169 2015 76 88
    • (2015) Int. J. Prod. Econ. , vol.169 , pp. 76-88
    • Hatami, S.1    Ruiz, R.2    Andrés-Romano, C.3
  • 18
    • 37349074079 scopus 로고    scopus 로고
    • Meta-heuristics for scheduling a flowshop manufacturing cell with sequence dependent family setup times
    • H. Hendizadeh, H. Faramarzi, S.A. Mansouri., J.N.D. Gupta, and T.Y. Elmekkawy Meta-heuristics for scheduling a flowshop manufacturing cell with sequence dependent family setup times Int. J. Prod. Econ. 111 2008 593 605
    • (2008) Int. J. Prod. Econ. , vol.111 , pp. 593-605
    • Hendizadeh, H.1    Faramarzi, H.2    Mansouri, S.A.3    Gupta, J.N.D.4    Elmekkawy, T.Y.5
  • 19
    • 37249009707 scopus 로고    scopus 로고
    • A hybrid genetic algorithm and particle swarm optimization for multimodal functions
    • Y.T. Kao, and E. Zahara A hybrid genetic algorithm and particle swarm optimization for multimodal functions Appl. Soft Comput. 8 2008 849 857
    • (2008) Appl. Soft Comput. , vol.8 , pp. 849-857
    • Kao, Y.T.1    Zahara, E.2
  • 21
    • 84869795702 scopus 로고    scopus 로고
    • A new encoding scheme based hybrid algorithm for minimizing two-machine flow shop group scheduling problem
    • C.D. Liou, Y.C. Hsieh, and Y.Y. Chen A new encoding scheme based hybrid algorithm for minimizing two-machine flow shop group scheduling problem Int. J. Syst. Sci. 44 1 2013 77 93
    • (2013) Int. J. Syst. Sci. , vol.44 , Issue.1 , pp. 77-93
    • Liou, C.D.1    Hsieh, Y.C.2    Chen, Y.Y.3
  • 22
    • 38749118677 scopus 로고    scopus 로고
    • An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
    • B. Liu, L. Wang, and Y.H. Jin An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers Comput. Oper. Res. 35 9 2008 2791 2806
    • (2008) Comput. Oper. Res. , vol.35 , Issue.9 , pp. 2791-2806
    • Liu, B.1    Wang, L.2    Jin, Y.H.3
  • 24
    • 33644858890 scopus 로고    scopus 로고
    • Sequence-dependent group scheduling problems in flexible flow shops
    • R. Logendran, P. deSzoeke, and F. Barnard Sequence-dependent group scheduling problems in flexible flow shops Int. J. Prod. Econ. 102 2006 66 86
    • (2006) Int. J. Prod. Econ. , vol.102 , pp. 66-86
    • Logendran, R.1    DeSzoeke, P.2    Barnard, F.3
  • 25
    • 21444451875 scopus 로고    scopus 로고
    • Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups
    • R. Logendran, N. Salmasi, and C. Sriskandarajah Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups Comput. Oper. Res. 33 1 2006 158 180
    • (2006) Comput. Oper. Res. , vol.33 , Issue.1 , pp. 158-180
    • Logendran, R.1    Salmasi, N.2    Sriskandarajah, C.3
  • 26
    • 84922672315 scopus 로고    scopus 로고
    • Simulation optimization for the stochastic economic lot scheduling problem with sequence-dependent setup times
    • N. Löhndorf, M. Riel, and S. Minner Simulation optimization for the stochastic economic lot scheduling problem with sequence-dependent setup times Int. J. Prod. Econ. 157 2014 170 176
    • (2014) Int. J. Prod. Econ. , vol.157 , pp. 170-176
    • Löhndorf, N.1    Riel, M.2    Minner, S.3
  • 27
    • 0041763613 scopus 로고
    • On 2×n sequencing problem with transportation times of jobs
    • P.L. Maggu, and G. Das On 2×n sequencing problem with transportation times of jobs Pure Appl. Math. 12 1980 1 6
    • (1980) Pure Appl. Math. , vol.12 , pp. 1-6
    • Maggu, P.L.1    Das, G.2
  • 28
    • 0030241443 scopus 로고    scopus 로고
    • Genetic algorithms for flows shop scheduling problems
    • T. Murata, H. Ishibuchi, and H. Tanaka Genetic algorithms for flows shop scheduling problems Comput. Ind. Eng. 30 4 1996 1061 1071
    • (1996) Comput. Ind. Eng. , vol.30 , Issue.4 , pp. 1061-1071
    • Murata, T.1    Ishibuchi, H.2    Tanaka, H.3
  • 29
    • 84857864977 scopus 로고    scopus 로고
    • Permutation flowshops in group scheduling with sequence-dependent setup times
    • B. Naderi, and N. Salmasi Permutation flowshops in group scheduling with sequence-dependent setup times Eur. J. Ind. Eng. 6 2 2012 177 198
    • (2012) Eur. J. Ind. Eng. , vol.6 , Issue.2 , pp. 177-198
    • Naderi, B.1    Salmasi, N.2
  • 31
    • 68249091110 scopus 로고    scopus 로고
    • Total flow time minimization in a flowshop sequence-dependent group scheduling problem
    • N. Salmasi, R. Logendran, and M. Reza Skandari Total flow time minimization in a flowshop sequence-dependent group scheduling problem Comput. Oper. Res. 37 1 2010 199 212
    • (2010) Comput. Oper. Res. , vol.37 , Issue.1 , pp. 199-212
    • Salmasi, N.1    Logendran, R.2    Reza Skandari, M.3
  • 32
    • 80053567242 scopus 로고    scopus 로고
    • Makespan minimization in a flowshop sequence-dependent group scheduling problem
    • N. Salmasi, R. Logendran, and M.R. Skandari Makespan minimization in a flowshop sequence-dependent group scheduling problem Int. J. Adv. Manuf. Technol. 56 2011 699 710
    • (2011) Int. J. Adv. Manuf. Technol. , vol.56 , pp. 699-710
    • Salmasi, N.1    Logendran, R.2    Skandari, M.R.3
  • 33
    • 0033720051 scopus 로고    scopus 로고
    • Scheduling a flowline manufacturing cell with sequence dependent family setup times
    • J.E. Schaller, J.N.D. Gupta, and A.J. Vakharia Scheduling a flowline manufacturing cell with sequence dependent family setup times Eur. J. Oper. Res. 125 2 2000 324 339
    • (2000) Eur. J. Oper. Res. , vol.125 , Issue.2 , pp. 324-339
    • Schaller, J.E.1    Gupta, J.N.D.2    Vakharia, A.J.3
  • 34
    • 37349049252 scopus 로고    scopus 로고
    • Scheduling on a single machine with family setups to minimize total tardiness
    • J. Schaller Scheduling on a single machine with family setups to minimize total tardiness Int. J. Prod. Econ. 105 2 2007 329 344
    • (2007) Int. J. Prod. Econ. , vol.105 , Issue.2 , pp. 329-344
    • Schaller, J.1
  • 35
    • 29944431867 scopus 로고    scopus 로고
    • A heuristic to minimize makespan of cell scheduling problem
    • M. Solimanpur, P. Vrat, and R. Shankar A heuristic to minimize makespan of cell scheduling problem Int. J. Prod. Econ. 88 3 2004 231 241
    • (2004) Int. J. Prod. Econ. , vol.88 , Issue.3 , pp. 231-241
    • Solimanpur, M.1    Vrat, P.2    Shankar, R.3
  • 36
    • 84872775734 scopus 로고    scopus 로고
    • Parallel machine scheduling with splitting jobs by a hybrid differential evolution algorithm
    • W.L. Wang, H.Y. Wang, Y.W. Zhao, L.P. Zhang, and X.L. Xu Parallel machine scheduling with splitting jobs by a hybrid differential evolution algorithm Comput. Oper. Res. 40 5 2013 1196 1206
    • (2013) Comput. Oper. Res. , vol.40 , Issue.5 , pp. 1196-1206
    • Wang, W.L.1    Wang, H.Y.2    Zhao, Y.W.3    Zhang, L.P.4    Xu, X.L.5
  • 37
    • 67349224105 scopus 로고    scopus 로고
    • Heuristics for parallel-machine scheduling with job class setups and delivery to multiple customers
    • X. Wang, and T.C.E. Cheng Heuristics for parallel-machine scheduling with job class setups and delivery to multiple customers Int. J. Prod. Econ. 119 2009 199 206
    • (2009) Int. J. Prod. Econ. , vol.119 , pp. 199-206
    • Wang, X.1    Cheng, T.C.E.2
  • 38
    • 0034079033 scopus 로고    scopus 로고
    • Two-machine flowshop group scheduling problem
    • D.L. Yang, and M.S. Chern Two-machine flowshop group scheduling problem Comput. Oper. Res. 27 10 1999 975 985
    • (1999) Comput. Oper. Res. , vol.27 , Issue.10 , pp. 975-985
    • Yang, D.L.1    Chern, M.S.2
  • 39
    • 33748492325 scopus 로고    scopus 로고
    • Scheduling and lot sizing with sequence-dependent setups: A literature review
    • X. Zhu, and W.E. Wilhelm Scheduling and lot sizing with sequence-dependent setups: a literature review IIE Trans. 38 2006 987 1007
    • (2006) IIE Trans. , vol.38 , pp. 987-1007
    • Zhu, X.1    Wilhelm, W.E.2


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