메뉴 건너뛰기




Volumn , Issue , 2009, Pages 554-559

An integrated ant colony optimization algorithm for the hybrid flow shopscheduling problem

Author keywords

Ant colony optimization; Hybrid flow shop; Integrated approach; Meta heuristic; Scheduling

Indexed keywords

ARTIFICIAL INTELLIGENCE; BENCHMARKING; MACHINE SHOP PRACTICE; SCHEDULING;

EID: 77956109839     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/iccie.2009.5223779     Document Type: Conference Paper
Times cited : (4)

References (28)
  • 1
    • 0023995996 scopus 로고
    • Two stage hybrid flowshop scheduling problem
    • Gupta, J.N.D., "Two stage hybrid flowshop scheduling problem",Journal of Operational Research Society, Vol.39, No.4, pp.359-364, 1988.
    • (1988) Journal of Operational Research Society , vol.39 , Issue.4 , pp. 359-364
    • Gupta, J.N.D.1
  • 6
    • 18044399490 scopus 로고    scopus 로고
    • Solving hybrid flow shop problem using energetic reasoning and globaloperations
    • Néron, E., P. Baptiste, and J.N.P. Gupta, "Solving hybridflow shop problem using energetic reasoning and global operations", Omega,Vol.29, pp.501-511, 2001.
    • (2001) Omega , vol.29 , pp. 501-511
    • Néron, E.1    Baptiste, P.2    Gupta, J.N.P.3
  • 9
    • 0032169302 scopus 로고    scopus 로고
    • A hybrid three stage flow-shop problem: Efficient heuristics to minimizemakespan
    • Riane, F., A. Artiba, S.E. Elmaghraby, "A hybrid three stageflow-shop problem: Efficient heuristics to minimize makespan", EuropeanJournal of Operational Research, Vol.109, pp.321-329, 1998.
    • (1998) European Journal of Operational Research , vol.109 , pp. 321-329
    • Riane, F.1    Artiba, A.2    Elmaghraby, S.E.3
  • 10
    • 0003075019 scopus 로고
    • Optimal two-and three-stage production schedules with setup timesincluded
    • Johnson, S.M., "Optimal two-and three-stage production scheduleswith setup times included Naval Research Logistics Quarterly 1, No. 1, pp.61-68,1957.
    • (1957) Naval Research Logistics Quarterly , vol.1 , Issue.1 , pp. 61-68
    • Johnson, S.M.1
  • 11
    • 0027590319 scopus 로고
    • Minimizing the makespan in the 3-machine assembly-type flowshopscheduling problem
    • Lee, C.Y., T.C.E. Cheng, and B.M. Lin, "Minimizing the Makespan inthe 3-Machine Assembly-Type Flowshop Scheduling Problem Management Science 39.No. 5, pp.616-625, 1993.
    • (1993) Management Science , vol.39 , Issue.5 , pp. 616-625
    • Lee, C.Y.1    Cheng, T.C.E.2    Lin, B.M.3
  • 12
    • 0030243899 scopus 로고    scopus 로고
    • An evaluation of sequencing heuristics in flow shops with multipleprocessors
    • Santos, D.L., J.L. Hunsucker, and D.E. Deal, "An evaluation ofsequencing heuristics in flow shops with multiple processors", Computersand Industrial Engineering, Vol.30, pp.681-691, 1996.
    • (1996) Computers and Industrial Engineering , vol.30 , pp. 681-691
    • Santos, D.L.1    Hunsucker, J.L.2    Deal, D.E.3
  • 13
    • 0020699921 scopus 로고
    • A heuristic algorithm for the m-machine, n-job flowshop sequencingproblem
    • Nawaz, M., E.E. Enscore and I. Ham, "A heuristic algorithm for them-machine, n-job flowshop sequencing problem", OMEGA, Vol.11, pp.9195,1983.
    • (1983) OMEGA , vol.11 , pp. 9195
    • Nawaz, M.1    Enscore, E.E.2    Ham, I.3
  • 18
    • 0041780055 scopus 로고    scopus 로고
    • Meta-heuristics for the deterministic hybrid flow shop problem
    • Gourgand, M., N. Grangeon, and S. Norre, "Meta-heuristics for thedeterministic hybrid flow shop problem", RAIRO-APII-JESA, Vol.34,pp.1107-1135, 2000.
    • (2000) RAIRO-APII-JESA , vol.34 , pp. 1107-1135
    • Gourgand, M.1    Grangeon, N.2    Norre, S.3
  • 19
    • 28444469125 scopus 로고    scopus 로고
    • Metaheuristic algorithms for multistage hybrid flowshop schedulingproblem
    • Jin, Z.H., Z. Yang, and T. Ito, "Metaheuristic algorithms formultistage hybrid flowshop scheduling problem", International Journal ofProduction Economics, Vol.100, pp.322-334, 2006.
    • (2006) International Journal of Production Economics , vol.100 , pp. 322-334
    • Jin, Z.H.1    Yang, Z.2    Ito, T.3
  • 20
    • 3142755746 scopus 로고    scopus 로고
    • A New approach to solve hybrid flow shop scheduling problems byartificial immune system
    • Engin, O. and A. Döyen, "A New approach to solve hybrid flowshop scheduling problems by artificial immune system Future Generation ComputerSystems 20, No. 6, pp. 1083-1095, 2004.
    • (2004) Future Generation Computer Systems , vol.20 , Issue.6 , pp. 1083-1095
    • Engin, O.1    Döyen, A.2
  • 24
    • 0031122887 scopus 로고    scopus 로고
    • Ant Colony System: A Cooperative Learning Approach to the TravelingSalesman Problem
    • Dorigo, M., L.M. Gambardella, "Ant Colony System: A CooperativeLearning Approach to the Traveling Salesman Problem IEEE Transactions onEvolutionary Computation 1, No. 1, pp.53-66, 1997.
    • (1997) IEEE Transactions on Evolutionary Computation , vol.1 , Issue.1 , pp. 53-66
    • Dorigo, M.1    Gambardella, L.M.2
  • 26
    • 0345671714 scopus 로고    scopus 로고
    • Ant Colony Optimization for FOP Shop Scheduling: A case study ondifferent pheromone representations
    • IEEE Computer Society Press, Los Alamitos
    • Blum, C, M.Sampels, "Ant Colony Optimization for FOP ShopScheduling: a case study on different pheromone representations",Proceedings of the 2002 Congress on Evolutionary Computation (CEC02), IEEEComputer Society Press, Los Alamitos, Vol.2,pp.1558-1563,2002.
    • (2002) Proceedings of the 2002 Congress on Evolutionary Computation (CEC02) , vol.2 , pp. 1558-1563
    • Blum, C.1    Sampels, M.2
  • 27
    • 34249903338 scopus 로고    scopus 로고
    • Multi-heuristic desirability ant colony system heuristic for nonpermutation flow-shops scheduling problems
    • Ying, K-C., S-W. Lin, "Multi-heuristic desirability ant colonysystem heuristic for non permutation flow-shops scheduling problems", International Journal of Advanced Manufacturing Technology, Vol.33, No.7-8,pp.793-802, 2007.
    • (2007) International Journal of Advanced Manufacturing Technology , vol.33 , Issue.7-8 , pp. 793-802
    • Ying, K.-C.1    Lin, S.-W.2
  • 28
    • 0042857495 scopus 로고    scopus 로고
    • An exact method for solving the multi-processor flow-shop
    • Carlier, J., E. Néron, "An exact method for solving themulti-processor flow-shop', RAIRO-Operations Research, Vol. 34, No. 1, pp. 1-25,2000.
    • (2000) RAIRO-operations Research , vol.34 , Issue.1 , pp. 1-25
    • Carlier, J.1    Néron, E.2


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