AKGÖBEK, Ö. Et Al. 2011. Parallel Greedy Metaheuristic Algorithm for Solving Open Shop Scheduling Problem. E-Journal of New World Sciences Academy (NWSA) , vol.6, no.1 , 421-427.

AKGÖBEK, Ö., KAYA, S., DEĞİRMENCİ, Ü., & ENGİN, O., (2011). Parallel Greedy Metaheuristic Algorithm for Solving Open Shop Scheduling Problem. E-Journal of New World Sciences Academy (NWSA) , vol.6, no.1, 421-427.

AKGÖBEK, ÖMER Et Al. "Parallel Greedy Metaheuristic Algorithm for Solving Open Shop Scheduling Problem," E-Journal of New World Sciences Academy (NWSA) , vol.6, no.1, 421-427, 2011

AKGÖBEK, ÖMER Et Al. "Parallel Greedy Metaheuristic Algorithm for Solving Open Shop Scheduling Problem." E-Journal of New World Sciences Academy (NWSA) , vol.6, no.1, pp.421-427, 2011

AKGÖBEK, Ö. Et Al. (2011) . "Parallel Greedy Metaheuristic Algorithm for Solving Open Shop Scheduling Problem." E-Journal of New World Sciences Academy (NWSA) , vol.6, no.1, pp.421-427.

@article{article, author={ÖMER AKGÖBEK Et Al. }, title={Parallel Greedy Metaheuristic Algorithm for Solving Open Shop Scheduling Problem}, journal={E-Journal of New World Sciences Academy (NWSA)}, year=2011, pages={421-427} }