A Hybrid Genetic Scheduling Algorithm to Heterogeneous Distributed System

In parallel and distributed computing, development of an efficient static task scheduling algorithm for directed acyclic graph (DAG) applications is an important problem. The static task scheduling problem is NP-complete in its general form. The complexity of the problem increases when task scheduling is to be done in a heterogeneous environment, consisting of processors with varying processing capabilities and network links with varying bandwidths. List scheduling algorithms are generally preferred since they generate good quality schedules with less complexity. But these list algorithms leave a lot of room for improvement, especially when these algorithms are used in specialized heterogeneous environments This paper presents an hybrid genetic task scheduling algorithm for the tasks run on the network of heterogeneous systems and represented by Directed Acyclic Graphs (DAGs). First, the algorithm assigns a coupling factor to each task to present the tasks should be scheduled onto the same processor by avoiding the large communication time. Second, the algorithm generate some high quality initial solution by scheduling the tasks which are strongly coupled with each other onto the same processor, and improve the quality of the solution by using coupling initial solutions, random solution, near optimal solutions obtained by the list scheduling algorithm in the crossover and mutation operator. The performance of the algorithm is illustrated by comparing with the existing effectively scheduling algorithms.

Novel operating theatre scheduling method based on estimation of distribution algorithm

In order to improve the efficiency of operating rooms,reduce the costs for hospitals and improve the level of service qualities, a scheduling method was developed based on an estimation of distribution algorithm（ EDA）. First, a scheduling problem domain is described. Based on assignment constraints and resource capacity constraints, the mathematical programming models are set up with an objective function to minimize the system makespan. On the basis of the descriptions mentioned above, a solution policy of generating feasible scheduling solutions is established. Combined with the specific constraints of operating theatres, the EDA-based algorithm is put forward to solve scheduling problems. Finally, simulation experiments are designed to evaluate the scheduling method. The orthogonal table is chosen to determine the parameters in the proposed method. Then the genetic algorithm and the particle swarm optimization algorithm are chosen for comparison with the EDA-based algorithm, and the results indicate that the proposed method can decrease the makespan of the surgical system regardless of the size of operations. Moreover, the computation time of the EDA-based algorithm is only approximately 5 s when solving the large scale problems, which means that the proposed algorithm is suitable for carrying out an on-line scheduling optimization of the patients.

Fine-Grained Resource Provisioning and Task Scheduling for Heterogeneous Applications in Distributed Green Clouds

An increasing number of enterprises have adopted cloud computing to manage their important business applications in distributed green cloud(DGC)systems for low response time and high cost-effectiveness in recent years.Task scheduling and resource allocation in DGCs have gained more attention in both academia and industry as they are costly to manage because of high energy consumption.Many factors in DGCs,e.g.,prices of power grid,and the amount of green energy express strong spatial variations.The dramatic increase of arriving tasks brings a big challenge to minimize the energy cost of a DGC provider in a market where above factors all possess spatial variations.This work adopts a G/G/1 queuing system to analyze the performance of servers in DGCs.Based on it,a single-objective constrained optimization problem is formulated and solved by a proposed simulated-annealing-based bees algorithm(SBA)to find SBA can minimize the energy cost of a DGC provider by optimally allocating tasks of heterogeneous applications among multiple DGCs,and specifying the running speed of each server and the number of powered-on servers in each GC while strictly meeting response time limits of tasks of all applications.Realistic databased experimental results prove that SBA achieves lower energy cost than several benchmark scheduling methods do.

A novel hybrid estimation of distribution algorithm for solving hybrid flowshop scheduling problem with unrelated parallel machine

The hybrid flow shop scheduling problem with unrelated parallel machine is a typical NP-hard combinatorial optimization problem, and it exists widely in chemical, manufacturing and pharmaceutical industry. In this work, a novel mathematic model for the hybrid flow shop scheduling problem with unrelated parallel machine(HFSPUPM) was proposed. Additionally, an effective hybrid estimation of distribution algorithm was proposed to solve the HFSPUPM, taking advantage of the features in the mathematic model. In the optimization algorithm, a new individual representation method was adopted. The(EDA) structure was used for global search while the teaching learning based optimization(TLBO) strategy was used for local search. Based on the structure of the HFSPUPM, this work presents a series of discrete operations. Simulation results show the effectiveness of the proposed hybrid algorithm compared with other algorithms.

An effective estimation of distribution algorithm for parallel litho machine scheduling with reticle constraints

In order to improve the scheduling efficiency of photolithography,bottleneck process of wafer fabrications in the semiconductor industry,an effective estimation of distribution algorithm is proposed for scheduling problems of parallel litho machines with reticle constraints,where multiple reticles are available for each reticle type.First,the scheduling problem domain of parallel litho machines is described with reticle constraints and mathematical programming formulations are put forward with the objective of minimizing total weighted completion time.Second,estimation of distribution algorithm is developed with a decoding scheme specially designed to deal with the reticle constraints.Third,an insert-based local search with the first move strategy is introduced to enhance the local exploitation ability of the algorithm.Finally,simulation experiments and analysis demonstrate the effectiveness of the proposed algorithm.

Improved Estimation of Distribution Algorithm for Solving Unrelated Parallel Machine Scheduling Problem

Scheduling problem is a well-known combinatorial optimization problem.An effective improved estimation of distribution algorithm(IEDA) was proposed for minimizing the makespan of the unrelated parallel machine scheduling problem(UPMSP).Mathematical description was given for the UPMSP.The IEDA which was combined with variable neighborhood search(IEDA_VNS) was proposed to solve the UPMSP in order to improve local search ability.A new encoding method was designed for representing the feasible solutions of the UPMSP.More knowledge of the UPMSP were taken consideration in IEDA_ VNS for probability matrix which was based the processing time matrix.The simulation results show that the proposed IEDA_VNS can solve the problem effectively.

计及多目标约束的成品卷烟销售订单配送调度优化

针对制造业供应链中的跨地域多运输中心大数据订单物流调度问题,对涉及多约束条件和多目标的异构运输车辆调度问题展开研究。根据烟草制造工业的实际运输任务需求,考虑制造订单安排、车辆准运证限制、运输车辆物理限制、运输时间窗、排产出库时间等实际约束,搭建了以包括车辆等待卷烟出库的最短运输时间,最低运输费用及最高车辆利用率为优化目标的成品烟物流车辆跨地域调度优化模型。设计了基于差分进化的混合多元宇宙算法(DE-MVO)用以解决该模型。最后基于某烟草工业企业的实际生产订单数据进行实验,将所设计的算法分别与粒子群(PSO)算法、差分进化(DE)算法、鲸鱼优化(WOA)算法、遗传优化(GA)算法、乌鸦搜索(CSA)算法、天鹰座优化器(AO)、多元宇宙(MVO)等前沿算法进行横向对比,对比结果表明所设计的算法在全局搜索能力、寻优精度等方面更优于其他算法,进一步表明所建立的模型在求解制造业供应链运输车辆调度问题中具有可行性。

分布式装配置换流水车间调度问题研究综述

近几十年来,现代制造业发展迅速,一种趋势是在分布式生产工厂进行工件的加工,待完成后到装配工厂集中装配成最终产品。该模式在带来诸多好处的同时,对资源调度提出了新的挑战。针对分布式装配置换流水车间调度问题(distributed assembly permutation flowshop scheduling problem,DAPFSP),介绍了DAPFSP的背景和存在的主要困难,进而对以最小化最大完工时间为优化目标的DAPFSP,从数学模型、编解码策略、全局和局部搜索算法角度进行探讨,分别综述了以最小化总流程时间等为优化目标,具有零等待等约束,以及考虑准备时间等因素的DAPFSP研究成果。最后,对有待进一步开展的研究工作进行展望。

面向柔性生产资源的分布式农机生产调度优化

在经济全球化背景下,分布式制造和调度系统已成为大型农机生产企业的主流生产模式。针对农机生产过程中多品种小批量的生产特点,构建出一种分布式两阶段异构混合流水车间调度问题模型,提出了一种知识引导的分布估计算法,求解分布式异构混合流水车间调度问题模型的子问题:工厂分配、工件加工顺序和加工机器分配。改进的分布估计算法融合了多种启发式构造和随机方法进行种群初始化,并对候选解进行迭代优化,通过对求解问题的特性进行分析,提高关键加工阶段加工资源的利用率,对于不同规模的调度问题提出了相应的知识引导的强化机制和多种局部搜索策略。通过仿真实验,将提出的算法与其他三类算法进行对比,验证了改进的分布估计算法的有效性和稳定性。实验结果表明,利用调度问题特性引导算法的演化过程,可有效地提升知识引导的分布估计算法对于分布式异构混合流水车间调度问题的求解效率。

分布式无线传感网中低延迟数据调度算法研究

分布式无线传感网中节点数据量增大,会导致节点能耗不均匀,数据传输过程出现低延迟现象,影响数据传输效率。为解决这一问题,提出分布式无线传感网中低延迟数据调度算法研究。基于分布式无线传感网络结构分析了低延迟数据调度延迟的主要因素,依据分析结果采用MDAS-ST算法,建立低延迟初始信息数据,对低延迟数据节点构建父节点候选集,建立低延迟数据候选调度模型,以低延迟数据父节点候选集为主,从中选取一个父节点,并分别分配到分布式无线传感网络时隙内;建立低延迟数据调度序列,利用该序列实现低延迟数据的调度研究。仿真结果表明,该方法的平均发送次数约为1.2次、调度延迟为322μs、网络吞吐率为99%,能耗为500 nJ/bit。

面向航空结构件的双资源分布式柔性调度研究

考虑航空结构件生产中精工序的员工约束和分布式多工厂协作需求,建立双资源约束分布式柔性作业车间调度模型。提出一种基于关键工厂的混合灰狼优化算法来解决该问题。针对模型的工厂选择、工序排序、机器选择以及员工选择4个子问题,设计了4层编码及新型解码方式以避免机器员工的使用冲突。结合模型的工厂约束和员工约束特征,设计一种新的狼群捕猎和猎物搜索机制,保证种群多样性的同时提高算法全局探索能力。针对分布式特性,设计基于关键工厂的局部搜索策略,提高算法的局部搜索能力。通过扩展标准算例和航空结构件实例分析,验证了所提算法求解双资源约束分布式柔性调度的有效性。

分布式流水车间调度研究综述

智能制造、网络制造等新型制造模式的快速发展为分布式生产的推广带来了新的机遇与挑战。目前,国内外学者已对柔性车间调度、分布式作业车间调度问题进行了总结分析,但仍缺乏对分布式流水车间调度问题的综述。以分布式流水车间为研究对象,从分布式流水车间调度的运作模式分析、优化目标设计、特殊约束刻画、模型求解方法及工程应用等方面对现有研究成果进行了归纳总结,并对分布式流水车间调度问题未来的研究方向进行了展望。

考虑序列相关准备时间的分布式柔性作业车间调度研究

针对考虑序列相关准备时间的分布式柔性作业车间调度问题,提出以最小化最大完工时间为优化目标的混合整数线性规划模型,并提出一种改进遗传算法。采用基于负荷均衡的种群初始化方法提高初始种群质量,根据问题特性构造6个局部扰动算子,设计多重局部扰动策略提高算法的局部搜索能力。通过扩展柔性作业车间调度基准生成测试算例,使用正交实验确定算法参数。实验结果表明,所提改进策略能够有效提高算法性能,求解结果优于对比算法,验证了调度模型和所提算法的可行性和有效性。

考虑需求响应和用户满意度的主动配电网优化调度

为提高主动配电网(active distribution network,ADN)运行经济性和用户满意度,提出一种考虑需求响应和用户满意度的ADN优化调度方法。综合考虑ADN运行过程中的购电成本、发电成本、维护成本和需求响应成本,建立了以ADN总运行成本最小为目标函数的优化调度模型。利用混沌映射、莱维飞行和收敛因子非线性变化等策略对斑点鬣狗优化算法(spotted hyena optimization,SHO)进行优化,以提高斑点鬣狗算法的优化性能。采用改进斑点鬣狗优化算法(ISHO)对ADN优化调度模型进行求解,算例分析结果表明,ISHO算法的优化效果优于其他算法,2种需求响应同时参与系统调度时的ADN总运行成本最小,经济性更好。

带有动态到达工件的分布式柔性作业车间调度问题研究

分布式柔性作业车间调度是生产调度的1个重要分支,工件的动态到达作为实际生产中的1种常见扰动情况,进一步增加了作业车间调度问题的复杂性和不确定性。针对带有工件动态到达的分布式柔性作业车间调度问题(DA-DFJSP),提出1种分批调度策略,将原本的动态调度问题转化成一系列连续调度区间上的静态调度问题,构建以最大完工时间为优化目标的混合整数规划模型;在此基础上,结合问题特征采用批次、工厂、工序、机器的4层染色体编码及快速贪婪搜索插入的解码方式改进遗传算法,同时引入多种交叉、变异算子来增强染色体的多样性;最后,基于FJSP标准算例构建DA-DFJSP测试算例进行仿真对比实验,验证所提策略和改进算法的求解优势。结果表明:相较于传统的重调度策略和改进前的遗传算法,采用分批调度策略和改进的遗传算法(IGA)所求调度方案具有更短的完工周期、更均匀的工厂加工负荷及更高的设备工作效率,IGA与分批调度策略之间有高度的契合性,能够有效提升生产效率。

基于强化学习的含电动汽车虚拟电厂优化调度

大量电动汽车(EV)用户的无序充电可能造成电网负荷剧烈波动,危及电网的安全稳定。随着EV入网(V2G)技术的应用,将EV充电站及其周边的分布式新能源发电聚合为虚拟电厂(VPP)后进行优化调度,有助于改善EV用户充放电的经济性及满意度,同时提高分布式新能源的利用率,平抑电网负荷波动,但EV充电站的整体充放电负荷是大量个体EV用户随机行为的聚合,难以用数学模型精确描述。针对包含EV的VPP,提出一种基于深度强化学习的交互式调度框架,以最大化VPP内EV用户的总效益。VPP控制中心作为智能体决策EV个体的充放电动作,无需掌握个体详细模型,而是通过与区域电网环境的交互,不断学习和更新动作策略,从而克服集中式优化方法的局限性。该优化调度框架采用深度确定性策略梯度(DDPG)算法进行求解。仿真结果表明,与集中式优化方法相比,该优化算法提高了各EV用户的效益,并使EV充放电负荷与分布式新能源发电协调配合实现削峰填谷,改善了VPP的整体运行性能。

基于深度神经网络的信息管理软件自动化测试方法研究

目前信息管理软件自动化测试通常为集中式测试的方式,仍然存在与实际情况差别较大的局限性。为解决这一问题,提出以分布式自动化为基础,对ACO算法做出改进的自动化信息管理软件测试方法。经过实例验证,方法切实可行,集合划分能力更强,具有更高的精确度和时效性。

Distributed Flexible Job-Shop Scheduling Problem Based on Hybrid Chemical Reaction Optimization Algorithm

Economic globalization has transformed many manufacturing enterprises from a single-plant production mode to a multi-plant cooperative production mode.The distributed flexible job-shop scheduling problem(DFJSP)has become a research hot topic in the field of scheduling because its production is closer to reality.The research of DFJSP is of great significance to the organization and management of actual production process.To solve the heterogeneous DFJSP with minimal completion time,a hybrid chemical reaction optimization(HCRO)algorithm is proposed in this paper.Firstly,a novel encoding-decoding method for flexible manufacturing unit(FMU)is designed.Secondly,half of initial populations are generated by scheduling rule.Combined with the new solution acceptance method of simulated annealing(SA)algorithm,an improved method of critical-FMU is designed to improve the global and local search ability of the algorithm.Finally,the elitist selection strategy and the orthogonal experimental method are introduced to the algorithm to improve the convergence speed and optimize the algorithm parameters.In the experimental part,the effectiveness of the simulated annealing algorithm and the critical-FMU refinement methods is firstly verified.Secondly,in the comparison with other existing algorithms,the proposed optimal scheduling algorithm is not only effective in homogeneous FMUs examples,but also superior to existing algorithms in heterogeneous FMUs arithmetic cases.

泵站-水库原水调水系统经济运行方式优化

为提高泵站-水库原水调水系统中泵站的运行效益,最大限度降低输水系统的运行成本.通过分析该类输水系统特性以及供水方式,基于遗传算法构建泵站机组流量分配模型,优化分配泵站运行流量.在此基础上,考虑泵站时间维度上的运行方式,结合亳州加压泵站的工程状况和区域分时电价,以单位提水费用最小为优化目标,构建经济运行模型.将该方法应用于亳州供水工程,结果表明模型效果显著,并对历史运行区间内周期输水量进行离散计算,拟合得出周期内单位提水费用最低工况,进而对拟合结果进行分析.结果表明:所构建经济运行模型具有较好的适用性,可降低工程运行费用,为工程优化调度提供指导;受到泵站运行效率和分时电价的影响,泵站单位提水费用随调水量增加先降低后升高.