Publication detail

Two Approaches to Permutation Flow Shop Scheduling Problem

ŠEDA, M.

Original Title

Two Approaches to Permutation Flow Shop Scheduling Problem

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

Key words in English

flow shop, mixed integer programming, heuristic, genetic algorithm

Authors

ŠEDA, M.

RIV year

2002

Released

1. 6. 2002

Publisher

Ain Shams University Cairo

Location

Cairo (Egypt)

ISBN

977-237-172-3

Book

Proceedings of the First International Conference on Intelligent Computing and Information Systems ICICIS 2002

Pages from

123

Pages to

128

Pages count

6

BibTex

@inproceedings{BUT10545,
  author="Miloš {Šeda}",
  title="Two Approaches to Permutation Flow Shop Scheduling Problem",
  booktitle="Proceedings of the First International Conference on Intelligent Computing and Information Systems ICICIS 2002",
  year="2002",
  pages="6",
  publisher="Ain Shams University Cairo",
  address="Cairo (Egypt)",
  isbn="977-237-172-3"
}