Optimal selection from a random sequence with observation errors

A form of sequential decision problem is introduced in which options are presented in sequence. with no recall of rejected options (as in the secretary problem), but in which the value of each option may only he inferred from experiments. Decisions have thus to be made concerning both the acceptance and rejection of each option and the degree of experimentation. General properties of the optimal policy are derived, and an algorithm is obtained for the solution in a special case. This special case suggests a heuristic rule for more general situations. the performance of which rule has been investigated by a Monte Carlo study.     

随机脉宽调制的Simulink仿真研究

应用Matlab仿真平台,开发了随机脉宽调制的Simulink仿真文件,运用此仿真文件,研究了逆变器的谐波能量分布随随机增益变化的规律,仿真结果有助于实际装置的研制。     

A generalized Johnson's rule for stochastic assembly systems

Johnson's rule gives the optimal order to schedule a set of jobs through a two-machine flow shop with deterministic processing times. We extend Johnson's rule to fork-join systems with random processing times. Most of the system may be an arbitrary network. We give conditions under which Johnson's rule is optimal in the stochastic sense, in the increasing convex sense, and in expected value. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 211–220, 1997     

神经网络在图象处理中的应用

图象处理是神经网络的一个重要应用领域。本文首先介绍了神经网络的模型、学习规则及其处理能力,在此基础上综述神经网络在图象处理中的应用,重点放在神经网络分类器和Hopfield网络解决图象处理中的最优化问题。     

On n/1/F̄ dynamic deterministic problems

We consider sequencing of n jobs which will arrive intermittently and are to be processed on a single machine; the arrival and the processing times of each jobs are assumed known. A schedule is to be developed that minimizes the mean flow time. Two models are considered: (i) when no pre-emption or inserted idle time is allowed in the schedule, and (ii) when pre-emption is allowed but the jobs follow a pre-empt-repeat discipline We illustrate that Cobham's and Phipp's SPT dispatching rule does not guarantee the optimum F? even for the non-preemptive model We propose a branch and bound algorithm for both models and discuss our computational experience We also examine the relative performances of the optimum nonpre-emptive sequence, and the optimum pre-empt-repeat sequence over that resulting from SPT dispatching rule on a large number of sets of jobs of varying sizes and tightness.     

Scheduling on M parallel machines subject to random breakdowns to minimize expected mean flow time

The problem of scheduling n jobs on m parallel machines is considered when the machines are subject to random breakdowns and job processing times are random variables. An objective function of mean flow time is developed for a general parallel machine system, and an expression of its expected value is derived. The problem is transformed into a deterministic unrelated parallel machine scheduling model with modified processing times when the number of breakdowns is modeled as a generalized Poisson process. © 1994 John Wiley & Sons, Inc.     

Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties

We examine the problem of scheduling n jobs with a common due date on a single machine. The processing time of each job is a random variable, which follows an arbitrary distribution with a known mean and a known variance. The machine is not reliable; it is subject to stochastic breakdowns. The objective is to minimize the expected sum of squared deviations of job completion times from the due date. Two versions of the problem are addressed. In the first one the due date is a given constant, whereas in the second one the due date is a decision variable. In each case, a general form of the deterministic equivalent of the stochastic scheduling problem is obtained when the counting process related to the machine uptime distribution is a generalized Poisson process. A sufficient condition is derived under which optimal sequences are V-shaped with respect to mean processing times. Other characterizations of optimal solutions are also established. Based on the optimality properties, algorithms with pseudopolynomial time complexity are proposed to solve both versions of the problem. © 1996 John Wiley & Sons, Inc.     

Scheduling jobs,with exponentially distributed processing times,on two machines of a flow shop

This paper treats the problem of sequencing n jobs on two machines in a “flow shop.” (That is, each job in the shop is required to flow through the same sequence of the machines.) The processing time of a given job on a given machine is assumed to be distributed exponentially, with a known mean. The objective is to minimize the expected job completion time. This paper proves an optimal ordering rule, previously conjectured by Talwar [10]. A formula is also derived through Markov Chain analysis, which evaluates the expected job completion time for any given sequence of the jobs. In addition, the performance of a heuristic rule is discussed in the light of the optimal solution.     

粗集理论在目标识别信息处理中的应用

为提取传感器获得的较粗糙的原始信息,运用粗集理论进行目标识别信息的处理,提出了一种采用关系表存储原始信息,通过简化关系表删去冗余信息,从而达到提取有用信息的处理方法.根据此方法,实例中通过对生成的规则进行优选,得到了简单准确的目标识别规则.此理论在信息处理中的应用,较好地满足了目标识别中原始信息处理的需求.     

A single-machine scheduling problem with random processing times

We consider the problem of scheduling n jobs with random processing times on a single machine in order to minimize the expected variance of the completion times. We prove a number of results, including one to the effect that the optimal schedule must be V shaped when the jobs have identical means or variances or have exponential processing times.     

基于Dempster组合规则的电子目标识别算法研究

在军事目标识别中,必须综合考虑目标的电磁辐射信息和红外图像信息,并采用有效的识别算法,才能准确识别电子目标。提出了基于Dempster组合规则的电子目标综合识别方法,完成了基于Dempster组合规则的电子目标自动识别综合处理算法研究,并进行了仿真实验,试验结果表明,该算法是可行的。     

A note on parallel machine replacement

Jones, Zydiak, and Hopp [1] consider the parallel machine replacement problem (PMRP), in which there are both fixed and variable costs associated with replacing machines. Increasing maintenance cost motivates replacements, and a fixed replacement cost provides incentive for replacing machines of the same age in clusters. They prove two intuitive but important results for finite- or infinite-horizon PMRPs, which significantly reduce the size of the linear programming (LP) formulation of the problem and computing efforts required to obtain an optimal replacement policy. Their results are the no-splitting rule (NSR) and the older cluster replacement rule (OCRR). Under a slightly weaker set of assumptions, we prove a third rule, the all-or-none rule (AONR), which states that in any period, an optimal policy is to keep or to replace all the machines regardless of age. This result further reduces the size of the LP formulation of the PMRP. © 1993 John Wiley & Sons, Inc.     

防空C~3I通信子网信息模型

分析了防空Ｃ３Ｉ系统通信子网数据到达、处理、传递的随机分布规律及其影响的诸因素,并提出了数据到达的ＡＲ（１）随机序列模型。分析所得出的结论,对建立仿真系统及通信子网性能分析有参考价值。     

Scheduling maintenance and semiresumable jobs on a single machine

The majority of scheduling literature assumes that the machines are available at all times. In this paper, we study single machine scheduling problems where the machine maintenance must be performed within certain intervals and hence the machine is not available during the maintenance periods. We also assume that if a job is not processed to completion before the machine is stopped for maintenance, an additional setup is necessary when the processing is resumed. Our purpose is to schedule the maintenance and jobs to minimize some performance measures. The objective functions that we consider are minimizing the total weighted job completion times and minimizing the maximum lateness. In both cases, maintenance must be performed within a fixed period T, and the time for the maintenance is a decision variable. In this paper, we study two scenarios concerning the planning horizon. First, we show that, when the planning horizon is long in relation to T, the problem with either objective function is NP-complete, and we present pseudopolynomial time dynamic programming algorithms for both objective functions. In the second scenario, the planning horizon is short in relation to T. However, part of the period T may have elapsed before we schedule any jobs in this planning horizon, and the remaining time before the maintenance is shorter than the current planning horizon. Hence we must schedule one maintenance in this planning horizon. We show that the problem of minimizing the total weighted completion times in this scenario is NP-complete, while the shortest processing time (SPT) rule and the earliest due date (EDD) rule are optimal for the total completion time problem and the maximum lateness problem respectively. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 845–863, 1999     

结合词语规则和 SVM 模型的军事命名实体关系抽取方法?

抽取作战文书中的军事命名实体关系，是实现作战文书语义理解的一种有效方法。在分析作战文书中军事命名实体词语规则的基础上，提出了一种结合词语规则和 SVM 模型的军事命名实体关系抽取方法。首先，使用词语规则整合作战文书中连续出现的军事命名实体并抽取其关系，使其更加适合 SVM 模型。然后，使用 SVM 模型对传统规则模板难以使用的词窗、词性和距离等特征进行建模，抽取军事命名实体关系。实验结果表明，优先利用词语规则能充分提高 SVM 模型抽取军事命名实体关系的效果，与单纯使用 SVM 模型相比，准确率和召回率分别提高了8．73％和41．71％。     

Heuristics for minimizing mean tardiness for m parallel machines

The concept of parallel operations has been widely used in manufacturing and data processing. However, not many efficient methods have been proposed to reduce job tardiness. This article proposes an efficient heuristic to minimize the mean tardiness of a set of tasks with known processing times and due dates for single and m parallel machines. For the single-machine case, the proposed heuristic is compared with the well-known Wilkerson and Irwin algorithm; for the m parallel machine case, it is compared with an extension of the Wilkerson-Irwin algorithm. We also introduce a simple dispatching rule, and it is compared with some existing dispatching rules. The comprehensive simulation results show that the proposed heuristic performs better than the Wilkerson-Irwin algorithm at a significantly reduced computational time.     

Adaptive random search for continuous simulation optimization

We present, analyze, and compare three random search methods for solving stochastic optimization problems with uncountable feasible regions. Our adaptive search with resampling (ASR) approach is a framework for designing provably convergent algorithms that are adaptive and may consequently involve local search. The deterministic and stochastic shrinking ball (DSB and SSB) approaches are also convergent, but they are based on pure random search with the only difference being the estimator of the optimal solution [the DSB method was originally proposed and analyzed by Baumert and Smith]. The three methods use different techniques to reduce the effects of noise in the estimated objective function values. Our ASR method achieves this goal through resampling of already sampled points, whereas the DSB and SSB approaches address it by averaging observations in balls that shrink with time. We present conditions under which the three methods are convergent, both in probability and almost surely, and provide a limited computational study aimed at comparing the methods. Although further investigation is needed, our numerical results suggest that the ASR approach is promising, especially for difficult problems where the probability of identifying good solutions using pure random search is small. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

基于算子空间的公式发现算法研究

在FDD提出的人工智能技术与曲线拟合技术结合的公式发现系统的基础上 ,提出了新的基于算子空间的公式发现算法 ,并在算法研究的基础上设计实现基于算子空间的可视化公式发现系统 ,该系统通过算子空间概念的引入 ,简化了算子空间的规则 ,同时引入导数规则、误差规则以及终止规则 ,丰富了知识库内容。通过以上改进 ,和BACON和FDD相比 ,公式发现的形式更广 ,复杂度更高。文章最后给出了应用实例以及公式发现的结果。     

An approximate planning model for distributed computing networks

We develop an approximate planning model for a distributed computing network in which a control system oversees the assignment of information flows and tasks to a pool of shared computers, and describe several optimization applications using the model. We assume that the computers are multithreaded, and have differing architectures leading to varying and inconsistent processing rates. The model is based on a discrete‐time, continuous flow model developed by Graves [Oper Res 34 (1986), 522–533] which provides the steady‐state moments of production and work‐in‐queue quantities. We make several extensions to Graves' model to represent distributed computing networks. First, we approximately model control rules that are nonlinear functions of the work‐in‐queue at multiple stations through a linearization approach. Second, we introduce an additional noise term on production and show its use in modeling the discretization of jobs. Third, we model groups of heterogeneous computers as aggregate, “virtual computing cells” that process multiple tasks simultaneously, using a judiciously selected control rule. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness

We study a parallel machine scheduling problem, where a job j can only be processed on a specific subset of machines M_j, and the M_j subsets of the n jobs are nested. We develop a two‐phase heuristic for minimizing the total weighted tardiness subject to the machine eligibility constraints. In the first phase, we compute the factors and statistics that characterize a problem instance. In the second phase, we propose a new composite dispatching rule, the Apparent Tardiness Cost with Flexibility considerations (ATCF) rule, which is governed by several scaling parameters of which the values are determined by the factors obtained in the first phase. The ATCF rule is a generalization of the well‐known ATC rule which is very widely used in practice. We further discuss how to improve the dispatching rule using some simple but powerful properties without requiring additional computation time, and the improvement is quite satisfactory. We apply the Sequential Uniform Design Method to design our experiments and conduct an extensive computational study, and we perform tests on the performance of the ATCF rule using a real data set from a large hospital in China. We further compare its performance with that of the classical ATC rule. We also compare the schedules improved by the ATCF rule with what we believe are Near Optimal schedules generated by a general search procedure. The computational results show that especially with a low due date tightness, the ATCF rule performs significantly better than the well‐known ATC rule generating much improved schedules that are close to the Near Optimal schedules. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 249–267, 2017