Economic lot scheduling of fully loaded processes with external setups

Without restricting the class of permissible schedules, we derive optimal schedules for economic lot scheduling problems that are fully loaded, have external setups, and have only two products. The fully loaded condition accurately represents certain types of bottlenecks. We show that the optimal schedule must have the Wagner-Whitin property. We also develop a measure of aggregate inventory, derive an optimal steady-state aggregate inventory policy, and provide conditions under which the aggregate inventory level of an optimal schedule must approach a steady state. By restricting the class of permissible schedules to rotation cycle schedules, we extend these results to more than two products.     

基于关联离散度的目标类型识别方法

针对空中作战空中目标识别问题,在分析影响目标类别因素的基础上,提出了一种基于关联离散度的空中目标灰色识别方法。该方法采用灰色理论,通过应用定义的关联离散度作为识别测度,因而在无需对现役雷达作太多技术改进的情况下,就可以提高低分辨雷达对空中目标粗略分类的自动判别能力。给出了应用该方法的具体步骤,通过仿真实例证明该算法的有效性。     

基于STAGE平台的模型扩展方法

STAGE(Scenario Toolkit And Generation Environment)是用于开发想定战场环境和武器系统验证的仿真软件。用户可根据需求利用自己开发的仿真模型取代STAGE的内置仿真模型,也可以将开发的仿真模型与STAGE中现有模型进行集成。针对STAGE 6.0仿真开发平台,研究了STAGE模型扩展中的关键技术,实现了用户开发模型与STAGE仿真引擎的集成,从而为快速构建用户自定义战场环境提供了一种新途径。     

The shortest queue model with jockeying

In this article we deal with the shortest queue model with jockeying. We assume that the arrivals are Poisson, each of the exponential servers has his own queue, and jockeying among the queues is permitted. Explicit solutions of the equilibrium probabilities, the expected customers, and the expected waiting time of a customer in the system are given, which only depend on the traffic intensity. Numerical results can be easily obtained from our solutions. Several examples are provided in the article.     

Floor layouts using a multifacility location model

A procedure for obtaining a facilities scatter diagram within a rectangular boundary is developed using a multifacility location model. This method gives favorable computational results and has the advantage over other scatter diagram methods of being able to accommodate fixed facility locations. Examples illustrate how this method can be used by a designer/analyst either as a one-step algorithm or iteratively to build a layout.     

Open-shop scheduling problems with dominated machines

This article deals with special cases of open-shop scheduling where n jobs have to be processed by m, m ?3, machines to minimize the schedule length. The main result obtained is an O(n) algorithm for the three-machine problem with a dominated machine.