Ιδρυματικό Αποθετήριο
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/80E8FB76-2858-4A60-834F-C7A801AC5519 | - |
| Αναγνωριστικό | https://doi.org/10.1023/A:1018975923886 | - |
| Γλώσσα | en | - |
| Μέγεθος | 20 pages | en |
| Τίτλος | Sensitivity analysis and decomposition of unreliable production lines with blocking | en |
| Δημιουργός | Kouikoglou Vasilis | en |
| Δημιουργός | Κουϊκογλου Βασιλης | el |
| Εκδότης | Kluwer | en |
| Περίληψη | The analysis of finite‐buffered, unreliable production lines is often based on the method of decomposition, where the original system is decomposed into a series of two‐stage subsystems that can be modeled as quasi birth‐death processes. In this paper, we present methods for computing the gradients of the equilibrium distribution vector for such processes. Then we consider a specific production line with finite buffers and machine breakdowns and develop an algorithm that incorporates gradient estimation into the framework of Gershwin's approximate decomposition. The algorithm is applied to the problem of workforce allocation to the machines of a production line to maximize throughput. It is shown that this problem is equivalent to a convex mathematical programming problem and, therefore, a globally optimal solution can be obtained. | en |
| Τύπος | Peer-Reviewed Journal Publication | en |
| Τύπος | Δημοσίευση σε Περιοδικό με Κριτές | el |
| Άδεια Χρήσης | http://creativecommons.org/licenses/by/4.0/ | en |
| Ημερομηνία | 2015-11-07 | - |
| Ημερομηνία Δημοσίευσης | 2000 | - |
| Θεματική Κατηγορία | Mathematical programming | en |
| Θεματική Κατηγορία | Goal programming | en |
| Θεματική Κατηγορία | programming mathematics | en |
| Θεματική Κατηγορία | mathematical programming | en |
| Θεματική Κατηγορία | goal programming | en |
| Βιβλιογραφική Αναφορά | V.S. Kouikoglou ," Sensitivity analysis and decomposition of unreliable production lines with blocking," Annals of Oper.Research,vol. 93 ,no.1-4,pp. 245-264,Jan. 2000.doi:10.1023/A:1018975923886 | en |
Copyright © DIAS 2013
