装备维修管理系统的设计与实现

装备维修管理系统是一种新型维修管理模式,为解决现代装备协同维修过程中资源优化调度和分配的各类问题,从装备维修保障系统的需求分析入手,讨论了基于改进遗传算法的维修资源配置算法,并采用建模与仿真技术,设计实现了装备维修管理系统。     

Lot streaming with supplier–manufacturer coordination

Lot splitting refers to breaking a production lot into smaller sublots during production. Coordinating lot splitting decisions across multiple stages of a production process is a challenging task. Traditional lot splitting and lot streaming models implicitly assume that the entire system is operated and owned by the same firm, or there exists a coordinator who controls the operation of all machines in the system. In this paper, we consider the situation where the machines in a multiple‐stage production process are owned and managed by different companies. Every item in a given production lot has to go through the processing by the supplier's machine, followed by the manufacturer's machine, and so on. We develop and analyze coordination mechanisms that enable different parties in the supply chain to coordinate their lot splitting decisions so as to achieve a systemwide optimum. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Reformulating linear programs with transportation constraints—With applications to workforce scheduling

We study linear programming models that contain transportation constraints in their formulation. Typically, these models have a multistage nature and the transportation constraints together with the associated flow variables are used to achieve consistency between consecutive stages. We describe how to reformulate these models by projecting out the flow variables. The reformulation can be more desirable since it has fewer variables and can be solved faster. We apply these ideas to reformulate two well‐known workforce staffing and scheduling problems: the shift scheduling problem and the tour scheduling problem. We also present computational results. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

基于运动学模型的灵巧成像卫星观测摆角算法

针对灵巧成像卫星对地面目标观测摆角的计算问题,考虑地球自转和卫星在轨运动等约束,利用空间坐标变换建立了基于椭球体的空间运动学模型.在此模型的基础上,给出了任意时刻卫星对目标观测摆角的计算方法.仿真结果验证了方法的正确性.任意时刻观测摆角的获取为灵巧成像卫星任务调度提供支持.     

A robust policy for serial agile production systems

One of the major problems in modeling production systems is how to treat the job arrival process. Restrictive assumptions such as Markovian arrivals do not represent real world systems, especially if the arrival process is generated by job departures from upstream workstations. Under these circumstances, cost‐effective policies that are robust with respect to the nature of the arrival process become of interest. In this paper, we focus on minimizing the expected total holding and setup costs in a two‐stage produce‐to‐order production system operated by a cross‐trained worker. We will show that if setup times are insignificant in comparison with processing times, then near‐optimal policies can be generated with very robust performances with respect to the arrival process. We also present conditions under which these near‐optimal policies can be obtained by using only the arrival and service rates. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

空域频域不确定条件下电磁探测卫星规划方法研究

电磁探测卫星对区域目标的覆盖搜索在反恐及海上搜救等领域发挥着重要作用.针对电磁探测卫星区域搜索任务中存在的空域频域不确定性,构建了电磁探测卫星区域搜索问题(EDSASP)中不确定因素的量化描述模型及决策要素模型,提出了基于贝叶斯决策的电磁卫星任务规划方法,并以信息探测收益和前端截获收益为优化目标,建立了空域频域不确定条...     

嵌入式操作系统多策略调度模型

分析了目前嵌入式操作系统调度策略的现状,指出了传统调度方法的不足之处,给出了多策略调度模型,该模型根据进程的属性参数决定采用哪种调度算法。多策略调度模型采用两级调度方案,即在原传统调度方法的基础上增加一级调度。一级调度确定多个调度算法的优先顺序;二级调度确定同一种调度算法中,的进程优先顺序。该模型使进程调度更加灵活和高效,应用范围更广。     

Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function

We consider open‐shop scheduling problems where operation‐processing times are a convex decreasing function of a common limited nonrenewable resource. The scheduler's objective is to determine the optimal job sequence on each machine and the optimal resource allocation for each operation in order to minimize the makespan. We prove that this problem is NP‐hard, but for the special case of the two‐machine problem we provide an efficient optimization algorithm. We also provide a fully polynomial approximation scheme for solving the preemptive case. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures

In this paper, we study the problem of scheduling quay cranes (QCs) at container terminals where incoming vessels have different ready times. The objective is to minimize the maximum relative tardiness of vessel departures. The problem can be formulated as a mixed integer linear programming (MILP) model of large size that is difficult to solve directly. We propose a heuristic decomposition approach to breakdown the problem into two smaller, linked models, the vessel‐level and the berth‐level models. With the same berth‐level model, two heuristic methods are developed using different vessel‐level models. Computational experiments show that the proposed approach is effective and efficient. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

带有活动收益不确定特征的成像侦察卫星调度问题

根据区域目标的侦察需求,研究了面向区域目标的多星调度问题。分析了调度问题中活动收益不确定特征,讨论了活动收益的上下界。针对收益不确定的特点,设计了影响力指标用于评估活动对调度方案的影响。基于活动影响力与执行时间设计了一种带局部诱导的禁忌搜索算法,采用分层次的、变评价函数机制引导求解过程趋向多目标优化,在优先提高覆盖率的同时兼顾减少资源消耗。最后,以算例验证了算法的有效性,并通过方案比较说明算法具有较好的寻优能力。