Title: Flow Shop Scheduling and Its Extension to Fuzzy Processing Times
Keywords: flow shop, mixed integer programming, heuristic, genetic algorithm, fuzzy ranking
Abstract: In this paper, two different approaches to permutation flow shop scheduling problem are investigated. The first one is based on a mixed integer programming model and is solved by an optimization package GAMS. As the problem belongs to NP-complete problems, this approach is limited to smaller instances, its reasonable bounds are indicated using benchmarks from OR-Library. For large instances, an approach using genetic algorithm is proposed including its appropriate parameter settings. Finally, a modification of the problem using uncertain processing times of jobs is presented.
Вид: публикация в национален форум