Analysis of flow shop problems and their algorithms

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.

Abstract licence: CC BY

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.