Detail publikačního výsledku

Modeling Job Shop Scheduling Problem for Real-Life Conditions

MAJER, P., DVOŘÁK, J.

Originální název

Modeling Job Shop Scheduling Problem for Real-Life Conditions

Anglický název

Modeling Job Shop Scheduling Problem for Real-Life Conditions

Druh

Stať ve sborníku v databázi WoS či Scopus

Originální abstrakt

This paper describes a model of job shop scheduling, which covers the most frequent conditions of real-life production: assembly and distribution operations, release dates, setup and transfer times, overlapping processes. As a modeling tool we choose an extended disjunctive graph. The resulting model can be solved by means of stochastic heuristic methods (simulated annealing, taboo search, genetic algorithms). An example solved by simulated annealing is presented.

Anglický abstrakt

This paper describes a model of job shop scheduling, which covers the most frequent conditions of real-life production: assembly and distribution operations, release dates, setup and transfer times, overlapping processes. As a modeling tool we choose an extended disjunctive graph. The resulting model can be solved by means of stochastic heuristic methods (simulated annealing, taboo search, genetic algorithms). An example solved by simulated annealing is presented.

Klíčová slova v angličtině

job shop scheduling, disjunctive graph, transfer batches, assembly/distribution operations

Autoři

MAJER, P., DVOŘÁK, J.

Vydáno

01.06.2002

Nakladatel

Brno University of Technology

Místo

Brno, Czech Republic

ISBN

80-214-2135-5

Kniha

Proceedings of the 8th International Conference on Soft Computing MENDEL 2002

Strany od

357

Strany počet

362

BibTex

@inproceedings{BUT10557,
  author="Petr {Majer} and Jiří {Dvořák}",
  title="Modeling Job Shop Scheduling Problem for Real-Life Conditions",
  booktitle="Proceedings of the 8th International Conference on Soft Computing MENDEL 2002",
  year="2002",
  pages="362",
  publisher="Brno University of Technology",
  address="Brno, Czech Republic",
  isbn="80-214-2135-5"
}