A dual criteria sequencing problem with earliness and tardiness penalties

We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020     

过程方法在防化科研质量管理系统中的应用

介绍了根据国军标要求建立的科研质量管理系统．运用“过程方法”,对现行科研体制下的科研进程进行了识别,并提出了具体的控制要求。     

Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost

We consider a make‐to‐order production–distribution system with one supplier and one or more customers. A set of orders with due dates needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that optimizes an objective function involving the maximum delivery tardiness and the total distribution cost. We first study the solvability of various cases of the problem by either providing an efficient algorithm or proving the intractability of the problem. We then develop a fast heuristic for the general problem. We show that the heuristic is asymptotically optimal as the number of orders goes to infinity. We also evaluate the performance of the heuristic computationally by using lower bounds obtained by a column generation approach. Our results indicate that the heuristic is capable of generating near optimal solutions quickly. Finally, we study the value of production–distribution integration by comparing our integrated approach with two sequential approaches where scheduling decisions for order processing are made first, followed by order delivery decisions, with no or only partial integration of the two decisions. We show that in many cases, the integrated approach performs significantly better than the sequential approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

亚共析钢碳化物相的快速直接球化

依据作者关于钢中奥氏体晶粒尺寸影响相变产物中碳化物形态的观点， 本文分析研究了精轧过程中与碳化物球化有关的金属学问题； 指出在临界温度以下对过冷奥氏体实施精轧， 因铁素体“超量”析出而使奥氏体晶粒细化， 并随精轧形变量的增加， 在晶内诱发共析相变； 精轧后的钢继续在精轧温度短时停留， 可实现碳化物相的优良球化。     

高速列车外形计算机辅助设计

介绍了一种自行开发的用来进行高速列车头尾部流线型外型方案设计的计算机辅助几何造型软件,并给出了一个利用该软件进行设计的实例。     

基于变异离散粒子群的协同空战攻击决策算法

为了提高智能协同空战攻击决策算法性能,将变异策略引入到DPSO(Discrete Particle Swarm Optimization)协同空战攻击决策算法中,提出了一种新的基于变异离散粒子群(Mutation Discrete Particle Swarm Optimization,MDPSO)的协同空战攻击决策算法。基于典型空战想定背景,仿真验证了算法的有效性。采用对比实验方法,基于准确性、可靠性和快速性等关键性能指标,分析比较了基于MDPSO协同空战攻击决策算法与多种智能决策算法,验证了基于MDPSO的协同空战攻击决策算法有着较好的综合性能。     

分布式 Client/Server 智能应用系统 DIAS 的设计与实现

本文针对油气田储集层保护的复杂应用需求,基于分布式Ｃｌｉｅｎｔ／Ｓｅｒｖｅｒ计算机模型,设计了相应的分布式智能应用系统ＤＩＡＳ,实现了计算资源共事和知识、数据共享。该系统已在实际应用中取得了良好的效益。     

提速列车车厢减小空气阻力风洞实验研究

列车提速使得其空气阻力明显增大。为了减小空气阻力，列车车厢气动外形的研究变得愈加重要。在低速风洞中获得的实验结果表明，对现型列车车厢局部外形稍加改善，就能使得其空气阻力大为降低。这是实现我国列车提速最为有效的途径之一。