메뉴 건너뛰기




Volumn , Issue , 2008, Pages 40-43

A chaotic ant colony optimization method for scheduling a single batch-processing machine with non-identical job sizes

Author keywords

[No Author keywords available]

Indexed keywords

ANNEALING; BOOLEAN FUNCTIONS; GENETIC ALGORITHMS; NUCLEAR PROPULSION; OPTIMIZATION; PROBLEM SOLVING; SIMULATED ANNEALING;

EID: 55749107925     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2008.4630773     Document Type: Conference Paper
Times cited : (5)

References (15)
  • 1
    • 0028461472 scopus 로고
    • Scheduling a single batch-processing machine with non-identical job sizes
    • July
    • R. Uzsoy, "Scheduling a single batch-processing machine with non-identical job sizes," International journal of production research, vol. 32, no. 7, pp. 1615-1635, July, 1994.
    • (1994) International journal of production research , vol.32 , Issue.7 , pp. 1615-1635
    • Uzsoy, R.1
  • 2
    • 0033908430 scopus 로고    scopus 로고
    • Minimizing makespan on a single burn-in oven in semiconductor manufacturing
    • February
    • C. S. Sung, Y. I. Choung. "Minimizing makespan on a single burn-in oven in semiconductor manufacturing," European journal of operation research, vol. 120, no. 3, pp. 559-574, February, 2000.
    • (2000) European journal of operation research , vol.120 , Issue.3 , pp. 559-574
    • Sung, C.S.1    Choung, Y.I.2
  • 3
    • 0036604740 scopus 로고    scopus 로고
    • Minimizing the makespan on a batch machine with nonidentical job sizes: An exact procedure
    • June
    • L. Dupont, C. D. Flipo, "Minimizing the makespan on a batch machine with nonidentical job sizes: an exact procedure," Computers & operations research, vol. 29, no. 7, pp. 807-819, June, 2002.
    • (2002) Computers & operations research , vol.29 , Issue.7 , pp. 807-819
    • Dupont, L.1    Flipo, C.D.2
  • 4
    • 0041742181 scopus 로고    scopus 로고
    • Genetic algorithms to minimize the weighted number of late jobs on a single machine
    • December
    • M. Sevaux, S. D. Peres, "Genetic algorithms to minimize the weighted number of late jobs on a single machine," European journal of operational research, vol. 151, no. 2, pp. 296-306, December, 2003.
    • (2003) European journal of operational research , vol.151 , Issue.2 , pp. 296-306
    • Sevaux, M.1    Peres, S.D.2
  • 5
    • 33745799227 scopus 로고    scopus 로고
    • Minimizing makespan on a single batch-processing machine with non-identical job sizes: A hybrid genetic approach
    • Evolutionary computation in combinatorial optimization, 6th European conference, 2006, Proceedings
    • A. H. Kashan, B. Karimi, F. Jolai, "Minimizing makespan on a single batch-processing machine with non-identical job sizes: a hybrid genetic approach," Evolutionary computation in combinatorial optimization - 6th European conference, 2006, Proceedings, Lecture notes in computer science, 3906: pp. 35-146, 2006.
    • (2006) Lecture notes in computer science , vol.3906 , pp. 35-146
    • Kashan, A.H.1    Karimi, B.2    Jolai, F.3
  • 6
    • 33745817107 scopus 로고    scopus 로고
    • Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms
    • October
    • P. Damodaran, P. K. Manjeshwar, K. Srihari, "Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms," International journal of production economics, vol. 103, no. 2, pp. 882-891, October, 2006.
    • (2006) International journal of production economics , vol.103 , Issue.2 , pp. 882-891
    • Damodaran, P.1    Manjeshwar, P.K.2    Srihari, K.3
  • 7
    • 0346148281 scopus 로고    scopus 로고
    • Minimizing makespan for single batch-processing machine with non-identical job sizes using simulated annealing
    • January
    • S. Melouk, P. Damodaran, P. Y. Chang, "Minimizing makespan for single batch-processing machine with non-identical job sizes using simulated annealing," International journal of production economics, vol. 87, no. 2, pp. 141-147, January, 2004.
    • (2004) International journal of production economics , vol.87 , Issue.2 , pp. 141-147
    • Melouk, S.1    Damodaran, P.2    Chang, P.Y.3
  • 8
    • 33845332680 scopus 로고    scopus 로고
    • An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
    • July
    • C. S. Liao, H. C. Juan, "An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups," Computers & operations research, vol. 34, no. 7, pp. 1899-1909, July, 2007.
    • (2007) Computers & operations research , vol.34 , Issue.7 , pp. 1899-1909
    • Liao, C.S.1    Juan, H.C.2
  • 9
    • 34247624966 scopus 로고    scopus 로고
    • Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimization method
    • October
    • A. Rossi, G. Dini, "Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimization method," Robotics and computer-integrated manufacturing, vol. 23, no. 5, pp. 503-516, October, 2007.
    • (2007) Robotics and computer-integrated manufacturing , vol.23 , Issue.5 , pp. 503-516
    • Rossi, A.1    Dini, G.2
  • 10
    • 9544220684 scopus 로고    scopus 로고
    • Beam-ACO-hybridizing ant colony optimization with beam search: An application to open shop scheduling
    • June
    • C. Blum, "Beam-ACO-hybridizing ant colony optimization with beam search: an application to open shop scheduling," Computers & operations research, vol. 32, no. 6, pp 1565-1591, June, 2005.
    • (2005) Computers & operations research , vol.32 , Issue.6 , pp. 1565-1591
    • Blum, C.1
  • 11
    • 18744404504 scopus 로고    scopus 로고
    • An ant colony optimization algorithm for shop scheduling problems
    • November
    • C. Blum, M. Sampels, "An ant colony optimization algorithm for shop scheduling problems," Journal of mathematical modeling and algorithms, vol. 3, no. 3, pp. 285-308, November, 2004.
    • (2004) Journal of mathematical modeling and algorithms , vol.3 , Issue.3 , pp. 285-308
    • Blum, C.1    Sampels, M.2
  • 12
    • 34247223607 scopus 로고    scopus 로고
    • Hybrid ant colony optimization and visibility studies applied to a job shop scheduling problem
    • April
    • J Heinonen, F. Pettersson, "Hybrid ant colony optimization and visibility studies applied to a job shop scheduling problem," Applied mathematics and computation, vol. 187, no. 2, pp. 989-998, April, 2007
    • (2007) Applied mathematics and computation , vol.187 , Issue.2 , pp. 989-998
    • Heinonen, J.1    Pettersson, F.2
  • 13
    • 34548613299 scopus 로고    scopus 로고
    • Ant colony optimization combined with taboo search for the job shop scheduling problem
    • April
    • K. L. Huang, C.J. Liao "Ant colony optimization combined with taboo search for the job shop scheduling problem," Computers & operations research, vol. 35, no. 4, pp. 1030-1046, April, 2008.
    • (2008) Computers & operations research , vol.35 , Issue.4 , pp. 1030-1046
    • Huang, K.L.1    Liao, C.J.2
  • 14
    • 34247262525 scopus 로고    scopus 로고
    • Comparison of different one-dimensional maps as chaotic search pattern in chaos optimization algorithm
    • April
    • M. S. Tavazoei, M. Haeri, "Comparison of different one-dimensional maps as chaotic search pattern in chaos optimization algorithm," Applied mathematics and computation, vol 187, no. 2, pp, 1076-1085, April, 2007
    • (2007) Applied mathematics and computation , vol.187 , Issue.2 , pp. 1076-1085
    • Tavazoei, M.S.1    Haeri, M.2
  • 15
    • 31144475541 scopus 로고    scopus 로고
    • Using chaos search immune genetic and fuzzy system for short-term unit commitment algorithm
    • January
    • G. C. Liao, T. P. Tsao, "Using chaos search immune genetic and fuzzy system for short-term unit commitment algorithm", International journal of electrical power and energy system, vol. 28, no. 1, pp. 1-12, January, 2006.
    • (2006) International journal of electrical power and energy system , vol.28 , Issue.1 , pp. 1-12
    • Liao, G.C.1    Tsao, T.P.2


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