Bp 73 en
Optimalizacion manufacture with relative limitation
Author: Michael Záruba
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.