1. New heuristics to minimize total completion time in m-machine flowshops;Allahverdi;International Journal of Production Economics,2002
2. Minimizing the sum of completion times of n jobs over m machines in a flowshop – A branch and bound approach;Bansal;IIE Transactions,1977
3. Solving the flow shop problem by parallel programming;Bożejko;Journal of Parallel and Distributed Computing,2009
4. Bożejko, W., & M. Wodecki (2002). Solving the flow shop problem by parallel tabu search. In: PARELEC ’02: proceedings of the international conference on parallel computing in electrical engineering (pp. 189–194). IEEE Computer Society, Washington, DC, USA.
5. Parallel genetic algorithm for the flow shop scheduling problem;Bożejko;Lecture Notes in Computer Science,2004