Cyclical job sequencing on multiple sets of identical machines

The problem posed in this paper is to sequence or route n jobs, each originating at a particular location or machine, undergoing r?1 operations or repairs, and terminating at the location or machine from which it originated. The problem is formulated as a 0-1 integer program, with block diagonal structure, comprised of r assignment subproblems; and a joint set of constraints to insure cyclical squences. To obtain integer results the solutions to each subproblem are ranked as required and combinations thereof are implicitly enumerated. The procedure may be terminated at any step to obtain an approximate solution. Some limited computational results are presented.     

Solving a (0, 1) hyperbolic program by branch and bound

A problem in (0, 1) hyperbolic programming is formulated and solved by the use of branch and bound methods. Computational results are presented including a comparison among several branching rules. Heuristic methods for quickly finding relatively good feasible solutions are presented and tested. The problem finds application in the scheduling of common carriers. In the solution of the main problem, a subproblem is identified and solved. A geometric analogue is presented, which allows an interesting interpretation of the subproblem. The subproblem itself finds application in the design of gambles.     

基于仿射原理的活塞环仿形数控加工系统

本文介绍一种新颖的活塞环非圆轮廓曲线仿形数控加工技术。利用该技术可实现用同一种凸轮加工多种具有不同压力分布曲线的活塞环。当凸轮或刀具磨损后可进行误差补偿加工,提高了机床的“柔性”和精度。同时利用智能决策和模糊控制技术解决抗干扰问题及增强系统的鲁棒性。     

A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop

We present a shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. The method decomposes the job shop into a number of single‐machine subproblems that are solved one after another. Each machine is scheduled according to the solution of its corresponding subproblem. The order in which the single machine subproblems are solved has a significant impact on the quality of the overall solution and on the time required to obtain this solution. We therefore test a number of different orders for solving the subproblems. Computational results on 66 instances with ten jobs and ten machines show that our heuristic yields solutions that are close to optimal, and it clearly outperforms a well‐known dispatching rule enhanced with backtracking mechanisms. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 1–17, 1999     

基于PLC的智能扁平线宽边绕线机的研制

针对扁平线以宽边为绕制方向绕制电机线圈的要求,提出了一种集机械、电气、液压、电子、计算机等先进技术于一体的智能绕线机。机械上有整形、折弯、绕线工位,配合相应的整形缸、阻力缸、垂直压紧缸、绕线缸等液压缸,主要控制核心为PLC控制器,相应的控制信号由行程开关和压力继电器发出。按照流程的要求,编制具有互锁、自锁、连锁的程序。实践证明,传统的整形、折弯、绕制各个分离的工艺流程完全可由一台该机器所取代。该设备的使用能大大减轻工人的劳动强度,节约材料,提高劳动生产率达80%以上。     

基于松弛序列凸优化的轮式机器人协同轨迹规划

针对威胁环境下的多智能体协同轨迹规划问题,以轮式机器人为对象,研究了基于序列凸优化方法的协同轨迹规划方法。首先通过对轮式机器人模型的分析,给出单独轮式机器人实际物理约束,同时以状态量、控制量加权为性能指标,考虑运动学方程、避障避碰约束、个体物理性能约束、终端约束,建立多轮式机器人协同轨迹规划问题;其次,对运动学方程、避障避碰约束进行凸化,证明了满足凸化后的避障避碰约束的解也满足原始避障避碰约束,并进行了几何直观解释;然后,将凸优化子问题进行离散化与松弛化,采用序列凸优化架构进行问题求解;最后,通过数值仿真,对比了松弛序列凸优化方法与现有非线性优化求解器的求解效率。结果表明,松弛序列凸优化方法在尽可能保证最优性的同时大大缩短了计算时间,具有一定工程意义。     

Capacitated warehouse location model with risk pooling

In this article, we introduce the capacitated warehouse location model with risk pooling (CLMRP), which captures the interdependence between capacity issues and the inventory management at the warehouses. The CLMRP models a logistics system in which a single plant ships one type of product to a set of retailers, each with an uncertain demand. Warehouses serve as the direct intermediary between the plant and the retailers for the shipment of the product and also retain safety stock to provide appropriate service levels to the retailers. The CLMRP minimizes the sum of the fixed facility location, transportation, and inventory carrying costs. The model simultaneously determines warehouse locations, shipment sizes from the plant to the warehouses, the working inventory, and safety stock levels at the warehouses and the assignment of retailers to the warehouses. The costs at each warehouse exhibit initially economies of scale and then an exponential increase due to the capacity limitations. We show that this problem can be formulated as a nonlinear integer program in which the objective function is neither concave nor convex. A Lagrangian relaxation solution algorithm is proposed. The Lagrangian subproblem is also a nonlinear integer program. An efficient algorithm is developed for the linear relaxation of this subproblem. The Lagrangian relaxation algorithm provides near‐optimal solutions with reasonable computational requirements for large problem instances. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Markovian approximation for manufacturing systems of unreliable machines in tandem

This paper studies production planning of manufacturing systems of unreliable machines in tandem. The manufacturing system considered here produces one type of product. The demand is assumed to be a Poisson process and the processing time for one unit of product in each machine is exponentially distributed. A broken machine is subject to a sequence of repairing processes. The up time and the repairing time in each phase are assumed to be exponentially distributed. We study the manufacturing system by considering each machine as an individual system with stochastic supply and demand. The Markov Modulated Poisson Process (MMPP) is applied to model the process of supply. Numerical examples are given to demonstrate the accuracy of the proposed method. We employ (s, S) policy as production control. Fast algorithms are presented to solve the average running costs of the machine system for a given (s, S) policy and hence the approximated optimal (s, S) policy. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 65–78, 2001     

Optimal replacement under additive damage and other failure models

A machine or production system is subject to random failure. Upon failure the system is replaced by a new one, and the process repeats. A cost is associated with each replacement, and an additional cost is incurred at each failure in service. Thus, there is an incentive for a controller to attempt to replace before failure occurs. The problem is to find an optimal control strategy that balances the cost of replacement with the cost of failure and results in a minimum total long-run average cost per unit time. We attack this problem under the cumulative damage model for system failure. In this failure model, shocks occur to the system in accordance with a Poisson process. Each shock causes a random amount of damage or wear and these damages accumulate additively. At any given shock, the system fails with a known probability that depends on the total damage accumulated to date. We assume that the cumulative damage is observable by the controller and that his decisions may be based on its current value. Supposing that the shock failure probability is an increasing function of the cumulative damage, we show that an optimal policy is to replace either upon failure or when this damage first exceeds a critical control level, and we give an equation which implicitly defines the optimal control level in terms of the cost and other system parameters. Also treated are some more general models that allow for income lost during repair time and other extensions.     

电机故障诊断中的信息融合利用问题研究

对电机故障诊断中的可用信息进行了分类,并针对单一诊断技术对信息利用不足的问题提出利用信息融合的理论,指出了基于信息融合的电机故障诊断技术应解决的问题;给出了基于信息融合的电机故障诊断的基本框架;最后概述了诊断中信息融合利用的方法。结果表明,充分利用电机运行中的各种信息,采用基于信息融合技术的故障诊断方法可以提高故障诊断的准确性和可靠性。     

CCIP火控计算的CAD研究

以逐步回归理论为基础,应用CAD技术,给出了一种实用的CCIP火控计算研究方法,用该方法研制的火控工作式,不仅简单实用、易于修改,而且比原工作式的精度高。这种采用计算机辅助设计求解CCIP火控工作式的研究方法,也可应用于其它类型的火控工作式设计和一般的数据处理。     

“电机统一理论”在电机控制中的作用

直流电机在恒速时其电压方程为常系数的线性微分方程,在电机控制中能进行快速的转矩和磁通控制。而异步电机是一个多变量、强耦合、非线性的时变参数系统,很难直接通过外加信号准确控制电磁转矩。但若以转子磁通这一旋转的空间矢量为参考坐标,应用"电机统一理论",利用从静止坐标系到旋转坐标系之间的变换,则可以把定子电流中的励磁电流分量与转矩电流分量变成标量独立开来,进行分别控制。这样,通过坐标变换重建的电机模型就可等效为一台直流电机,从而可像直流电机那样进行快速的转矩和磁通控制,给电机控制系统带来新的契机。     

Flow‐shop batch scheduling with identical processing‐time jobs

In many practical situations of production scheduling, it is either necessary or recommended to group a large number of jobs into a relatively small number of batches. A decision needs to be made regarding both the batching (i.e., determining the number and the size of the batches) and the sequencing (of batches and of jobs within batches). A setup cost is incurred whenever a batch begins processing on a given machine. This paper focuses on batch scheduling of identical processing‐time jobs, and machine‐ and sequence‐independent setup times on an m‐machine flow‐shop. The objective is to find an allocation to batches and their schedule in order to minimize flow‐time. We introduce a surprising and nonintuitive solution for the problem. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Modeling the operation of multireservoir systems using decomposition and stochastic dynamic programming

Stochastic dynamic programming models are attractive for multireservoir control problems because they allow non‐linear features to be incorporated and changes in hydrological conditions to be modeled as Markov processes. However, with the exception of the simplest cases, these models are computationally intractable because of the high dimension of the state and action spaces involved. This paper proposes a new method of determining an operating policy for a multireservoir control problem that uses stochastic dynamic programming, but is practical for systems with many reservoirs. Decomposition is first used to reduce the problem to a number of independent subproblems. Each subproblem is formulated as a low‐dimensional stochastic dynamic program and solved to determine the operating policy for one of the reservoirs in the system. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Some simple scheduling algorithms

This paper considers situations in which jobs require only one operation on a single machine, or on one of a set of identical machines. Penalty-free interruption is allowed. Some simple algorithms are given for finding optimum schedules to minimize maximum lateness and total delay, for the single-machine case, and maximum lateness for a restricted multi-machine case. A simple flow problem formulation permits minimizing maximum lateness for the more general multimachine case.     

多轴数控机床的通用运动学综合空间误差模型

提出了一种适用任意结构多轴数控机床的新通用运动学综合空间误差模型。该模型包含了由于制造、安装、运动控制不精确和刀具、床身、工件热变形以及其它因素引起的初始位置误差与运动误差 ,反应了机床误差的实际变化规律 ,对机床工作区误差适时全补偿特别有效。为了发展该新型误差模型 ,运用了多体系统运动学理论和齐次变换矩阵。最后 ,利用所述建模理论和方法 ,给出了 3轴立式数控机床的空间误差模型表达式 ,并分析了其 36种误差成分的变化规律     

主动防护系统分布式火控平台设计与仿真

为设计和验证主动防护系统的分布式火控原理和算法，设计了主动防护系统分布式火控验证平台。根据主动防护系统的攻击原理和功能要求，构造了完整的硬件结构和软件架构，给出了详细的仿真流程，并对系统中涉及的各关键技术进行了分析和建模。最后，整个系统采用面向对象的程序设计方法和虚拟现实技术，实现了数字化的主动防护系统分布式火控仿真系统平台。该平台能够在虚拟作战场景中模拟真实的作战场景，能够有效地再现主动防护系统对目标的打击过程，也为主动防护系统的分布式火控原理验证和功能测试提供了技术手段。     

The value of observing the condition of a deteriorating machine

We examine a small lot production setting in which a machine may go out of control and begin producing defective units. Traditionally, managers have had to rely upon observations of the quality of the output to determine whether the machine is in or out of control. However, with advances in technology such as vibration analysis, it is increasingly possible to obtain much more accurate information about the state of the machine. In this paper, we model and analyze a deteriorating machine in order to gain insight into the conditions under which investments in such technology are most beneficial. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 790–808, 1999     

加工中心实时智能控制系统

加工中心的可靠运行是加工柔性自动化的重要一环。本文利用人工智能和多传感器信息融合技术监视多种加工异常情况,采用多种控制策略,并行工作,进行实时知识处理,推理相应对策,并控制ＣＮＣ系统,使加工恢复正常或停机,避免引起严重破坏。     

A nested benders decomposition approach for telecommunication network planning

Despite its ability to result in more effective network plans, the telecommunication network planning problem with signal‐to‐interference ratio constraints gained less attention than the power‐based one because of its complexity. In this article, we provide an exact solution method for this class of problems that combines combinatorial Benders decomposition, classical Benders decomposition, and valid cuts in a nested way. Combinatorial Benders decomposition is first applied, leading to a binary master problem and a mixed integer subproblem. The subproblem is then decomposed using classical Benders decomposition. The algorithm is enhanced using valid cuts that are generated at the classical Benders subproblem and are added to the combinatorial Benders master problem. The valid cuts proved efficient in reducing the number of times the combinatorial Benders master problem is solved and in reducing the overall computational time. More than 120 instances of the W‐CDMA network planning problem ranging from 20 demand points and 10 base stations to 140 demand points and 30 base stations are solved to optimality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010