On scheduling with ready-times,due-dates and vacations

A single machine sequencing problem is considered in which there are ready-time and due-date constraints on jobs and vacation constraints on the machine. Each vacation has fixed starting and finish time and no preemption is allowed for the jobs. The objective is to minimize maximum lateness. An intriguing feature of this formulation is that it allows sequencing in disconnected time windows. A relaxation of the problem is obtained by modeling the vacations as a set of jobs with flexible ready-times and artificial due-dates and a branch and bound algorithm is developed for the problem. In the algorithm, the search is not only guided by the bounds but also by a careful manipulation of the artificial due-dates. Consequently; while searching in the relaxed solution space, solutions of the original problem are implicitly enumerated. Computational results indicate that the algorithm can satisfactorily solve problems with multiple vacations.     

When is greedy module assembly optimal?

Many coherent systems are configurations of identically structured modules, each consisting of a number of different components. The objective is to assemble the modules out of a collection of available components, and to install the modules in the system in a way that maximizes reliability. The greedy assembly rule builds one module out of the best available components, another out of the best remaining components, and so on. This article shows that greedy assembly is optimal whenever the modules have a series structure, no matter what the structure of the system in which the modules will be used might be, provided that the modules, once assembled, are installed in the system in an optimal way. The article also demonstrates that series modules are unique in this regard.     

Multiaction maintenance under markovian deterioration and incomplete state information

Much research been devoted to modeling the replacement problem under incomplete state information. Almost no work has been done on the maintenance problem under incomplete information with multiple maintenance actions that may not return the system to as good as new. We model this problem and derive structural results concerning the optimal maintenance policy. For the case where the effect of maintenance actions is state dependent, we give conditions under which the optimal policy is finitely computable. Where maintenance is state independent we show a specific structure, consisting of monotonic waiting times and constant maintenance actions, to be optimal.     

低调谐增益变化的10 GHz电感电容式压控振荡器设计

基于0.18μm CMOS工艺,设计了一种应用于无线通信和雷达系统的低变化调谐增益的电感电容式压控振荡器.该电路包括分布式偏置可变电容阵列和开关电容阵列,合理选择偏置电压扩展电容-电压曲线覆盖范围,在整个调谐电压范围内,可有效降低调谐增益.三位开关电容阵列将整个可调频率范围分为8个子频带,通过控制可变电容实现子频带内频...     

The frequency assignment problem: A solution via nonlinear programming

This paper gives a mathematical programming model for the problem of assigning frequencies to nodes in a communications network. The objective is to select a frequency assignment which minimizes both cochannel and adjacent-channel interference. In addition, a design engineer has the option to designate key links in which the avoidance of jamming due to self interference is given a higher priority. The model has a nonconvex quadratic objective function, generalized upper-bounding constraints, and binary decision variables. We developed a special heuristic algorithm and software for this model and tested it on five test problems which were modifications of a real-world problem. Even though most of the test problems had over 600 binary variables, we were able to obtain a near optimum in less than 12 seconds of CPU time on a CDC Cyber-875.     

病态信息及其相关概念研究

本文从有关病态信息的灾难事件的报道入手,列举了病态信息在11个领域内的特殊表象,阐述了病态信息对于向信息化社会过渡过程的影响。归纳出病态信息术语发展的“假数据”、“异常数据”、“病态数据”和“病态信息”四个阶段。归纳出当前国内外有关病态信息方面研究的建设性概念、比照性概念、谓词结构概念、指标性概念和领域性概念等五个类别。对病态信息概念的内涵进行了深入的探讨,给出了基本达到“普适”标准的定义。     

正确认识和走出CAI的误区

CAI能解决很多传统课堂教学中没有解决的问题,但应该正确认识和使用CAI,CAI是手段而不是目的,应该防止走入CAI的误区。     

The value of information sharing in a two‐stage supply chain with production capacity constraints

We consider a simple two‐stage supply chain with a single retailer facing i.i.d. demand and a single manufacturer with finite production capacity. We analyze the value of information sharing between the retailer and the manufacturer over a finite time horizon. In our model, the manufacturer receives demand information from the retailer even during time periods in which the retailer does not order. To analyze the impact of information sharing, we consider the following three strategies: (1) the retailer does not share demand information with the manufacturer; (2) the retailer does share demand information with the manufacturer and the manufacturer uses the optimal policy to schedule production; (3) the retailer shares demand information with the manufacturer and the manufacturer uses a greedy policy to schedule production. These strategies allow us to study the impact of information sharing on the manufacturer as a function of the production capacity, and the frequency and timing in which demand information is shared. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

打赢现代应急动员“三大战役”——四川“5·12”抗震救灾动员回眸

“5·12”抗震救灾动员是新中国成立以来首次为应对重大突发事件,而在全国范围内实施的大规模局部动员和一省范围内实施的总动员,是一次真正意义上的应急动员。为有效应对这一重大自然灾害引发的原生危机、次生（衍生）危机和社会危机,此次应急动员活动围绕三大动员方向,科学调配社会力量资源,适时动态转换动员重心,打赢了现代应急动员“三大战役”,为未来应急动员的组织实施提供了宝贵经验和有益借鉴。     

浅谈二维条码在军品生产的应用

随着武器装备技术水平和复杂程度的提高,在生产过程和使用过程中需保存的信息量不断增大,这些信息对于控制军品质量、售后服务、维修保障等工作具有重要作用。本文着重介绍了二维条码的特点和优势,从软硬件要求、应用方法、存在问题及对策等方面,简要地提出了二维条码在军品生产中的作用和应用形式。