Atıf Formatları
An efficient grouping genetic algorithm for U-shaped assembly line balancing problems with maximizing production rate
  • IEEE
  • ACM
  • APA
  • Chicago
  • MLA
  • Harvard
  • BibTeX

M. ŞAHİN And T. KELLEGÖZ, "An efficient grouping genetic algorithm for U-shaped assembly line balancing problems with maximizing production rate," Memetic Computing , vol.9, no.3, pp.213-229, 2017

ŞAHİN, M. And KELLEGÖZ, T. 2017. An efficient grouping genetic algorithm for U-shaped assembly line balancing problems with maximizing production rate. Memetic Computing , vol.9, no.3 , 213-229.

ŞAHİN, M., & KELLEGÖZ, T., (2017). An efficient grouping genetic algorithm for U-shaped assembly line balancing problems with maximizing production rate. Memetic Computing , vol.9, no.3, 213-229.

ŞAHİN, MURAT, And TALİP KELLEGÖZ. "An efficient grouping genetic algorithm for U-shaped assembly line balancing problems with maximizing production rate," Memetic Computing , vol.9, no.3, 213-229, 2017

ŞAHİN, MURAT And KELLEGÖZ, TALİP. "An efficient grouping genetic algorithm for U-shaped assembly line balancing problems with maximizing production rate." Memetic Computing , vol.9, no.3, pp.213-229, 2017

ŞAHİN, M. And KELLEGÖZ, T. (2017) . "An efficient grouping genetic algorithm for U-shaped assembly line balancing problems with maximizing production rate." Memetic Computing , vol.9, no.3, pp.213-229.

@article{article, author={MURAT ŞAHİN And author={TALİP KELLEGÖZ}, title={An efficient grouping genetic algorithm for U-shaped assembly line balancing problems with maximizing production rate}, journal={Memetic Computing}, year=2017, pages={213-229} }