In this paper, the authors study mathematical models to describe the flow of goods in production networks with random breakdowns of processors. They model breakdown events by a two-states process with exponentially distributed switching times between on and off states. The authors study several routing policies to distribute the product flow through the system. Specifically, they distinguish between two types of strategies: stateindependent and state-dependent policies. They present a numerical solution method and an approximate optimization algorithm for routing strategies in their stochastic simulation network model. Also, the authors present numerical results comparing the different routing heuristics and the approximate optimization procedures proposed in their study. They distinguish between three different types of networks: the diamond network, the cascade network, and a non-symmetric network. For each network sample, they consider the following two scenarios: constant inflow and stop-go inflow.
Recensione dell'articolo:(Gottlich, Simone; Kuhn, Sebastian - "Routing strategies in production networks with random breakdowns." - Commun. Math. Sci. 14 (2016), no. 7, 1799-1820.) MR3549351 MathSciNet ISSN 2167-5163
Leonardo Pasini
2017-01-01
Abstract
In this paper, the authors study mathematical models to describe the flow of goods in production networks with random breakdowns of processors. They model breakdown events by a two-states process with exponentially distributed switching times between on and off states. The authors study several routing policies to distribute the product flow through the system. Specifically, they distinguish between two types of strategies: stateindependent and state-dependent policies. They present a numerical solution method and an approximate optimization algorithm for routing strategies in their stochastic simulation network model. Also, the authors present numerical results comparing the different routing heuristics and the approximate optimization procedures proposed in their study. They distinguish between three different types of networks: the diamond network, the cascade network, and a non-symmetric network. For each network sample, they consider the following two scenarios: constant inflow and stop-go inflow.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.