메뉴 건너뛰기




Volumn , Issue , 2007, Pages 570-576

An estimation of distribution algorithm with guided mutation for a complex flow shop scheduling problem

Author keywords

Combinatorial optimization; Metaheuristics; Timetabling and scheduling

Indexed keywords

ADAPTIVE ALGORITHMS; COMBINATORIAL OPTIMIZATION; DISTRIBUTION FUNCTIONS; METADATA; PARAMETER ESTIMATION;

EID: 34548077216     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1276958.1277076     Document Type: Conference Paper
Times cited : (31)

References (26)
  • 1
    • 0027634134 scopus 로고    scopus 로고
    • L. Adler, N. Fraiman, E. Kobacker, M. Pinedo, J. C. Plotnicoff, and T. P. Wu. BPSS: A scheduling support system for the packaging industry. Operations Research, 41:641-648, 1993.
    • L. Adler, N. Fraiman, E. Kobacker, M. Pinedo, J. C. Plotnicoff, and T. P. Wu. BPSS: A scheduling support system for the packaging industry. Operations Research, 41:641-648, 1993.
  • 3
  • 4
    • 27144540137 scopus 로고    scopus 로고
    • A genetic algorithm for hybrid flow shops with sequence dependent setup times and machine elegibility
    • R. R. Garcia and C. Maroto. A genetic algorithm for hybrid flow shops with sequence dependent setup times and machine elegibility. European Journal of Operational Research, 169:781-800, 2006.
    • (2006) European Journal of Operational Research , vol.169 , pp. 781-800
    • Garcia, R.R.1    Maroto, C.2
  • 6
    • 0023995996 scopus 로고
    • Two-stage hybrid flow shop scheduling problem
    • J. N. D. Gupta. Two-stage hybrid flow shop scheduling problem. Operational Research Society, 39:359-364, 1988.
    • (1988) Operational Research Society , vol.39 , pp. 359-364
    • Gupta, J.N.D.1
  • 7
    • 0036722154 scopus 로고    scopus 로고
    • Heuristics for hybrid flow shops with controllable processing times and assignable due dates
    • J. N. D. Gupta. Heuristics for hybrid flow shops with controllable processing times and assignable due dates. Computers and Operations Research, 29:1417-1439, 2002.
    • (2002) Computers and Operations Research , vol.29 , pp. 1417-1439
    • Gupta, J.N.D.1
  • 9
    • 2942674864 scopus 로고    scopus 로고
    • Scheduling flexible flow lines with sequence dependent set-up times
    • M. E. Kurz and R. G. Askin. Scheduling flexible flow lines with sequence dependent set-up times. European Journal of Operational Research, 159:66-82, 2003.
    • (2003) European Journal of Operational Research , vol.159 , pp. 66-82
    • Kurz, M.E.1    Askin, R.G.2
  • 12
    • 0031073792 scopus 로고    scopus 로고
    • An adaptable problem space based search method for flexible flow line scheduling
    • V. J. Leon and B. Ramamoorthy. An adaptable problem space based search method for flexible flow line scheduling. HE Transactions, 29:115-125, 1997.
    • (1997) HE Transactions , vol.29 , pp. 115-125
    • Leon, V.J.1    Ramamoorthy, B.2
  • 14
    • 84958959530 scopus 로고    scopus 로고
    • H. Mühlenbein and G. Paass. From recombination of genes to the estimation of distributions i. binary parameters. In Proceedings of the 4th International Conference on Parallel Problem Solving from Nature, Lecture Notes In Computer Science, 1141, pages 178-187. Springer-Verlag, 1996.
    • H. Mühlenbein and G. Paass. From recombination of genes to the estimation of distributions i. binary parameters. In Proceedings of the 4th International Conference on Parallel Problem Solving from Nature, Lecture Notes In Computer Science, Vol. 1141, pages 178-187. Springer-Verlag, 1996.
  • 15
    • 21144440772 scopus 로고    scopus 로고
    • A genetic algorithm for hybrid flow shop scheduling with multiprocessor tasks
    • C. Oguz and M. F. Ercan. A genetic algorithm for hybrid flow shop scheduling with multiprocessor tasks. Journal of Scheduling, 8:323-351, 2005.
    • (2005) Journal of Scheduling , vol.8 , pp. 323-351
    • Oguz, C.1    Ercan, M.F.2
  • 18
    • 27144552259 scopus 로고    scopus 로고
    • Performance of single stage representation genetic algorithms in scheduling flexible flow shops
    • IEEE Press
    • J. A. V. Rodriguez and A. Salhi. Performance of single stage representation genetic algorithms in scheduling flexible flow shops. In Congress on Evolutionary Computation (CEC2005), pages 1364-1371. IEEE Press, 2005.
    • (2005) Congress on Evolutionary Computation (CEC2005) , pp. 1364-1371
    • Rodriguez, J.A.V.1    Salhi, A.2
  • 20
    • 2442566880 scopus 로고    scopus 로고
    • Multiprocessor task scheduling in multistage hybrid flow shops: A genetic algorithm approach
    • F. S. Serifoglu and G. Ulusoy. Multiprocessor task scheduling in multistage hybrid flow shops: A genetic algorithm approach. Journal of the Operational Research Society, 55:504-512, 2004.
    • (2004) Journal of the Operational Research Society , vol.55 , pp. 504-512
    • Serifoglu, F.S.1    Ulusoy, G.2
  • 21
    • 0141636340 scopus 로고    scopus 로고
    • A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage
    • H. W. Thornton and J. L. Hunsucker. A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage. European Journal of Operational Research, 152:96-114, 2004.
    • (2004) European Journal of Operational Research , vol.152 , pp. 96-114
    • Thornton, H.W.1    Hunsucker, J.L.2
  • 22
    • 33745220037 scopus 로고    scopus 로고
    • Flexible flow shop scheduling: Optimum, heuristics and artifical intelligence solutions
    • H. Wang. Flexible flow shop scheduling: Optimum, heuristics and artifical intelligence solutions. Expert Systems, 22:78-85, 2005.
    • (2005) Expert Systems , vol.22 , pp. 78-85
    • Wang, H.1
  • 23
    • 1642518689 scopus 로고    scopus 로고
    • A tabu search algorithm for the multi-stage parallel machines problem with limited buffer capacities
    • B. Wardono and Y. Fathi. A tabu search algorithm for the multi-stage parallel machines problem with limited buffer capacities. European Journal of Operational Research, 155:380-401, 2004.
    • (2004) European Journal of Operational Research , vol.155 , pp. 380-401
    • Wardono, B.1    Fathi, Y.2
  • 24
    • 0024016313 scopus 로고
    • An adaptable scheduling algorithm for flexible flow lines
    • R. J. Wittrock. An adaptable scheduling algorithm for flexible flow lines. Operations Research, 36:445-453, 1988.
    • (1988) Operations Research , vol.36 , pp. 445-453
    • Wittrock, R.J.1
  • 25
    • 17644405107 scopus 로고    scopus 로고
    • An evolutionary algorithm with the guided mutation for the maximum clique problem
    • Q. Zhang, J. Sun, and E. Tsang. An evolutionary algorithm with the guided mutation for the maximum clique problem. IEEE Transactions on Evolutionary Computation, 9:192-201, 2005.
    • (2005) IEEE Transactions on Evolutionary Computation , vol.9 , pp. 192-201
    • Zhang, Q.1    Sun, J.2    Tsang, E.3
  • 26
    • 33845266707 scopus 로고    scopus 로고
    • Estimation of distribution algorithm with 2-opt local search for the quadratic assignment problem
    • J. Lozano, P. Larrañaga, I. Inza, and E. Bengoetxea, editors, Springer-Verlag
    • Q. Zhang, J. Sun, E. Tsang, and J. Ford. Estimation of distribution algorithm with 2-opt local search for the quadratic assignment problem. In J. Lozano, P. Larrañaga, I. Inza, and E. Bengoetxea, editors, Towards a New Evolutionary Computation. Advances in Estimation of Distribution Algorithm, pages 281-292. Springer-Verlag, 2006.
    • (2006) Towards a New Evolutionary Computation. Advances in Estimation of Distribution Algorithm , pp. 281-292
    • Zhang, Q.1    Sun, J.2    Tsang, E.3    Ford, J.4


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