链约束下加工时间恶化的Flow Shop排序问题

讨论作业具有线性加工时间,作业间具有链约束的两台处理机流水作业排序问题,目标函数为极小化完工时间。在作业加工时间简单线性恶化下,提出作业的非负开始和停止延迟恶化率,构造了满足约束条件的复合作业。在此基础上,给出作业间具有平行链约束的两台处理机流水作业排序问题的最优多项式算法。     

卫星任务调度问题的约束规划模型

卫星任务规划与调度是空间资源管理的重要内容之一,其目的在于为卫星系统的任务计划编制提供科学合理的决策手段与依据。卫星任务调度问题的重要特点在于,调度任务存在可见时间窗口约束。只有在可见时间窗口内,调度任务才可能执行并完成。在进行合理假设的基础上,建立卫星任务调度问题的约束规划模型。对基本禁忌搜索算法进行改进,提出了模型求解的变邻域禁忌搜索算法。应用结果表明,约束规划模型的建立与求解是合理的。     

面向作战任务的最小风险传感器调度方法

基于风险理论提出一种面向不同目标探测任务的传感器调度方法。将主动传感器辐射被截获风险和目标探测风险结合起来,建立一般目标探测框架下的传感器最小风险调度模型。分目标跟踪、目标识别和目标威胁等级评估三种情况将传感器最小风险调度模型具体化,给出不同情况下目标探测风险值的计算方法。针对模型的求解提出一种基于混沌思想、反向学习和双向轮盘赌的改进人工蜂群算法。通过仿真实验证明了模型的可行性和算法的有效性。     

Energy‐efficient scheduling for sustainable manufacturing systems with renewable energy resources

Environmentally friendly energy resources open a new opportunity to tackle the problem of energy security and climate change arising from wide use of fossil fuels. This paper focuses on optimizing the allocation of the energy generated by the renewable energy system to minimize the total electricity cost for sustainable manufacturing systems under time‐of‐use tariff by clipping the peak demand. A rolling horizon approach is adopted to handle the uncertainty caused by the weather change. A nonlinear mathematical programming model is established for each decision epoch based on the predicted energy generation and the probability distribution of power demand in the manufacturing plant. The objective function of the model is shown to be convex, Lipchitz‐continuous, and subdifferentiable. A generalized benders decomposition method based on the primal‐dual subgradient descent algorithm is proposed to solve the model. A series of numerical experiments is conducted to show the effectiveness of the solution approach and the significant benefits of using the renewable energy resources.     

悬空管道的安全性评估

土壤滑坡或土壤冲蚀造成一段埋地管道成为悬空。管道悬空严重影响埋地输油管道的安全运行。基于双参数模型地基理论,把悬空管道设定为弹性地基梁,考虑轴向力、内压、内流、外流和土壤刚度系数等因素的作用,建立管道与土壤相互作用的力学模型,计算悬空管道的临界长度评估其安全性。根据管道边界条件和失效模式的不同,分析上述各因素对悬空管道临界长度的影响,进而对悬空管道的屈服失效、屈曲失效、共振和疲劳失效进行安全评估。结论对埋地管道的合理设计、土壤刚度的处理、管道安全性的提高具有工程实际意义。     

输油管道悬空管段过渡长度分析

在地质灾害作用下,埋地输油管道下方的土层下陷或流失会造成管道悬空。悬空管段入土端到埋地段嵌固点的长度定义为悬空管段的过渡长度,其会对悬空管段的固有频率产生很大影响。基于Winkler线性理论,建立管道与土壤相互作用的力学模型,以埋地管段横向位移和轴向位移为零处作为固定边界条件,计算输油管道悬空管段的过渡长度。利用ANSYS软件建立过渡长度有限元模型,计算悬空管段的固有频率,与实测数据对比分析。研究表明,过渡长度对悬空管段的静力分析、振动分析以及输油管道的完整性评价都有非常重要的意义。     

差压式管道内检测机器人驱动力与速度分析

差压式管道内检测机器人是利用管道中流动介质压力差驱动的检测装置,机器人受力情况及周围流场分布对其运动状态有着重要的影响。通过对检测机器人受力分析和数值模拟,讨论了影响给定机器人驱动力的主要因素,得到了以水为流动介质在水平管道情况下,水流速度与机器人稳态速度的近似关系式,为以后进一步研究机器人定位提供帮助。     

管道瞬态激振响应管长的计算

在水击压力波沿管道传播的过程中,遇到内部流场边界时,就会对管道产生激振响应,从而引起管道的振动。针对管道的激振响应,分别从水击波的简化模型和考虑管道和流体相互作用的固液耦合模型,推导了管道瞬态激振响应中的激振部件间隔管长计算公式,分析比较了简化模型和耦合模型的不同,并且提出一些防止共振的方法。     

Client‐contractor bargaining on net present value in project scheduling with limited resources

The client‐contractor bargaining problem addressed here is in the context of a multi‐mode resource constrained project scheduling problem with discounted cash flows, which is formulated as a progress payments model. In this model, the contractor receives payments from the client at predetermined regular time intervals. The last payment is paid at the first predetermined payment point right after project completion. The second payment model considered in this paper is the one with payments at activity completions. The project is represented on an Activity‐on‐Node (AON) project network. Activity durations are assumed to be deterministic. The project duration is bounded from above by a deadline imposed by the client, which constitutes a hard constraint. The bargaining objective is to maximize the bargaining objective function comprised of the objectives of both the client and the contractor. The bargaining objective function is expected to reflect the two‐party nature of the problem environment and seeks a compromise between the client and the contractor. The bargaining power concept is introduced into the problem by the bargaining power weights used in the bargaining objective function. Simulated annealing algorithm and genetic algorithm approaches are proposed as solution procedures. The proposed solution methods are tested with respect to solution quality and solution times. Sensitivity analyses are conducted among different parameters used in the model, namely the profit margin, the discount rate, and the bargaining power weights. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Exact algorithms for scheduling multiple families of jobs on parallel machines

In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003.