Bp 340 en

From DCEwiki
Revision as of 00:19, 27 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

Optimal scheduling of pulp production

Author: Josef Müller

Bakalářské práce 2011

Download thesis in PDF

340 fig.gif

This thesis deals with the problem of optimal scheduling of pulp production. The aim was to design and test optimal scheduling algorithm for operation of the mill line. The algorithm should minimize the cost of electricity needed to grinding. The introduction describes the production line and its simplified model. Several suboptimal algorithms that solve the problem were found. In addition, the solution in MILP method, Mixed Integer Linear Programming, has been sought with and without the provided initial solution. In conclusion, the solutions are compared for cases of different production requirements, sampling period, initial solution provided to the solver and the price of electricity. Differences and savings between method of mathematical optimization and suboptimal solutions have been observed.

Bp 2011 muller josef.pdf