Rozvrhovací úlohy typu Flow-shop
A description of flow shop and lot streaming including an example is given. Methods and algorithms ofr solving various modifications of the single job two-machine flow shop transfer lot sizing problem are shown. It starts with the calsulation of two lots (discrete), three lots (continuous) problem a...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Dissertation |
| Language: | Czech |
| Published: |
2006
|
| Online Access: | http://www.nusl.cz/ntk/nusl-266103 |
| Summary: | A description of flow shop and lot streaming including an example is given. Methods and algorithms ofr solving various modifications of the single job two-machine flow shop transfer lot sizing problem are shown. It starts with the calsulation of two lots (discrete), three lots (continuous) problem and then Trietsch s polynomial algorithm or an arbitrary number of sublots is introduced. This alogithm is then used for solving modifications with finding the proper number of sublots for given makespan, with constant or linear transfer times including variants with limited number of transfer machines or their limited capacity, with constant or linear set up times. A domed with both transfer and setup times is then developed and Trietschs algorithm modified. A theoreme by R. G. Vickson for solving multiple job lot streaming problem by treating the lot streaming problem for each job separately and then using Johnsons alogorithm is proposed to extend the results of the single job cases to those of multiple jobs. A known way to extend results to the three machine problem by treating each pair of successive machines separately or developing Trietschs algorithm for three machines is shown. Most of the procedures are illustrated in examples. |
|---|