Publication detail
Two Approaches to Permutation Flow Shop Scheduling Problem
ŠEDA, M.
English title
Two Approaches to Permutation Flow Shop Scheduling Problem
Type
Paper in proceedings (conference paper)
Language
en
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
Released
2002-06-01
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–to
123–
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"
}