排序方式: 共有15条查询结果,搜索用时 156 毫秒
11.
12.
For an M/G/1 queue with the objective of minimizing the mean number of jobs in the system, the Gittins index rule is known to be optimal among the set of non-anticipating policies. We develop properties of the Gittins index. For a single-class queue it is known that when the service time distribution is of type Decreasing Hazard Rate (New Better than Used in Expectation), the Foreground–Background (First-Come-First-Served) discipline is optimal. By utilizing the Gittins index approach, we show that in fact, Foreground–Background and First-Come-First-Served are optimal if and only if the service time distribution is of type Decreasing Hazard Rate and New Better than Used in Expectation, respectively. For the multi-class case, where jobs of different classes have different service distributions, we obtain new results that characterize the optimal policy under various assumptions on the service time distributions. We also investigate distributions whose hazard rate and mean residual lifetime are not monotonic. 相似文献
13.
Nikky Kortbeek Aleida Braaksma Ferry HF Smeenk Piet JM Bakker Richard J Boucherie 《The Journal of the Operational Research Society》2015,66(7):1061-1076
The design and operations of inpatient care facilities are typically largely historically shaped. A better match with the changing environment is often possible, and even inevitable due to the pressure on hospital budgets. Effectively organizing inpatient care requires simultaneous consideration of several interrelated planning issues. Also, coordination with upstream departments like the operating theatre and the emergency department is much-needed. We present a generic analytical approach to predict bed census on nursing wards by hour, as a function of the Master Surgical Schedule and arrival patterns of emergency patients. Along these predictions, insight is gained on the impact of strategic (ie, case mix, care unit size, care unit partitioning), tactical (ie, allocation of operating room time, misplacement rules), and operational decisions (ie, time of admission/discharge). The method is used in the Academic Medical Center Amsterdam as a decision-support tool in a complete redesign of the inpatient care operations. 相似文献
14.
We consider general feed-forward networks of queues with deterministic service times and arbitrary arrival processes. There are holding costs at each queue, idling may or may not be permitted, and servers may fail. We partially characterize the optimal policy and give conditions under which lower priority should be given to jobs that would be delayed later in the network if they were processed now. 相似文献
15.
We consider the optimal order of servers in a tandem queueing system withm stages, an unlimited supply of customers in front of the first stage, and a service buffer of size 1 but no intermediate storage buffers between the first and second stages. Service times depend on the servers but not the customers, and the blocking mechanism at the first two stages is manufacturing blocking. Using a new characterization of reversed hazard rate order, we show that if the service times for two servers are comparable in the reversed hazard rate sense, then the departure process is stochastically earlier if the slower server is first and the faster server is second than if the reverse is true. This strengthens earlier results that considered individual departure times marginally. We show similar results for the last two stages and for other blocking mechanisms. We also show that although individual departure times for a system with servers in a given order are stochastically identical to those when the order of servers is reversed, this reversibility property does not hold for the entire departure process. 相似文献