Detail publikačního výsledku

Scheduling Manufacturing Processes

ŠEDA, M.

Originální název

Scheduling Manufacturing Processes

Anglický název

Scheduling Manufacturing Processes

Druh

Článek recenzovaný mimo WoS a Scopus

Originální abstrakt

The scheduling of manufacturing processes aims to find sequences of jobs on given machines optimal by a selected criterion such as minimal completion time of all operations, minimal losses caused by exceeding the required completion times, minimal sum of machine idle times, etc. In the paper, a mathematical model of the job shop scheduling problem is derived and suitable representations are mentioned for solving it by heuristic methods, due to the fact that this combinatorial problem is NP-complete and exact solutions can only be gained in a reasonable time for small instances.

Anglický abstrakt

The scheduling of manufacturing processes aims to find sequences of jobs on given machines optimal by a selected criterion such as minimal completion time of all operations, minimal losses caused by exceeding the required completion times, minimal sum of machine idle times, etc. In the paper, a mathematical model of the job shop scheduling problem is derived and suitable representations are mentioned for solving it by heuristic methods, due to the fact that this combinatorial problem is NP-complete and exact solutions can only be gained in a reasonable time for small instances.

Klíčová slova

manufacturing process, flow shop scheduling, job shop scheduling

Klíčová slova v angličtině

manufacturing process, flow shop scheduling, job shop scheduling

Autoři

ŠEDA, M.

Vydáno

01.02.2007

ISSN

1335-2393

Periodikum

Acta Mechanica Slovaca

Svazek

11

Číslo

1-A

Stát

Slovenská republika

Strany od

69

Strany do

74

Strany počet

6

BibTex

@article{BUT45262,
  author="Miloš {Šeda}",
  title="Scheduling Manufacturing Processes",
  journal="Acta Mechanica Slovaca",
  year="2007",
  volume="11",
  number="1-A",
  pages="69--74",
  issn="1335-2393"
}