메뉴 건너뛰기




Volumn 13, Issue 8, 2013, Pages 3729-3736

An immunoglobulin-based artificial immune system for solving the hybrid flow shop problem

Author keywords

Artificial immune system; Hybrid flow shop scheduling; Makespan; Scheduling

Indexed keywords

ARTIFICIAL IMMUNE SYSTEM; ARTIFICIAL IMMUNE SYSTEM ALGORITHMS; COMPUTATIONAL RESULTS; HYBRID FLOW SHOP; HYBRID FLOW SHOP PROBLEM; HYBRID FLOW SHOP SCHEDULING; MAKESPAN; NATURAL IMMUNE SYSTEMS;

EID: 84879105184     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2013.03.006     Document Type: Article
Times cited : (36)

References (34)
  • 2
    • 0002434711 scopus 로고
    • A solution to a special case of flow shop scheduling problems
    • S.E. Elmaghraby, Springer-Verlag USA
    • M.S. Salvador A solution to a special case of flow shop scheduling problems S.E. Elmaghraby, Symposium of the Theory of Scheduling and Applications 1973 Springer-Verlag USA
    • (1973) Symposium of the Theory of Scheduling and Applications
    • Salvador, M.S.1
  • 3
    • 73449099561 scopus 로고    scopus 로고
    • Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
    • I. Ribas, R. Leisten, and J.M. Framinan Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective Computers and Operations Research 37 2010 1439 1454
    • (2010) Computers and Operations Research , vol.37 , pp. 1439-1454
    • Ribas, I.1    Leisten, R.2    Framinan, J.M.3
  • 4
    • 0006859287 scopus 로고
    • An extension of two machines sequencing problem
    • T.S. Arthanari, and K.G. Ramamurthy An extension of two machines sequencing problem Opsearch 8 1971 10 22
    • (1971) Opsearch , vol.8 , pp. 10-22
    • Arthanari, T.S.1    Ramamurthy, K.G.2
  • 5
    • 0026417688 scopus 로고
    • Branch and bound algorithm for the flow shop with multiple processors
    • S.A. Brah, and J.L. Hunsucker Branch and bound algorithm for the flow shop with multiple processors European Journal of Operational Research 51 1991 88 99
    • (1991) European Journal of Operational Research , vol.51 , pp. 88-99
    • Brah, S.A.1    Hunsucker, J.L.2
  • 6
    • 0032169302 scopus 로고    scopus 로고
    • A hybrid three stage flow shop problem: Efficient heuristics to minimize makespan
    • F. Riane, A. Artibs, and S.E. Elmaghraby A hybrid three stage flow shop problem: efficient heuristics to minimize makespan European Journal of Operational Research 109 1998 321 329
    • (1998) European Journal of Operational Research , vol.109 , pp. 321-329
    • Riane, F.1    Artibs, A.2    Elmaghraby, S.E.3
  • 8
    • 0042857495 scopus 로고    scopus 로고
    • An exact method for solving the multiprocessor flowshop
    • J. Carlier, and E. Neron An exact method for solving the multiprocessor flowshop RAIRO-Operations Research 34 2000 1 25
    • (2000) RAIRO-Operations Research , vol.34 , pp. 1-25
    • Carlier, J.1    Neron, E.2
  • 9
    • 0026190509 scopus 로고
    • Schedules for a two stage hybrid flowshop with parallel machines at the second stage
    • J.N.D. Gupta, and E.A. Tunç Schedules for a two stage hybrid flowshop with parallel machines at the second stage International Journal of Production Research 29 1991 1489 1502
    • (1991) International Journal of Production Research , vol.29 , pp. 1489-1502
    • Gupta, J.N.D.1    Tunç, E.A.2
  • 10
    • 0031543097 scopus 로고    scopus 로고
    • Scheduling a two stage hybrid flow shop with parallel machines at the first stage
    • J.N.D. Gupta, A.M.A. Hariri, and C.N. Potts Scheduling a two stage hybrid flow shop with parallel machines at the first stage Annals of Operations Research 69 1997 171 191
    • (1997) Annals of Operations Research , vol.69 , pp. 171-191
    • Gupta, J.N.D.1    Hariri, A.M.A.2    Potts, C.N.3
  • 11
    • 0001326653 scopus 로고
    • Scheduling a two-stage hybrid flow shop with separable setup and removal times
    • J.N.D. Gupta, and E.A. Tunç Scheduling a two-stage hybrid flow shop with separable setup and removal times European Journal of Operational Research 77 1994 415 428
    • (1994) European Journal of Operational Research , vol.77 , pp. 415-428
    • Gupta, J.N.D.1    Tunç, E.A.2
  • 12
    • 0141509086 scopus 로고    scopus 로고
    • A case study in a two-stage hybrid flow shop with setup time and dedicated machines
    • H.T. Lin, and C.J. Liao A case study in a two-stage hybrid flow shop with setup time and dedicated machines International Journal of Production Economics 86 2003 133 143
    • (2003) International Journal of Production Economics , vol.86 , pp. 133-143
    • Lin, H.T.1    Liao, C.J.2
  • 13
    • 50949129708 scopus 로고    scopus 로고
    • A heuristic algorithm for hybrid flow shop production scheduling to minimize the sum of the earliness and tardiness costs
    • M. Heydari, and M.B. Fakhrzad A heuristic algorithm for hybrid flow shop production scheduling to minimize the sum of the earliness and tardiness costs Journal of Chinese Institute of Industrial Engineering 25 2008 105 115
    • (2008) Journal of Chinese Institute of Industrial Engineering , vol.25 , pp. 105-115
    • Heydari, M.1    Fakhrzad, M.B.2
  • 15
    • 21144440772 scopus 로고    scopus 로고
    • A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks
    • C. Oǧuz, and M.F. Ercan A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks Journal of Scheduling 8 2005 323 351
    • (2005) Journal of Scheduling , vol.8 , pp. 323-351
    • Oǧuz, C.1    Ercan, M.F.2
  • 17
    • 27144540137 scopus 로고    scopus 로고
    • A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
    • R. Ruíz, and C. Maroto A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility European Journal of Operational Research 169 2006 781 800
    • (2006) European Journal of Operational Research , vol.169 , pp. 781-800
    • Ruíz, R.1    Maroto, C.2
  • 19
    • 3142755746 scopus 로고    scopus 로고
    • A new approach to solve hybrid flow shop scheduling problems by artificial immune system
    • O. Engin, and A. Döyen A new approach to solve hybrid flow shop scheduling problems by artificial immune system Future Generation Computer Systems 20 2004 1083 1095
    • (2004) Future Generation Computer Systems , vol.20 , pp. 1083-1095
    • Engin, O.1    Döyen, A.2
  • 20
    • 67650166613 scopus 로고    scopus 로고
    • A quantum-inspired immune algorithm for hybrid flow shop with makespan criterion
    • Q. Niu, T. Zhou, and S. Ma A quantum-inspired immune algorithm for hybrid flow shop with makespan criterion Journal of Universal Computer Science 15 2009 765 785
    • (2009) Journal of Universal Computer Science , vol.15 , pp. 765-785
    • Niu, Q.1    Zhou, T.2    Ma, S.3
  • 24
    • 0242269931 scopus 로고    scopus 로고
    • Solving the assembly configuration problem for modular products using an immune algorithm approach
    • L.P. Khoo, and T.D. Situmdrang Solving the assembly configuration problem for modular products using an immune algorithm approach International Journal of Production Research 41 2003 3419 3434
    • (2003) International Journal of Production Research , vol.41 , pp. 3419-3434
    • Khoo, L.P.1    Situmdrang, T.D.2
  • 25
    • 33744804263 scopus 로고    scopus 로고
    • Psycho-clonal algorithm based approach to solve continuous flow shop scheduling problem
    • A. Kumar, A. Prakash, R. Shankar, and M.K. Tiwari Psycho-clonal algorithm based approach to solve continuous flow shop scheduling problem Expert Systems with Applications 31 2006 504 514
    • (2006) Expert Systems with Applications , vol.31 , pp. 504-514
    • Kumar, A.1    Prakash, A.2    Shankar, R.3    Tiwari, M.K.4
  • 27
    • 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
    • R. Tavakkoli-Moghaddam, A. Rahimi-Vahed, and A.H. Mirzaei 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 2007 5072 5090
    • (2007) Information Sciences , vol.177 , pp. 5072-5090
    • Tavakkoli-Moghaddam, R.1    Rahimi-Vahed, A.2    Mirzaei, A.H.3
  • 31
    • 0003915574 scopus 로고    scopus 로고
    • 2nd ed. Garland Science Publishing USA
    • P. Parham The Immune System 2nd ed. 2005 Garland Science Publishing USA
    • (2005) The Immune System
    • Parham, P.1
  • 32
    • 55449124245 scopus 로고    scopus 로고
    • A discrete differential evolution algorithm for the permutation flowshop scheduling problem
    • Q.K. Pan, M.F. Tasgetiren, and Y.C. Liang A discrete differential evolution algorithm for the permutation flowshop scheduling problem Computers and Industrial Engineering 55 2008 795 816
    • (2008) Computers and Industrial Engineering , vol.55 , pp. 795-816
    • Pan, Q.K.1    Tasgetiren, M.F.2    Liang, Y.C.3
  • 34
    • 84879110220 scopus 로고
    • 3rd ed. Holt, Rinehart & Winston USA
    • R.E. Kirk, and Statistics An Introduction 3rd ed. 1990 Holt, Rinehart & Winston USA
    • (1990) An Introduction
    • Kirk, R.E.1


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