Bees algorithm in optimization of task scheduling for flow shop model
DOI:
https://doi.org/10.34767/SIMIS.2010.02.05Keywords:
Bees Algorithm, Flow Shop, Task SchedulingAbstract
Problem of optimization with limited resources is fundamental one in computer sciences. The bees algorithm from wider group of swarm algorithms, invented and implemented about 2005, seems to be a good candidate for next useful tool for combinatorial optimization. Article presents the results of the bees algorithm research in flow shop model of task scheduling and outlines areas of further exploration.
References
Baykasoglu A., Ozbakor L., Tapkan P., „Artificial Bee Colony and Its Application to Generalized Assignment Problem”, I-Tech Education and Publishing, Vienna, pp 29-33, 2007
Błazewicz J., Ecker K. H., Schmidt G., Węglarz J., „Scheduling in Computer and Manufacturing Systems”, Springer-Verlag, Berlin, 1994
Librant S., Skrabacz M., „Zastosowanie algorytmu pszczelego w optymalizacji kombinatorycznej”, Państwowa Wyższa Szkoła Zawodowa w Tarnowie, Instytut Politechniczny, praca inżynierska, Tarnów, 2009
Pinedo M., “Scheduling – theory, algorithms and systems”, Pearson Education, Hong Kong, 2002
Smutnicki C., „Algorytmy szeregowania”, Akademicka Oficyna Wydawnicza EXIT, Warszawa, 2002
Cormen T. H., Leiserson C. E., Rivest R. L., Stein C., „Wprowadzenie do algorytmów”, WNT, Warszawa, 2001
