All
All

What are you looking for?

All
Projects
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Flow Shop Scheduling and Its Extension to Fuzzy Processing Times

Result description

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.

Keywords

flow shopmixed integer programmingheuristicgenetic algorithmfuzzy ranking

The result's identifiers

Alternative languages

  • Result language

    angličtina

  • Original language name

    Flow Shop Scheduling and Its Extension to Fuzzy Processing Times

  • Original language description

    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.

  • Czech name

    Rozvrhování proudové výroby a její rozšíření pro neurčité časy operací

  • Czech description

    V příspěvku jsou zkoumány dva odlišné způsoby řešení problému permutačního rozvrhování proudové výroby. První je založen na modelu smíšeného celočíselného programování a řešen optimalizačním programem GAMS. Protože problém patří mezi NP-úplné, je tento přístup omezen na menší instance, hranice použití jsou stanoveny testováním na příkladech z OR-Library. Pro větší instance je navržen přístup využívající genetické algoritmy a jsou specifikována vhodná nastavení parametrů. Nakonec je prezentována modifikace modelu pro problém s neurčitými časy operací.

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    BB - Applied statistics, operational research

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    Z - Vyzkumny zamer (s odkazem do CEZ)

Others

  • Publication year

    2008

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings of the 9th WSEAS International Conference on Fuzzy Systems

  • ISBN

    978-960-6766-57-2

  • ISSN

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

  • Publisher name

    WSEAS Press

  • Place of publication

    Sofia (Bulgaria)

  • Event location

    Sofia (Bulgaria)

  • Event date

    May 2, 2008

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

Basic information

Result type

D - Article in proceedings

D

CEP

BB - Applied statistics, operational research

Year of implementation

2008