Publication detail

Scheduling Flow Shops

ŠEDA, M.

Original Title

Scheduling Flow Shops

Type

conference paper

Language

English

Original 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.

Key words in English

flow shop, mixed integer programming, heuristic, genetic algorithm

Authors

ŠEDA, M.

RIV year

2005

Released

29. 8. 2005

Publisher

VUT FEKT

Location

Brno

ISBN

80-214-2976-3

Book

Proceedings of the International Conference CEEPUS Summer School 2005 Intelligent Control Systems

Pages from

96

Pages to

196

Pages count

101

BibTex

@inproceedings{BUT15920,
  author="Miloš {Šeda}",
  title="Scheduling Flow Shops",
  booktitle="Proceedings of the International Conference CEEPUS Summer School 2005 Intelligent Control Systems",
  year="2005",
  pages="101",
  publisher="VUT FEKT",
  address="Brno",
  isbn="80-214-2976-3"
}