基于拉格朗日松弛的航天测控调度上界求解算法

通过分析航天测控调度问题的测控需求,建立了航天测控调度0-1整数规划模型,运用拉格朗日松弛方法对模型中的设备约束和卫星约束进行了松弛,运用次梯度优化算法求得了拉格朗日对偶问题的上界.最后,通过对两个场景的试验分析,证明了运用次梯度优化算法求得的上界的有效性.     

A branch‐and‐cut algorithm for the quay crane scheduling problem in a container terminal

The quay crane scheduling problem consists of determining a sequence of unloading and loading movements for cranes assigned to a vessel in order to minimize the vessel completion time as well as the crane idle times. Idle times originate from interferences between cranes since these roll on the same rails and a minimum safety distance must be maintained between them. The productivity of container terminals is often measured in terms of the time necessary to load and unload vessels by quay cranes, which are the most important and expensive equipment used in ports. We formulate the quay crane scheduling problem as a vehicle routing problem with side constraints, including precedence relationships between vertices. For small size instances our formulation can be solved by CPLEX. For larger ones we have developed a branch‐and‐cut algorithm incorporating several families of valid inequalities, which exploit the precedence constraints between vertices. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Using real options analysis to value reoptimization options in the shifting bottleneck heuristic

The reoptimization procedure within the shifting bottleneck (SB) involves reevaluation of all previously scheduled toolgroup subproblems at each iteration of the SB heuristic. A real options analysis (ROA) model is developed to value the option to reoptimize in the SB heuristic, such that reoptimization only occurs when it is most likely to lead to a schedule with a lower objective function. To date, all ROA models have sought to value options financially (i.e., in terms of monetary value). The ROA model developed in this paper is completely original in that it has absolutely no monetary basis. The ROA methodologies presented are shown to greatly outperform both full and no reoptimization approaches with respect to both computation time and total weighted tardiness. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Priority and dynamic scheduling in a make‐to‐stock queue with hyperexponential demand

We consider the scheduling problem in a make‐to‐stock queue with two demand classes that can be differentiated based on their variability. One class experiences Poisson arrivals and the other class experiences hyperexponential renewal arrivals. We provide an exact analysis of the case where the demand class with higher variability is given non‐preemptive priority. The results are then used to compare the inventory cost performance of three scheduling disciplines, first‐come first‐serve and priority to either class. We then build on an existing dynamic scheduling heuristic to propose a modification that works well for our system. Extensions of the heuristic to more than two classes and to the case where demand state is known are also discussed. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006.     

基于丛生树的多流水线并行Hash连接的处理机分配算法

本文介绍了并行数据库中实现多流水线Ｈａｓｈ连接的处理机分配算法，该算法对于执行Ｈａｓｈ连接的丛生查询树可同时实现流水线内并行（ＩｎｔｒａｐｉｐｅｌｉｎｅＰａｒａｌｅｌ）和多流水线间的并行（ＩｎｔｒａｐｉｐｅｌｉｎｅＰａｒ－ａｌｅｌ     

支持多媒体应用的CPU调度模型

多媒体应用的出现对操作系统调度模型提出了新的要求，许多多媒体系统中既有硬、软实时应用程序，又有传统的分时应用程序，希望在同一操作系统框架内得到支持。本文提出了支持上述功能的ＣＰＵ调度模型，并设计了两种算法来实现该模型：基于ＱｏＳ的ＣＰＵ带宽划分算法和双优先级调度算法。     

管输水力摩阻不分区计算与实验研究

长输管道输送一般处于紊流区,紊流区的水力摩阻计算一直采用分区计算的方法,涉及到的公式较多,使用起来不方便,并且分区附近存在数值跃变;由于混合摩擦区的计算通常采用近似公式,误差增加,最大甚至可达百分之十几。科尔布鲁克公式被公认为是计算混合摩擦区摩阻因数的准确公式,也可近似地用于水力光滑区和完全粗糙区的计算。文中给出了基于科尔布鲁克公式的水力摩阻计算公式,用该公式统一紊流区水力摩阻计算,并对不同油品在同一管道中流动的水力摩阻损失进行了实验研究,用实验数据分析了水力摩阻计算公式的误差。研究表明,紊流区的水力摩阻计算可不分区,均采用科尔布鲁克公式,以利于工程计算,同时可提高混合摩擦区的计算精度。     

管线探堵理论分析及实验研究

介绍了管线探堵主要方法及特点。分析了埋地管线水力瞬变探堵的理论基础,建立埋地管线快速探堵的数学模型,进行了数值模拟计算和分析,并进行了实验研究。实验证明,根据水力瞬变特性探堵可以快速准确确定堵点位置。水力瞬变探堵系统具有精度高、速度快、设备简单、使用方便、用途广等特点。     

Transshipment through crossdocks with inventory and time windows

A major challenge in making supply meet demand is to coordinate transshipments across the supply chain to reduce costs and increase service levels in the face of demand fluctuations, short lead times, warehouse limitations, and transportation and inventory costs. In particular, transshipment through crossdocks, where just‐in‐time objectives prevail, requires precise scheduling between suppliers, crossdocks, and customers. In this work, we study the transshipment problem with supplier and customer time windows where flow is constrained by transportation schedules and warehouse capacities. Transportation is provided by fixed or flexible schedules and lot‐sizing is dealt with through multiple shipments. We develop polynomial‐time algorithms or, otherwise, provide the complexity of the problems studied. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Disruption management in production planning

We study the problem of recovering a production plan after a disruption, where the disruption may be caused by incidents such as power failure, market change, machine breakdown, supply shortage, worker no‐show, and others. The new recovery plan we seek after has to not only suit the changed environment brought about by the disruption, but also be close to the initial plan so as not to cause too much customer unsatisfaction or inconvenience for current‐stage and downstream operations. For the general‐cost case, we propose a dynamic programming method for the problem. For the convex‐cost case, a general problem which involves both cost and demand disruptions can be solved by considering the cost disruption first and then the demand disruption. We find that a pure demand disruption is easy to handle; and for a pure cost disruption, we propose a greedy method which is provably efficient. Our computational studies also reveal insights that will be helpful to managing disruptions in production planning. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.