Methods for Optimizing Supplies of Production Lines
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23210%2F13%3A43919123" target="_blank" >RIV/49777513:23210/13:43919123 - isvavai.cz</a>
Výsledek na webu
<a href="http://home.zcu.cz/~pinte/VaV/2013/ZCUoptimizationOfProductionLines_v2.pdf" target="_blank" >http://home.zcu.cz/~pinte/VaV/2013/ZCUoptimizationOfProductionLines_v2.pdf</a>
DOI - Digital Object Identifier
—
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
Methods for Optimizing Supplies of Production Lines
Popis výsledku v původním jazyce
This paper deals with a heuristic approach to material supplies of production lines. A modern method for supplying production lines with material is using the so called ?milk run? ? trains supplying not only one point in assembly production lines but several points. A graph model is used. An analytical solution for creation of trains is not known; most probably it does not exist. Solutions using ?brute force? may be very slow. They cannot be used for more than a dozen demands. A repeated random selection of n-tuples of transport demands and building of trains from this selection could be a good way to solve this task. A model of assembly production lines based on a real system in an automotive industry company has been developed and the speed of convergence of random selections to a suboptimal solution has been simulated and measured. A thousand selections give good results.
Název v anglickém jazyce
Methods for Optimizing Supplies of Production Lines
Popis výsledku anglicky
This paper deals with a heuristic approach to material supplies of production lines. A modern method for supplying production lines with material is using the so called ?milk run? ? trains supplying not only one point in assembly production lines but several points. A graph model is used. An analytical solution for creation of trains is not known; most probably it does not exist. Solutions using ?brute force? may be very slow. They cannot be used for more than a dozen demands. A repeated random selection of n-tuples of transport demands and building of trains from this selection could be a good way to solve this task. A model of assembly production lines based on a real system in an automotive industry company has been developed and the speed of convergence of random selections to a suboptimal solution has been simulated and measured. A thousand selections give good results.
Klasifikace
Druh
O - Ostatní výsledky
CEP obor
JR - Ostatní strojírenství
OECD FORD obor
—
Návaznosti výsledku
Projekt
—
Návaznosti
S - Specificky vyzkum na vysokych skolach
Ostatní
Rok uplatnění
2013
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů