排序方式: 共有54条查询结果,搜索用时 15 毫秒
21.
22.
We consider the problem of service rate control of a single‐server queueing system with a finite‐state Markov‐modulated Poisson arrival process. We show that the optimal service rate is nondecreasing in the number of customers in the system; higher congestion levels warrant higher service rates. On the contrary, however, we show that the optimal service rate is not necessarily monotone in the current arrival rate. If the modulating process satisfies a stochastic monotonicity property, the monotonicity is recovered. We examine several heuristics and show where heuristics are reasonable substitutes for the optimal control. None of the heuristics perform well in all the regimes and the fluctuation rate of the modulating process plays an important role in deciding the right heuristic. Second, we discuss when the Markov‐modulated Poisson process with service rate control can act as a heuristic itself to approximate the control of a system with a periodic nonhomogeneous Poisson arrival process. Not only is the current model of interest in the control of Internet or mobile networks with bursty traffic, but it is also useful in providing a tractable alternative for the control of service centers with nonstationary arrival rates. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 661–677, 2013 相似文献
23.
This paper finds the optimal integrated production schedule and preventive maintenance plan for a single machine exposed under a cumulative damage process, and investigates how the optimal preventive maintenance plan interacts with the optimal production schedule. The goal is to minimize the total tardiness. The optimal policy possesses the following properties: Under arbitrary maintenance plan when jobs have common processing time, and different due dates, the optimal production schedule is to order the jobs by earliest due date first rule; and when jobs have common due date and different processing times, the optimal production schedule is shortest processing time first. The optimal maintenance plan is of control limit type under any arbitrary production schedule when machine is exposed under a cumulative damage failure process. Numerical studies on the optimal maintenance control limit of the maintenance plan indicate that as the number of jobs to be scheduled increases, the effect of jobs due dates on the optimal maintenance control limit diminishes. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
24.
Earlier research on the effects of nonoverlapping temporal aggregation on demand forecasting showed the benefits associated with such an approach under a stationary AR(1) or MA(1) processes for decision making conducted at the disaggregate level. The first objective of this note is to extend those important results by considering a more general underlying demand process. The second objective is to assess the conditions under which aggregation may be a preferable approach for improving decision making at the aggregate level as well. We confirm the validity of previous results under more general conditions, and we show the increased benefit resulting from forecasting by temporal aggregation at lower frequency time units. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 489–500, 2014 相似文献
25.
Operational processes are usually studied in terms of stochastic processes. The main information measure used for predictability of stochastic processes is the entropy rate, which is asymptotic conditional entropy, thus not suitable for application over a finite horizon. We use the conditional entropy to study the predictability of stochastic processes over the finite horizon. It is well‐known that the conditional entropies of stationary processes decrease as the processes evolve, implying that, on average, their pasts become more informative about prediction of their future outcomes. Some important operational processes such as martingale, models for maintenance policies, nonhomogeneous Poisson, and mixed Poisson processes are nonstationary. We show that as a nonstationary process evolves, it may provide more information or less information about the future state of the system. We develop results for comparing the predictability of stochastic processes. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
26.
We consider a supplier with finite production capacity and stochastic production times. Customers provide advance demand information (ADI) to the supplier by announcing orders ahead of their due dates. However, this information is not perfect, and customers may request an order be fulfilled prior to or later than the expected due date. Customers update the status of their orders, but the time between consecutive updates is random. We formulate the production‐control problem as a continuous‐time Markov decision process and prove there is an optimal state‐dependent base‐stock policy, where the base‐stock levels depend upon the numbers of orders at various stages of update. In addition, we derive results on the sensitivity of the state‐dependent base‐stock levels to the number of orders in each stage of update. In a numerical study, we examine the benefit of ADI, and find that it is most valuable to the supplier when the time between updates is moderate. We also consider the impact of holding and backorder costs, numbers of updates, and the fraction of customers that provide ADI. In addition, we find that while ADI is always beneficial to the supplier, this may not be the case for the customers who provide the ADI. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
27.
离散化方法是研究连续参数最优停止理论和马尔可夫过程最优停止理论的有效方法。本文对这一方法进行了阐述,并用此方法解决了两个实际问题。 相似文献
28.
发动机平均值模型的开发与检验 总被引:1,自引:0,他引:1
建立了一个车用增压柴油机工作过程仿真的平均值模型.这个模型重在描述发动机状态变量的时间平均值,结构紧凑,使用方便,实例计算结果与试验值符合较好,适合于电控柴油机硬件在环仿真系统应用. 相似文献
29.
We address the problem of determining optimal ordering and pricing policies in a finite‐horizon newsvendor model with unobservable lost sales. The demand distribution is price‐dependent and involves unknown parameters. We consider both the cases of perishable and nonperishable inventory. A very general class of demand functions is studied in this paper. We derive the optimal ordering and pricing policies as unique functions of the stocking factor (which is a linear transformation of the safety factor). An important expression is obtained for the marginal expected value of information. As a consequence, we show when lost sales are unobservable, with perishable inventory the optimal stocking factor is always at least as large as the one given by the single‐period model; however, if inventory is nonperishable, this result holds only under a strong condition. This expression also helps to explain why the optimal stocking factor of a period may not increase with the length of the problem. We compare this behavior with that of a full information model. We further examine the implications of the results to the special cases when demand uncertainty is described by additive and multiplicative models. For the additive case, we show that if demand is censored, the optimal policy is to order more as well as charge higher retail prices when compared to the policies in the single‐period model and the full information model. We also compare the optimal and myopic policies for the additive and multiplicative models. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
30.
近年来 ,隐马氏模型成为研究相依随机变量的一个十分有用的工具。实际应用过程中的一个很重要的问题是如何对隐马氏模型的参数进行估计。将一类连续时间隐马氏模型的问题转化为离散时间隐马氏模型的问题 ,给出了具体的隐马氏模型———经马氏修正的Poisson过程的极大似然估计及其算法。此类过程被广泛用来对复杂电信网络的交通流进行建模 相似文献