This thesis develops exact solution methods which
efficiently optimize the buffer allocation in flow lines under general assumptions.
First, an overview on existing literature in the field of buffer optimization is given. A classification scheme is developed to facilitate the comparison of
different algorithms. Then, exact mixed-integer programming approaches to calculate optimal buffer capacities are investigated. Finally, new exact algorithms are proposed in order to overcome the shortcomings of the mixed integer
programs.
Dieser Eintrag ist Teil der Universitätsbibliographie.
Das Dokument wird vom Publikationsserver der Universitätsbibliothek Mannheim bereitgestellt.