In this paper, the authors consider production systems that manufacture high-value, low-volume, customer-specic products, such as airplanes and lithography systems. The manufacturing process of such products is divided into multiple activities, which can only start when preceding activities are nished. Systems of this type are usually modeled as production networks with stochastic activities leadtimes. Moreover, in the literature a common assumption is that the network has a single nal node, that is, there is only one end product. In the paper, the authors try to extend the results obtained so far to networks that have multiple end nodes. Therefore, they describe the solution in terms of a planned start time for each node and a planned nish time for each end node. They also introduce the concept of tardy paths. For a specic realization of activity leadtimes, a path is tardy if it leads to an end node that is behind schedule. In this context, the authors formulate a model and for given start and nish times and leadtime distributions they derive an expression for the probability of a path being tardy under the optimal solution. They show that Newsvendor equations hold for specic sets of nodes.
Recensione dell'articolo:(Jansen, S. W. F.; Atan, Z.; Adan, I. J. B. F.; de Kok, A. G. - "Newsvendor equations for production networks." Oper. Res. Lett. 46 (2018), no. 6, 599-604.) MR3876786 MathSciNet ISSN 2167-5163
Leonardo Pasini
2019-01-01
Abstract
In this paper, the authors consider production systems that manufacture high-value, low-volume, customer-specic products, such as airplanes and lithography systems. The manufacturing process of such products is divided into multiple activities, which can only start when preceding activities are nished. Systems of this type are usually modeled as production networks with stochastic activities leadtimes. Moreover, in the literature a common assumption is that the network has a single nal node, that is, there is only one end product. In the paper, the authors try to extend the results obtained so far to networks that have multiple end nodes. Therefore, they describe the solution in terms of a planned start time for each node and a planned nish time for each end node. They also introduce the concept of tardy paths. For a specic realization of activity leadtimes, a path is tardy if it leads to an end node that is behind schedule. In this context, the authors formulate a model and for given start and nish times and leadtime distributions they derive an expression for the probability of a path being tardy under the optimal solution. They show that Newsvendor equations hold for specic sets of nodes.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
