极小化不可行量函数的Flow Shop变异问题

讨论一类Flowshop的变异问题。在这类变异问题中 ,给定一个截止工期 ,该工期比Flowshop最优调度中的最大完工时间小。讨论的问题是在全部工件的完工时间不超过截止工期的限制下 ,极小化不可行量函数。这类问题与矩阵函数因子分解有着密切联系。基于对问题的分析 ,证明了这一问题等价于单机调度中极小化类似的延迟量函数。推广了已有的结论。     

LOGISTICS SCHEDULING： ANALYSIS OFTWO-STAGE PROBLEMS

This paper studies the coordination effects between stages for scheduling problems where decision-making is a two-stage process. Two stages are considered as one system. The system can be a supply chain that links two stages, one stage representing a manufacturer; and the other, a distributor It also can represent a single manufacturer, while each stage represents a different department responsible for a part of operations. A problem that jointly considers both stages in order to achieve ideal overall system performance is defined as a system problem. In practice, at times, it might not be feasible for the two stages to make coordinated decisions due to (i) the lack of channels that allow decision makers at the two stages to cooperate, and/or (ii) the optimal solution to the system problem is too difficult (or costly) to achieve.Two practical approaches are applied to solve a variant of two-stage logistic scheduling problems. The Forward Approach is defined as a solution procedure by which the first sta     

FROM MANUFACTURING SCHEDULING TO SUPPLY CHAIN COORDINATION：THE CONTROL OF COMPLEXITY AND UNCERTAINTY

With time-based competition and rapid technology advancements, effective manufacturingscheduling and supply chain coordination are critical to quickly respond to changing marketconditions. These problems, however, are difficult in view of inherent complexity and variousuncertainties involved. Based on a series of results by the authors, decomposition and coordination byusing Lagrangian relaxation is identified in this paper as an effective way to control complexity anduncertainty.A manufacturing scheduling problem is first formulated within the job shop context withuncertain order arrivals, processing times, due dates, and part priorities as a separable optimizationproblem. A solution methodology that combines Lagrangian relaxation, stochastic dynamicprogramming, and heuristics is developed. Method improvements to effectively solve large problemsare also highlighted. To extend manufacturing scheduling within a factory to coordinate autonomicmembers across chains of suppliers, a decentralized supply chai     

一种分层多播的带宽适应策略

提出了一种基于接收端意见反馈的带宽适应策略。在该策略中，为了避免反馈信息在源端的爆炸，给出了一个路由器分流合并的方法，使得带宽适应策略具有良好的缩放性。     

基于IP多播的机房信息管理系统的设计与实现

提出了一种基于IP多播技术的解决方案并加以实现,满足了对上机学生按系或班级分组进行管理与各类统计的需要,实现了传统C/S结构所能实现的全部功能,解决了传统机房信息管理系统使用带来的问题。     

改善嵌入式Linux实时性能的方法研究

分析了Linux的实时性,针对其在实时应用中的技术障碍,在参考了与此相关研究基础上,从三方面提出了改善Linux实时性能的改进措施.为提高嵌入式应用响应时间精度,提出两种细化Linux时钟粒度方法;为增强系统内核对实时任务的响应能力,采用插入抢占点和修改内核法增强Linux内核的可抢占性;为保证硬实时任务的时限要求,把原Linux的单运行队列改为双运行队列,硬实时任务单独被放在一个队列中,并采用MLF调度算法代替原内核的FiFO调度算法.     

小浪底水利枢纽调度自动化系统

小浪底水利枢纽调度自动化系统是根据小浪底一西霞院水库的综合利用要求，作出水库调度计划，确定水库的调度对策及闸门的开启计划，制定闸门的操作命令，实现了小浪底一西霞院梯级枢纽常规水库调度业务。     

知识的粒度计算及其应用

粗糙集理论是一种较新的软计算方法 ,可以有效地分析和处理不完备信息 .本文介绍了知识的粒度、属性的重要度及协调度等概念及计算方法 ,并给出属性的重要度在求属性集的最小约简、协调度在构造决策树方面的具体步骤 .最后 ,通过几个例子说明了这些概念和方法的有效性.     

DL系统在给水生产中的应用

郑州市自来水公司供水调度监测系统（SCADA系统），主要监测的数据为水厂运行工况和管网供水压力两大部分。调度人员依据监测到的供水参数，科学、合理、及时指挥供水生产，以实现用最低供水成本，满足城市供水需求，保证供水服务压力。要实现这个目的，就必须时刻掌握城市供水管网的压力，确保城市供水管网的压力不致于有太大波动；压力过高将造成供水成本增加，过低则影响居民和工商业用水。