高速分组交换网络中调度器的设计

为了满足迅猛发展的网络业务对网络服务质量提出的更高要求,使用高速分组网络交换机中的队列调度器可以有效地提供高质量的网络服务。通过采用分级式队列调度和四种队列调度算法有效地实现了队列调度器的设计。并且深入地比较和分析了队列调度器中多种队列调度算法的优缺点,尤其是对DRR调度算法进行了优化和改进。最后。对所设计的电路进行了仿真验证和电路综合,结果表明该调度器可以满足网络对服务质量的更高要求,并且能够应用到高速分组交换网络的调度器设计中。     

基于基因表达式的克隆选择算法求解JSP问题

针对作业车间调度问题的特征,提出一种基于基因表达式的克隆选择算法。在这个方法中,采用基因表达式编程算法中的编码方式来表示调度方案,同时为了提出的方法具有更强的全局搜索能力,运用克隆选择算法作为搜索引擎。最后,验证提出的方法的有效性,对7组Benchmark实例进行测试。实验结果表明,基于基因表达式的克隆选择算法在求解作业车间调度问题中是非常有效的。     

基于滚动时域优化的机场起降动态调度

为了减少作战时军用飞机实际起降时刻与计划起降时刻产生的偏差,提出一种基于滚动时域优化原理的动态机场起降调度策略,分析军用飞机起降过程中的时间窗口约束和尾流间隔约束。对进入每个预测窗口内的飞机队列,以加权提前/延误时间和最小作为目标函数,将军用飞机起降调度模型转换为带到达时间的单机加权E/T调度模型。设计一种针对自然数域的离散粒子群算法,并应用该算法进行模型求解。通过仿真实验确定了算法的参数,仿真结果说明了模型和算法的有效性。     

考虑多样化需求的诊疗设备维护和患者调度联合优化研究

针对诊疗设备维护和住院患者候诊难以有效协调的问题,建立了联合优化模型。首先,假设设备具有离散的劣化状态,将设备的劣化过程建模为连续时间马尔可夫链;其次,考虑到患者对诊疗设备的不同功能频率需求,以及不同劣化状态对患者治疗时间、费用的影响,以患者就诊顺序、检查策略、修复策略为决策变量建立了设备维护和患者调度模型;最后,采用改进后的非支配排序遗传算法对多目标问题进行了求解。实验结果验证了设备维护与患者调度联合优化模型的有效性。改进后的算法提高了整体和局部的搜索能力,且具有鲁棒性。     

考虑疫情扩散传播风险的多目标拼车应急管理优化调度模型

为了解决在疫情背景下传统拼车出行模式面临的交互传染风险,对疫情背景下的拼车管理进行分析,提出了将低风险及潜在风险乘客分开服务的拼车策略。在进一步考虑拼车系统应兼顾的社会效益及服务质量的基础上,构建了在满足基本额定盈利及最小化等待时长的双目标拼车应急管理优化调度模型,并给出了求解该模型的组合模拟退火算法。通过具体算例对模型的有效性进行验证,结果表明模型能够较快收敛到一个稳定值,且计算结果能够反映实际场景,说明了模型及算法的有效性。最后,通过一个仿真实验对所构建模型在病毒传播中的作用进行了分析,结果显示所构建的模型可以有效抑制拼车导致的病毒传播速度。     

高坝泄洪诱发场地振动响应分析及传播规律

为研究高坝泄洪诱发场地振动的问题,提出一种基于黏弹性人工边界的有限元数值模拟和水力学模型试验相结合的方法计算场地振动响应。以国内某工程为例,计算不同工况下场地振动响应,分析泄洪量和泄洪调度方式对场地振动的影响,揭示不同岩体条件下振动波的传播规律。结果表明:该工程各种泄洪方式都不会对周边居民的生活造成影响;泄洪量越大,下游场地振动响应越大,当3个溢洪洞泄洪条件一致时,采用2号洞泄洪最不利;同等泄洪条件下,采用4洞均分泄洪的振动响应小于按设计开度泄洪的振动响应;模型范围内放大振动波的主因是断层左右岩体性质的差异,断层的存在进一步加大了放大效应。     

清江来水对葛洲坝水电站调度策略影响研究

葛洲坝水电站调度难点主要在于下游水位变化的不确定性,下游水位极易受到清江来水的顶托影响。为探索清江来水的顶托作用对葛洲坝水电站调度策略的影响,利用实测水文数据统计分析清江来水对宜昌水文站的顶托影响量,并据此分析水电站的损失出力。结果表明：清江来水对宜昌站的顶托作用随着清江来水的增大而增大、随着宜昌站流量的增大而减小,电站损失出力随着清江来水的增大而增大、随着出库流量的增大而先增大后减小,当出库流量为满发流量时达到最大损失出力值。研究成果可为葛洲坝电站调度策略提供参考,实际调度还需要结合三峡水库联合调度,优化水位控制,综合制定调度决策。     

阎王鼻子水库生态调度方案分析研究

本文在分析阎王鼻子水库建设前后下游水文情势变化的基础上,根据河道内生态不同需求和不同计算方法,确定水库下游河道基本生态流量和目标生态流量两种需求方案。在充分考虑大凌河流域河道外需水的前提下,研究分析了阎王鼻子水库最大程度满足河道内不同生态需水要求时的调度方案,对改善水库下游河道环境具有一定的指导意义。     

Digital Twin Enhanced Dynamic Job-Shop Scheduling

For dynamic scheduling, which is daily decision-making in a job-shop, machine availability prediction, disturbance detection and performance evaluation are always common bottlenecks. Previous research efforts on addressing the bottlenecks primarily emphasize on the analysis of data from the physical job-shop, but with little connection and convergence with its virtual models and simulated data. By introducing digital twin (DT), further convergence between physical and virtual spaces of the job-shop can be achieved, which greatly enables dynamic scheduling. DT fuses both real and simulated data to provide more information for the prediction of machine availability on one hand; and on the other hand, it helps to detect disturbances through comparing the physical machine with its continuously updated digital counterpart in real time, triggering timely rescheduling when needed. It also enables comprehensive performance evaluation for rescheduling using multiple-dimension models, which can describe geometric properties, physics parameters and behaviors of the machines. In the paper, a five-dimension DT for a machine in the job-shop is introduced first, then the DT-based machine availability prediction, disturbance detection and performance evaluation methods are explored. Based on this, a DT-enhanced dynamic scheduling methodology is proposed. A scheduling process of making hydraulic valves in a machining job-shop is taken as a case study to illustrate the effectiveness and advantages of the proposed method.     

Scheduling Optimization Modelling: A Case Study of a Woven Label Manufacturing Company

Production scheduling involves all activities of building production schedules, including coordinating and assigning activities to each person, group of people, or machine and arranging work orders in each workplace. Production scheduling must solve all problems such as minimizing customer wait time, storage costs, and production time; and effectively using the enterprise’s human resources. This paper studies the application of flexible job shop modelling on scheduling a woven labelling process. The labelling process includes several steps which are handled in different work-stations. Each workstation is also comprised of several identical parallel machines. In this study, job splitting is allowed so that the power of work stations can be utilized better. The final objective is to minimize the total completion time of all jobs. The results show a significant improvement since the new planning may save more than 60% of lead time compared to the current schedule. The contribution of this research is to propose a flexible job shop model for scheduling a woven labelling process. The proposed approach can also be applied to support complex production scheduling processes under fuzzy environments in different industries. A practical case study demonstrates the effectiveness of the proposed model.