메뉴 건너뛰기




Volumn , Issue , 2010, Pages 1531-1536

A novel discrete harmony search algorithm for scheduling lot-streaming flow shops

Author keywords

Flow shop scheduling; Harmony search algorithm; Lot streaming; Makespan

Indexed keywords

COMPUTATIONAL SIMULATION; FLOW-SHOP SCHEDULING; HARMONY SEARCH; HARMONY SEARCH ALGORITHMS; INSERT NEIGHBORHOOD; LOCAL SEARCH ALGORITHM; MAKESPAN; SEARCHING ABILITY; SEQUENCE-DEPENDENT SETUP TIME; STREAMING FLOW;

EID: 77955387672     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCDC.2010.5498265     Document Type: Conference Paper
Times cited : (5)

References (20)
  • 2
    • 58149150064 scopus 로고    scopus 로고
    • Threshold accepting and ant-colony optimization algorithm for scheduling m-machine flow shop with lot streaming
    • S. Marimulthu, S. G. Ponnambalam, N. Jawahar, Threshold accepting and ant-colony optimization algorithm for scheduling m-machine flow shop with lot streaming, on Journal of Material Processing Technology, Vol. 209, 1026-1041, 2009.
    • (2009) Journal of Material Processing Technology , vol.209 , pp. 1026-1041
    • Marimulthu, S.1    Ponnambalam, S.G.2    Jawahar, N.3
  • 3
    • 0013356811 scopus 로고    scopus 로고
    • A near-optimal heuristic for the sequencing problem in multiple-batch flow-shops with small equal sublots
    • A. A. Kalir, S.C. Sarin, A near-optimal heuristic for the sequencing problem in multiple-batch flow-shops with small equal sublots, on OMEGA, Vol 29, 577-584, 2001.
    • (2001) OMEGA , vol.29 , pp. 577-584
    • Kalir, A.A.1    Sarin, S.C.2
  • 4
    • 0036833214 scopus 로고    scopus 로고
    • Lot splitting to minimize average flow-time in a two-machine flow-shop
    • J. Bukchin, M. Tzur, M. Jaffer, Lot splitting to minimize average flow-time in a two-machine flow-shop, on IIE Transactions, Vol. 34, 953-970, 2002.
    • (2002) IIE Transactions , vol.34 , pp. 953-970
    • Bukchin, J.1    Tzur, M.2    Jaffer, M.3
  • 5
    • 0026896286 scopus 로고
    • Two- And three-machine flow shop scheduling problems with equal size transfer batches
    • R. G. Vickson, B. E. Alfredsson, Two- and three-machine flow shop scheduling problems with equal size transfer batches, on International Journal of Production Research, Vol. 30, 1551-1574, 1992.
    • (1992) International Journal of Production Research , vol.30 , pp. 1551-1574
    • Vickson, R.G.1    Alfredsson, B.E.2
  • 6
    • 0028698198 scopus 로고
    • Lot streaming in a two-stage flow shop with set-up, processing and removal times separated
    • F. C. Cetinkaya, Lot streaming in a two-stage flow shop with set-up, processing and removal times separated, on Journal of Operational Research Society, Vol. 45, 1445-1455, 1994.
    • (1994) Journal of Operational Research Society , vol.45 , pp. 1445-1455
    • Cetinkaya, F.C.1
  • 7
    • 0029378595 scopus 로고
    • Optimal lot streaming for multiple products in a two-machine flow shop
    • R. G. Vickson, Optimal lot streaming for multiple products in a two-machine flow shop, on European Journal of Operational Research, Vol. 85, 556-575, 1995.
    • (1995) European Journal of Operational Research , vol.85 , pp. 556-575
    • Vickson, R.G.1
  • 8
    • 0033363409 scopus 로고    scopus 로고
    • Lot streaming and scheduling multiple products in two-machine no-wait flowshops
    • C. Sriskandarajah, E. Wagneur, Lot streaming and scheduling multiple products in two-machine no-wait flowshops, on IIE Transactions, Vol. 31, 695-707, 1999.
    • (1999) IIE Transactions , vol.31 , pp. 695-707
    • Sriskandarajah, C.1    Wagneur, E.2
  • 10
    • 0013356811 scopus 로고    scopus 로고
    • A near-optimal heuristic for the sequencing problem in multiple-batch flow-shops with small equal sublots
    • A. A. Kalir, S. C. Sarin, A near-optimal heuristic for the sequencing problem in multiple-batch flow-shops with small equal sublots, on OMEGA, Vol 29, 577-584, 2001.
    • (2001) OMEGA , vol.29 , pp. 577-584
    • Kalir, A.A.1    Sarin, S.C.2
  • 12
    • 0036722525 scopus 로고    scopus 로고
    • An application of genetic algorithms to lot-streaming flow shop scheduling
    • S. H. Yoon, J. A. Ventura, An application of genetic algorithms to lot-streaming flow shop scheduling, on IIE Transactions, Vol. 34, 779-787, 2002.
    • (2002) IIE Transactions , vol.34 , pp. 779-787
    • Yoon, S.H.1    Ventura, J.A.2
  • 13
    • 43849110246 scopus 로고    scopus 로고
    • A discrete particle swarm optimization for lot-streaming flowshop scheduling problem
    • C.T. Tseng, C. J. Liao, A discrete particle swarm optimization for lot-streaming flowshop scheduling problem, on European Journal of Operational Research, Vol. 191, 360-373, 2008.
    • (2008) European Journal of Operational Research , vol.191 , pp. 360-373
    • Tseng, C.T.1    Liao, C.J.2
  • 14
    • 0034974417 scopus 로고    scopus 로고
    • A new heuristic optimization algorithm: Harmony search
    • Z.W. Geem, J. H. Kim, G. V. Loganathan, A new heuristic optimization algorithm: harmony search, on Simulations,Vol. 76, 60-68, 2001.
    • (2001) Simulations , vol.76 , pp. 60-68
    • Geem, Z.W.1    Kim, J.H.2    Loganathan, G.V.3
  • 15
    • 20444466485 scopus 로고    scopus 로고
    • A new meta-heuristic algorithm for continuous engineering optimization, harmony search theory and practice
    • K.S. Lee, Z.W.Geem, A new meta-heuristic algorithm for continuous engineering optimization, harmony search theory and practice, on Comput Methods Appl Mech Eng, Vol. 194, 3902-3933. 2005.
    • (2005) Comput Methods Appl Mech Eng , vol.194 , pp. 3902-3933
    • Lee, K.S.1    Geem, Z.W.2
  • 16
    • 34248141625 scopus 로고    scopus 로고
    • An improved harmony search algorithm for solving optimization problems
    • M.Mahdavi, M.Fesanghary, E. Damangir, An improved harmony search algorithm for solving optimization problems, on Appl Math Comput, Vol. 188, 1567-1579. 2007.
    • (2007) Appl Math Comput , vol.188 , pp. 1567-1579
    • Mahdavi, M.1    Fesanghary, M.2    Damangir, E.3
  • 17
    • 27844531167 scopus 로고    scopus 로고
    • The harmony search heuristic algorithm for discrete structural optimization
    • K.S.Lee, Z.W.Geem, S. H. Lee, K. W. Bae, The harmony search heuristic algorithm for discrete structural optimization, on Eng Optimiz, Vol. 37, 663-684, 2005.
    • (2005) Eng Optimiz , vol.37 , pp. 663-684
    • Lee, K.S.1    Geem, Z.W.2    Lee, S.H.3    Bae, K.W.4
  • 18
    • 33646268618 scopus 로고    scopus 로고
    • Optimal cost design of water distribution networks using harmony search
    • Z.W.Geem, Optimal cost design of water distribution networks using harmony search, on Eng Optimiz, Vol. 38, 259-280, 2006.
    • (2006) Eng Optimiz , vol.38 , pp. 259-280
    • Geem, Z.W.1
  • 19
    • 0037278745 scopus 로고    scopus 로고
    • An effective hybrid heuristic for flow shop scheduling
    • L.Wang, D. Z. Zheng, An effective hybrid heuristic for flow shop scheduling, on Int J Adv Manuf Technol, 21, 38-44, 2003.
    • (2003) Int J Adv Manuf Technol , vol.21 , pp. 38-44
    • Wang, L.1    Zheng, D.Z.2
  • 20
    • 0020699921 scopus 로고
    • A heuristic algorithm for the m-machine, n-job flow shop sequencing problem
    • M. Nawaz, E. E. J. Enscore, I. Ham, A heuristic algorithm for the m-machine, n-job flow shop sequencing problem, on OMEGA, Vol. 11, 91-95, 1983
    • (1983) OMEGA , vol.11 , pp. 91-95
    • Nawaz, M.1    Enscore, E.E.J.2    Ham, I.3


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