Analysis of flow shop problems and their algorithms
Lina Rajeckaitė
Kauno technologijos universitetas
Narimantas Listopadskis
Kauno technologijos universitetas
Published 2009-12-20


flow shop
branch and bound
simulated annealing
tabu search

How to Cite

Rajeckaitė L. and Listopadskis N. (2009) “Analysis of flow shop problems and their algorithms”, Lietuvos matematikos rinkinys, 50(proc. LMS), pp. 212–217. doi: 10.15388/LMR.2009.38.


The combinatorial optimization problem considered in this paper is flow shop scheduling problem arising in logistics, management, business, manufacture and etc. A set of machines and a set of jobs are given. Each job consists of a set of operations. Machines are working with unavailability intervals. The task is to minimize makespan, i.e. the overall length of the schedule. There is overview of combinatorial optimization, scheduling problems and methods used to solve them. There is also presented and realized one exact algorithm – Branch and Bound, and two meta-heuristics: Simulated Annealing and Tabu Search. Analysis of these three algorithms is made.

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Please read the Copyright Notice in Journal Policy

Most read articles by the same author(s)