The Scheduling of Manufacturing Processes

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

en

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.

manufacturing process, flow shop scheduling, job shop scheduling

2007-02-01

TU Košice

Stará Lesná (Slovakia)

978-80-8073-758-0

Sborník příspěvků workshopu Automatizácia a riadenie v teórii a praxi ARTEP 2007

7-1–7-6

6