Bp 73 en

From DCEwiki
Revision as of 23:52, 26 August 2014 by Sturcmar (talk | contribs) (Zobrazení PDF náhledů v rámečkách.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Optimalizacion manufacture with relative limitation[edit]

Author: Michael Záruba

Bakalářské práce 2006

Download thesis in PDF

Topic of bachelor thesis is an algorithm implementation for scheduling manufacturing processes with relative limitations. The problem deals with scheduling of manufacturing processes (tasks) on one machine (processor) while the objective is to minimize the schedule length. Time limitations are represented by graph G. Nodes of graph G represent tasks. Weights of edges in graph G represent minimum or maximum time, which elapse between starts of two tasks (positive and negative time lags). Weights of nodes in graph G represent processing time of tasks. The purpose of the bachelor thesis is the implementation of chosen algorithm in ANSI C and its interconnection with TORSCHE Scheduling Toolbox for Matlab.

Bp 2006 zaruba michael.pdf