排序方式: 共有45条查询结果,搜索用时 15 毫秒
1.
2.
3.
4.
We consider the problem of scheduling a set of jobs on a single machine subject to random breakdowns. We focus on the preemptive‐repeat model, which addresses the situation where, if a machine breaks down during the processing of a job, the work done on the job prior to the breakdown is lost and the job will have to be started from the beginning again when the machine resumes its work. We allow that (i) the uptimes and downtimes of the machine follow general probability distributions, (ii) the breakdown process of the machine depends upon the job being processed, (iii) the processing times of the jobs are random variables following arbitrary distributions, and (iv) after a breakdown, the processing time of a job may either remain a same but unknown amount, or be resampled according to its probability distribution. We first derive the optimal policy for a class of problems under the criterion to maximize the expected discounted reward earned from completing all jobs. The result is then applied to further obtain the optimal policies for other due date‐related criteria. We also discuss a method to compute the moments and probability distributions of job completion times by using their Laplace transforms, which can convert a general stochastic scheduling problem to its deterministic equivalent. The weighted squared flowtime problem and the maintenance checkup and repair problem are analyzed as applications. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
5.
Henry U. Ufomba 《Defense & Security Analysis》2012,28(4):360-367
Apart from North Korea, no state's nuclear program in the twenty-first century has raised more concern to international security than Iran's. While Iran insists that its nuclear program is strictly for civilian purpose in line with Article IV of non-proliferation treaty, the USA and its allies insist that Iran has military intentions and called for sanctions. The failure of sanctions to deter Iran from its nuclear agenda had made many scholars and policy-makers call for a preemptive attack on Iranian nuclear facilities. Situated within this debate, this paper positions itself as an antagonist to the preemptive airstrike option and argues that involving India in a possible nuclear “iron curtain” against Iran – a move known as technical isolation – remains the best option to the current nuclear crises. 相似文献
6.
基于Vague集的TOPSIS法求解目标优先级 总被引:1,自引:0,他引:1
针对传感器管理中目标—传感器配对出现的目标优先级求解问题,提出了一种基于Vague集的TOPSIS计算方法。在分析目标优先级的主要影响因素基础上,定义了各影响因素的影响系数。同时结合Vague集的TOPSIS法给出了目标优先级的计算步骤,为目标优先级求解提供了一种新途径。并结合仿真算例表明该方法的合理性与有效性。 相似文献
7.
8.
Tsuyoshi Katayama 《海军后勤学研究》2001,48(7):638-651
We consider a single‐queue with exhaustive or gated time‐limited services and server vacations, in which the length of each service period at the queue is controlled by a timer, i.e., the server serves customers until the timer expires or the queue becomes empty, whichever occurs first, and then takes vacations. The customer whose service is interrupted due to the timer expiration may be attended according to nonpreemptive or preemptive service disciplines. For the M/G/1 exhaustive/gated time‐limited service queueing system with an exponential timer and four typical preemptive/nonpreemptive service disciplines, we derive the Laplace—Stieltjes transforms and the moment formulas for waiting times and sojourn times through a unified approach, and provide some new results for these time‐limited service disciplines. © John Wiley & Sons, Inc. Naval Research Logistics 48: 638–651, 2001. 相似文献
9.
R.E. Lillo 《海军后勤学研究》2001,48(3):201-209
An optimal operating policy is characterized for the infinite‐horizon average‐cost case of a single server queueing control problem. The server may be turned on at arrival epochs or off at departure epochs. Two classes of customers, each of them arriving according to an independent Poisson processes, are considered. An arriving 1‐customer enters the system if the server is turned on upon his arrival, or if the server is on and idle. In the former case, the 1‐customer is selected for service ahead of those customers waiting in the system; otherwise he leaves the system immediately. 2‐Customers remain in the system until they complete their service requirements. Under a linear cost structure, this paper shows that a stationary optimal policy exists such that either (1) leaves the server on at all times, or (2) turns the server off when the system is empty. In the latter case, we show that the stationary optimal policy is a threshold strategy, this feature being commonplace in most of priority queueing systems and inventory models. However, the optimal policy in our model is determined by two thresholds instead of one. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 201–209, 2001 相似文献
10.
摘要:针对单小批量武器装备保障的特殊需求,对传统的质量屋模型进行了改进,建立了基于装备保障需求与保障规则的质量屋模型,利用整数规划技术进行求解,使得单小批量武器的装备保障规则按照实际保障需求重新排列优先次序,并通过对某型火炮保障方案的筛选验证了模型的正确性.新的质量屋模型发展完善了质量屋的理论与方法,有助于提高单小批量武器的装备保障能力. 相似文献