메뉴 건너뛰기




Volumn 181, Issue 12, 2011, Pages 2455-2468

A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem

Author keywords

Artificial bee colony algorithm; Flow shop scheduling; Lot streaming; Weighted earliness and tardiness criterion

Indexed keywords

ARTIFICIAL BEE COLONIES; DISCRETE OPERATORS; EARLIEST DUE DATES; EFFECTIVE PERFORMANCE; FLOW SHOP SCHEDULING; FOOD SOURCES; INITIAL POPULATION; LOCAL SEARCH; LOT-STREAMING; LOT-STREAMING FLOW SHOPS; SELF-ADAPTIVE STRATEGY; SLACK TIME; SWAP OPERATORS; WEIGHTED EARLINESS;

EID: 79953031480     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2009.12.025     Document Type: Article
Times cited : (559)

References (29)
  • 2
    • 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 Journal of Operational Research Society 45 1994 1445 1455
    • (1994) Journal of Operational Research Society , vol.45 , pp. 1445-1455
    • Cetinkaya, F.C.1
  • 4
    • 0013356811 scopus 로고    scopus 로고
    • A near-optimal heuristic for the sequencing problem in multiple-batch flow-shops with small equal sublots
    • DOI 10.1016/S0305-0483(01)00046-9, PII S0305048301000469
    • A.A. Kalir, and S.C. Sarin A near-optimal heuristic for the sequencing problem in multiple-batch flow-shops with small equal sublots Omega 29 2001 577 584 (Pubitemid 33628772)
    • (2001) Omega , vol.29 , Issue.6 , pp. 577-584
    • Kalir, A.A.1    Sarin, S.C.2
  • 5
    • 67349287577 scopus 로고    scopus 로고
    • Structural inverse analysis by hybrid simplex artificial bee colony algorithms
    • F. Kang, J. Li, and Q. Xu Structural inverse analysis by hybrid simplex artificial bee colony algorithms Computers and Structures 87 2009 861 870
    • (2009) Computers and Structures , vol.87 , pp. 861-870
    • Kang, F.1    Li, J.2    Xu, Q.3
  • 6
    • 64149103429 scopus 로고    scopus 로고
    • A new design method based on artificial bee colony algorithm for digital IIR filters
    • N. Karaboga A new design method based on artificial bee colony algorithm for digital IIR filters Journal of the Franklin Institute 346 4 2009 328 348
    • (2009) Journal of the Franklin Institute , vol.346 , Issue.4 , pp. 328-348
    • Karaboga, N.1
  • 7
    • 34548479029 scopus 로고    scopus 로고
    • On the performance of artificial bee colony (ABC) algorithm
    • DOI 10.1016/j.asoc.2007.05.007, PII S1568494607000531
    • N. Karaboga, and B. Basturk On the performance of artificial bee colony (ABC) algorithm Applied Soft Computing 8 2008 687 697 (Pubitemid 47374599)
    • (2008) Applied Soft Computing Journal , vol.8 , Issue.1 , pp. 687-697
    • Karaboga, D.1    Basturk, B.2
  • 9
    • 35148827874 scopus 로고    scopus 로고
    • An idea based on honey bee swarm for numerical optimization
    • Computer Engineering Department, Erciyes University, Turkey
    • D. Karaboga, An idea based on honey bee swarm for numerical optimization, Technical Report TR06, Computer Engineering Department, Erciyes University, Turkey, 2005.
    • (2005) Technical Report TR06
    • Karaboga, D.1
  • 10
    • 35148821762 scopus 로고    scopus 로고
    • A powerful and efficient algorithm for numerical function optimization: Artificial bee colony (ABC) algorithm
    • DOI 10.1007/s10898-007-9149-x
    • D. Karaboga, and B. Basturk A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm Journal of Global Optimization 39 2007 459 471 (Pubitemid 47551831)
    • (2007) Journal of Global Optimization , vol.39 , Issue.3 , pp. 459-471
    • Karaboga, D.1    Basturk, B.2
  • 11
    • 84985755271 scopus 로고
    • Optimal and heuristic models for lot splitting in a flow shop
    • D.H. Kropp, and T.L. Smunt Optimal and heuristic models for lot splitting in a flow shop Decision Sciences 21 1990 691 709
    • (1990) Decision Sciences , vol.21 , pp. 691-709
    • Kropp, D.H.1    Smunt, T.L.2
  • 13
    • 69549116446 scopus 로고    scopus 로고
    • Some single-machine and m-machine flow shop scheduling problems with learning considerations
    • W.C. Lee, and C.C. Wu Some single-machine and m-machine flow shop scheduling problems with learning considerations Information Sciences 179 2009 3885 3892
    • (2009) Information Sciences , vol.179 , pp. 3885-3892
    • Lee, W.C.1    Wu, C.C.2
  • 14
    • 33847609606 scopus 로고    scopus 로고
    • A discrete version of particle swarm optimization for flowshop scheduling problems
    • DOI 10.1016/j.cor.2005.11.017, PII S0305054805003643
    • C.J. Liao, C.T. Tseng, and P. Luarn A discrete version of particle swarm optimization for flow shop scheduling problem Computers and Operations Research 34 2007 3099 3111 (Pubitemid 46356739)
    • (2007) Computers and Operations Research , vol.34 , Issue.10 , pp. 3099-3111
    • Liao, C.-J.1    Chao-Tang Tseng2    Luarn, P.3
  • 15
    • 34948883349 scopus 로고    scopus 로고
    • Evolutionary algorithms for scheduling m-machine flow shop with lot streaming
    • DOI 10.1016/j.rcim.2006.06.007, PII S0736584506001086
    • S. Marimulthu, S.G. Ponnambalam, and N. Jawahar Evolutionary algorithms for scheduling m-machine flow shop with lot streaming Robotics and Computer-Integrated Manufacturing 24 2008 125 139 (Pubitemid 47532342)
    • (2008) Robotics and Computer-Integrated Manufacturing , vol.24 , Issue.1 , pp. 125-139
    • Marimuthu, S.1    Ponnambalam, S.G.2    Jawahar, N.3
  • 16
    • 58149150064 scopus 로고    scopus 로고
    • Threshold accepting and Ant-colony optimization algorithm for scheduling m-machine flow shop with lot streaming
    • S. Marimuthu, S.G. Ponnambalam, and N. Jawahar Threshold accepting and Ant-colony optimization algorithm for scheduling m-machine flow shop with lot streaming Journal of Material Processing Technology 209 2009 1026 1041
    • (2009) Journal of Material Processing Technology , vol.209 , pp. 1026-1041
    • Marimuthu, S.1    Ponnambalam, S.G.2    Jawahar, N.3
  • 17
    • 0024925432 scopus 로고
    • Flow shop scheduling with lot streaming
    • DOI 10.1016/0167-6377(89)90013-8
    • C.N. Potts, and K.K. Baker Flow shop scheduling with lot streaming Operation Research Letters 8 1989 297 303 (Pubitemid 20667535)
    • (1989) Operations Research Letters , vol.8 , Issue.6 , pp. 297-303
    • Potts, C.N.1    Baker, K.R.2
  • 18
    • 84974861854 scopus 로고
    • Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity
    • C.N. Potts, and W.L.N. Van Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity Journal of the Operational Research Society 43 1992 395 406
    • (1992) Journal of the Operational Research Society , vol.43 , pp. 395-406
    • Potts, C.N.1    Van, W.L.N.2
  • 19
    • 34548237317 scopus 로고    scopus 로고
    • A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: Weighted mean completion time and weighted mean tardiness
    • T.M. Reza, R.V. Alireza, and H.M. Ali A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness Information Sciences 177 22 2007 5072 5090
    • (2007) Information Sciences , vol.177 , Issue.22 , pp. 5072-5090
    • Reza, T.M.1    Alireza, R.V.2    Ali, H.M.3
  • 21
    • 58549117667 scopus 로고    scopus 로고
    • An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem
    • A. Singh An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem Applied Soft Computing 9 2009 625 631
    • (2009) Applied Soft Computing , vol.9 , pp. 625-631
    • Singh, A.1
  • 22
    • 0033363409 scopus 로고    scopus 로고
    • Lot streaming and scheduling multiple products in two-machine no-wait flowshops
    • DOI 10.1023/A:1007643210135
    • C. Sriskandarajah, and E. Wagneur Lot streaming and scheduling multiple products in two-machine no-wait flow shops IIE Transactions 31 1999 695 707 (Pubitemid 30499398)
    • (1999) IIE Transactions (Institute of Industrial Engineers) , vol.31 , Issue.8 , pp. 695-707
    • Sriskandarajah, C.1    Wagneur, E.2
  • 23
    • 43849110246 scopus 로고    scopus 로고
    • A discrete particle swarm optimization for lot-streaming flow shop scheduling problem
    • C.T. Tseng, and C.J. Liao A discrete particle swarm optimization for lot-streaming flow shop scheduling problem European Journal of Operational Research 191 2008 360 373
    • (2008) European Journal of Operational Research , vol.191 , pp. 360-373
    • Tseng, C.T.1    Liao, C.J.2
  • 24
    • 0026896286 scopus 로고
    • Two- and three-machine flow shop scheduling problems with equal size transfer batches
    • R.G. Vickson, and B.E. Alfredsson Two- and three-machine flow shop scheduling problems with equal size transfer batches International Journal of Production Research 30 1992 1551 1574
    • (1992) International Journal of Production Research , vol.30 , pp. 1551-1574
    • Vickson, R.G.1    Alfredsson, B.E.2
  • 25
    • 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 European Journal of Operational Research 85 1995 556 575
    • (1995) European Journal of Operational Research , vol.85 , pp. 556-575
    • Vickson, R.G.1
  • 27
    • 67349130285 scopus 로고    scopus 로고
    • Some scheduling problems with general position-dependent and time-dependent learning effects
    • Y.Q. Yin, D.H. Xu, K.B. Sun, and H.X. Li Some scheduling problems with general position-dependent and time-dependent learning effects Information Sciences 179 2009 2416 2425
    • (2009) Information Sciences , vol.179 , pp. 2416-2425
    • Yin, Y.Q.1    Xu, D.H.2    Sun, K.B.3    Li, H.X.4
  • 28
    • 0036722525 scopus 로고    scopus 로고
    • An application of genetic algorithms to lot-streaming flow shop scheduling
    • DOI 10.1023/A:1015596621196, Operations Engineering on Large-scale Optimization
    • S.H. Yoon, and J.A. Ventura An application of genetic algorithms to lot-streaming flow shop scheduling IIE Transactions 34 2002 779 787 (Pubitemid 34732107)
    • (2002) IIE Transactions (Institute of Industrial Engineers) , vol.34 , Issue.9 , pp. 779-787
    • Yoon, S.-H.1    Ventura, J.A.2
  • 29
    • 0036722157 scopus 로고    scopus 로고
    • Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling
    • DOI 10.1016/S0305-0548(01)00032-6, PII S0305054801000326
    • S.H. Yoon, and J.A. Ventura Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling Computers and Operations Research 29 2002 1301 1315 (Pubitemid 34409648)
    • (2002) Computers and Operations Research , vol.29 , Issue.10 , pp. 1301-1315
    • Yoon, S.-H.1    Ventura, J.A.2


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