In order to improve the performance of multi-objective workflow scheduling in cloud system, a multi-swarm multiobjective optimization algorithm(MSMOOA) is proposed to satisfy multiple conflicting objectives. Inspired ...In order to improve the performance of multi-objective workflow scheduling in cloud system, a multi-swarm multiobjective optimization algorithm(MSMOOA) is proposed to satisfy multiple conflicting objectives. Inspired by division of the same species into multiple swarms for different objectives and information sharing among these swarms in nature, each physical machine in the data center is considered a swarm and employs improved multi-objective particle swarm optimization to find out non-dominated solutions with one objective in MSMOOA. The particles in each swarm are divided into two classes and adopt different strategies to evolve cooperatively. One class of particles can communicate with several swarms simultaneously to promote the information sharing among swarms and the other class of particles can only exchange information with the particles located in the same swarm. Furthermore, in order to avoid the influence by the elastic available resources, a manager server is adopted in the cloud data center to collect the available resources for scheduling. The quality of the proposed method with other related approaches is evaluated by using hybrid and parallel workflow applications. The experiment results highlight the better performance of the MSMOOA than that of compared algorithms.展开更多
In order to solve the flexible job shop scheduling problem with variable batches,we propose an improved multiobjective optimization algorithm,which combines the idea of inverse scheduling.First,a flexible job shop pro...In order to solve the flexible job shop scheduling problem with variable batches,we propose an improved multiobjective optimization algorithm,which combines the idea of inverse scheduling.First,a flexible job shop problem with the variable batches scheduling model is formulated.Second,we propose a batch optimization algorithm with inverse scheduling in which the batch size is adjusted by the dynamic feedback batch adjusting method.Moreover,in order to increase the diversity of the population,two methods are developed.One is the threshold to control the neighborhood updating,and the other is the dynamic clustering algorithm to update the population.Finally,a group of experiments are carried out.The results show that the improved multi-objective optimization algorithm can ensure the diversity of Pareto solutions effectively,and has effective performance in solving the flexible job shop scheduling problem with variable batches.展开更多
A multi-objective optimization model for draft scheduling of hot strip mill was presented, rolling power minimizing, rolling force ratio distribution and good strip shape as the objective functions. A multi-objective ...A multi-objective optimization model for draft scheduling of hot strip mill was presented, rolling power minimizing, rolling force ratio distribution and good strip shape as the objective functions. A multi-objective differential evolution algorithm based on decomposition （MODE/D）. The two-objective and three-objective optimization experiments were performed respectively to demonstrate the optimal solutions of trade-off. The simulation results show that MODE/D can obtain a good Pareto-optimal front, which suggests a series of alternative solutions to draft scheduling. The extreme Pareto solutions are found feasible and the centres of the Pareto fronts give a good compromise. The conflict exists between each two ones of three objectives. The final optimal solution is selected from the Pareto-optimal front by the importance of objectives, and it can achieve a better performance in all objective dimensions than the empirical solutions. Finally, the practical application cases confirm the feasibility of the multi-objective approach, and the optimal solutions can gain a better rolling stability than the empirical solutions, and strip flatness decreases from （0± 63） IU to （0±45） IU in industrial production.展开更多
To determine the onset and duration of contraflow evacuation, a multi-objective optimization(MOO) model is proposed to explicitly consider both the total system evacuation time and the operation cost. A solution algor...To determine the onset and duration of contraflow evacuation, a multi-objective optimization(MOO) model is proposed to explicitly consider both the total system evacuation time and the operation cost. A solution algorithm that enhances the popular evolutionary algorithm NSGA-II is proposed to solve the model. The algorithm incorporates preliminary results as prior information and includes a meta-model as an alternative to evaluation by simulation. Numerical analysis of a case study suggests that the proposed formulation and solution algorithm are valid, and the enhanced NSGA-II outperforms the original algorithm in both convergence to the true Pareto-optimal set and solution diversity.展开更多
In terms of tandem cold mill productivity and product quality, a multi-objective optimization model of rolling schedule based on cost fimction was proposed to determine the stand reductions, inter-stand tensions and r...In terms of tandem cold mill productivity and product quality, a multi-objective optimization model of rolling schedule based on cost fimction was proposed to determine the stand reductions, inter-stand tensions and rolling speeds for a specified product. The proposed schedule optimization model consists of several single cost fi.mctions, which take rolling force, motor power, inter-stand tension and stand reduction into consideration. The cost function, which can evaluate how far the rolling parameters are from the ideal values, was minimized using the Nelder-Mead simplex method. The proposed rolling schedule optimization method has been applied successfully to the 5-stand tandem cold mill in Tangsteel, and the results from a case study show that the proposed method is superior to those based on empirical formulae.展开更多
To cope with the task scheduling problem under multi-task and transportation consideration in large-scale service oriented manufacturing systems(SOMS), a service allocation optimization mathematical model was establis...To cope with the task scheduling problem under multi-task and transportation consideration in large-scale service oriented manufacturing systems(SOMS), a service allocation optimization mathematical model was established, and then a hybrid discrete particle swarm optimization-genetic algorithm(HDPSOGA) was proposed. In SOMS, each resource involved in the whole life cycle of a product, whether it is provided by a piece of software or a hardware device, is encapsulated into a service. So, the transportation during production of a task should be taken into account because the hard-services selected are possibly provided by various providers in different areas. In the service allocation optimization mathematical model, multi-task and transportation were considered simultaneously. In the proposed HDPSOGA algorithm, integer coding method was applied to establish the mapping between the particle location matrix and the service allocation scheme. The position updating process was performed according to the cognition part, the social part, and the previous velocity and position while introducing the crossover and mutation idea of genetic algorithm to fit the discrete space. Finally, related simulation experiments were carried out to compare with other two previous algorithms. The results indicate the effectiveness and efficiency of the proposed hybrid algorithm.展开更多
In a typical discrete manufacturing process,a new type of reconfigurable production line is introduced,which aims to help small-and mid-size enterprises to improve machine utilization and reduce production cost.In ord...In a typical discrete manufacturing process,a new type of reconfigurable production line is introduced,which aims to help small-and mid-size enterprises to improve machine utilization and reduce production cost.In order to effectively handle the production scheduling problem for the manufacturing system,an improved multi-objective particle swarm optimization algorithm based on Brownian motion(MOPSO-BM)is proposed.Since the existing MOPSO algorithms are easily stuck in the local optimum,the global search ability of the proposed method is enhanced based on the random motion mechanism of the BM.To further strengthen the global search capacity,a strategy of fitting the inertia weight with the piecewise Gaussian cumulative distribution function(GCDF)is included,which helps to maintain an excellent convergence rate of the algorithm.Based on the commonly used indicators generational distance(GD)and hypervolume(HV),we compare the MOPSO-BM with several other latest algorithms on the benchmark functions,and it shows a better overall performance.Furthermore,for a real reconfigurable production line of smart home appliances,three algorithms,namely non-dominated sorting genetic algorithm-II(NSGA-II),decomposition-based MOPSO(dMOPSO)and MOPSO-BM,are applied to tackle the scheduling problem.It is demonstrated that MOPSO-BM outperforms the others in terms of convergence rate and quality of solutions.展开更多
Most earth observation satellites(EOSs)are low-orbit satellites equipped with optical sensors that cannot see through clouds.Hence,cloud coverage,high dynamics,and cloud uncertainties are important issues in the sched...Most earth observation satellites(EOSs)are low-orbit satellites equipped with optical sensors that cannot see through clouds.Hence,cloud coverage,high dynamics,and cloud uncertainties are important issues in the scheduling of EOSs.The proactive-reactive scheduling framework has been proven to be effective and efficient for the uncertain scheduling problem and has been extensively employed.Numerous studies have been conducted on methods for the proactive scheduling of EOSs,including expectation,chance-constrained,and robust optimization models and the relevant solution algorithms.This study focuses on the reactive scheduling of EOSs under cloud uncertainties.First,using an example,we describe the reactive scheduling problem in detail,clarifying its significance and key issues.Considering the two key objectives of observation profits and scheduling stability,we construct a multi-objective optimization mathematical model.Then,we obtain the possible disruptions of EOS scheduling during execution under cloud uncertainties,adopting an event-driven policy for the reactive scheduling.For the different disruptions,different reactive scheduling algorithms are designed.Finally,numerous simulation experiments are conducted to verify the feasibility and effectiveness of the proposed reactive scheduling algorithms.The experimental results show that the reactive scheduling algorithms can both improve observation profits and reduce system perturbations.展开更多
The industrial Internet of Things(IIoT)is a new indus-trial idea that combines the latest information and communica-tion technologies with the industrial economy.In this paper,a cloud control structure is designed for...The industrial Internet of Things(IIoT)is a new indus-trial idea that combines the latest information and communica-tion technologies with the industrial economy.In this paper,a cloud control structure is designed for IIoT in cloud-edge envi-ronment with three modes of 5G.For 5G based IIoT,the time sensitive network(TSN)service is introduced in transmission network.A 5G logical TSN bridge is designed to transport TSN streams over 5G framework to achieve end-to-end configuration.For a transmission control protocol(TCP)model with nonlinear disturbance,time delay and uncertainties,a robust adaptive fuzzy sliding mode controller(AFSMC)is given with control rule parameters.IIoT workflows are made up of a series of subtasks that are linked by the dependencies between sensor datasets and task flows.IIoT workflow scheduling is a non-deterministic polynomial(NP)-hard problem in cloud-edge environment.An adaptive and non-local-convergent particle swarm optimization(ANCPSO)is designed with nonlinear inertia weight to avoid falling into local optimum,which can reduce the makespan and cost dramatically.Simulation and experiments demonstrate that ANCPSO has better performances than other classical algo-rithms.展开更多
基金Project(61473078)supported by the National Natural Science Foundation of ChinaProject(2015-2019)supported by the Program for Changjiang Scholars from the Ministry of Education,China+1 种基金Project(16510711100)supported by International Collaborative Project of the Shanghai Committee of Science and Technology,ChinaProject(KJ2017A418)supported by Anhui University Science Research,China
文摘In order to improve the performance of multi-objective workflow scheduling in cloud system, a multi-swarm multiobjective optimization algorithm(MSMOOA) is proposed to satisfy multiple conflicting objectives. Inspired by division of the same species into multiple swarms for different objectives and information sharing among these swarms in nature, each physical machine in the data center is considered a swarm and employs improved multi-objective particle swarm optimization to find out non-dominated solutions with one objective in MSMOOA. The particles in each swarm are divided into two classes and adopt different strategies to evolve cooperatively. One class of particles can communicate with several swarms simultaneously to promote the information sharing among swarms and the other class of particles can only exchange information with the particles located in the same swarm. Furthermore, in order to avoid the influence by the elastic available resources, a manager server is adopted in the cloud data center to collect the available resources for scheduling. The quality of the proposed method with other related approaches is evaluated by using hybrid and parallel workflow applications. The experiment results highlight the better performance of the MSMOOA than that of compared algorithms.
基金supported by the National Key R&D Plan(2020YFB1712902)the National Natural Science Foundation of China(52075036).
文摘In order to solve the flexible job shop scheduling problem with variable batches,we propose an improved multiobjective optimization algorithm,which combines the idea of inverse scheduling.First,a flexible job shop problem with the variable batches scheduling model is formulated.Second,we propose a batch optimization algorithm with inverse scheduling in which the batch size is adjusted by the dynamic feedback batch adjusting method.Moreover,in order to increase the diversity of the population,two methods are developed.One is the threshold to control the neighborhood updating,and the other is the dynamic clustering algorithm to update the population.Finally,a group of experiments are carried out.The results show that the improved multi-objective optimization algorithm can ensure the diversity of Pareto solutions effectively,and has effective performance in solving the flexible job shop scheduling problem with variable batches.
基金Projects(50974039,50634030)supported by the National Natural Science Foundation of China
文摘A multi-objective optimization model for draft scheduling of hot strip mill was presented, rolling power minimizing, rolling force ratio distribution and good strip shape as the objective functions. A multi-objective differential evolution algorithm based on decomposition （MODE/D）. The two-objective and three-objective optimization experiments were performed respectively to demonstrate the optimal solutions of trade-off. The simulation results show that MODE/D can obtain a good Pareto-optimal front, which suggests a series of alternative solutions to draft scheduling. The extreme Pareto solutions are found feasible and the centres of the Pareto fronts give a good compromise. The conflict exists between each two ones of three objectives. The final optimal solution is selected from the Pareto-optimal front by the importance of objectives, and it can achieve a better performance in all objective dimensions than the empirical solutions. Finally, the practical application cases confirm the feasibility of the multi-objective approach, and the optimal solutions can gain a better rolling stability than the empirical solutions, and strip flatness decreases from （0± 63） IU to （0±45） IU in industrial production.
基金Project(ADLT 930-809R)supported by the Alabama Department of Transportation,USA
文摘To determine the onset and duration of contraflow evacuation, a multi-objective optimization(MOO) model is proposed to explicitly consider both the total system evacuation time and the operation cost. A solution algorithm that enhances the popular evolutionary algorithm NSGA-II is proposed to solve the model. The algorithm incorporates preliminary results as prior information and includes a meta-model as an alternative to evaluation by simulation. Numerical analysis of a case study suggests that the proposed formulation and solution algorithm are valid, and the enhanced NSGA-II outperforms the original algorithm in both convergence to the true Pareto-optimal set and solution diversity.
基金Project(51074051)supported by the National Natural Science Foundation of ChinaProject(N110307001)supported by the Fundamental Research Funds for the Central Universities,China
文摘In terms of tandem cold mill productivity and product quality, a multi-objective optimization model of rolling schedule based on cost fimction was proposed to determine the stand reductions, inter-stand tensions and rolling speeds for a specified product. The proposed schedule optimization model consists of several single cost fi.mctions, which take rolling force, motor power, inter-stand tension and stand reduction into consideration. The cost function, which can evaluate how far the rolling parameters are from the ideal values, was minimized using the Nelder-Mead simplex method. The proposed rolling schedule optimization method has been applied successfully to the 5-stand tandem cold mill in Tangsteel, and the results from a case study show that the proposed method is superior to those based on empirical formulae.
基金Project(2012B091100444)supported by the Production,Education and Research Cooperative Program of Guangdong Province and Ministry of Education,ChinaProject(2013ZM0091)supported by Fundamental Research Funds for the Central Universities of China
文摘To cope with the task scheduling problem under multi-task and transportation consideration in large-scale service oriented manufacturing systems(SOMS), a service allocation optimization mathematical model was established, and then a hybrid discrete particle swarm optimization-genetic algorithm(HDPSOGA) was proposed. In SOMS, each resource involved in the whole life cycle of a product, whether it is provided by a piece of software or a hardware device, is encapsulated into a service. So, the transportation during production of a task should be taken into account because the hard-services selected are possibly provided by various providers in different areas. In the service allocation optimization mathematical model, multi-task and transportation were considered simultaneously. In the proposed HDPSOGA algorithm, integer coding method was applied to establish the mapping between the particle location matrix and the service allocation scheme. The position updating process was performed according to the cognition part, the social part, and the previous velocity and position while introducing the crossover and mutation idea of genetic algorithm to fit the discrete space. Finally, related simulation experiments were carried out to compare with other two previous algorithms. The results indicate the effectiveness and efficiency of the proposed hybrid algorithm.
基金supported by the National Natural Science Foundation of China(71871203,52005447,L1924063)Zhejiang Provincial Natural Science Foundation of China(LY18G010017,LQ21E050014).
文摘In a typical discrete manufacturing process,a new type of reconfigurable production line is introduced,which aims to help small-and mid-size enterprises to improve machine utilization and reduce production cost.In order to effectively handle the production scheduling problem for the manufacturing system,an improved multi-objective particle swarm optimization algorithm based on Brownian motion(MOPSO-BM)is proposed.Since the existing MOPSO algorithms are easily stuck in the local optimum,the global search ability of the proposed method is enhanced based on the random motion mechanism of the BM.To further strengthen the global search capacity,a strategy of fitting the inertia weight with the piecewise Gaussian cumulative distribution function(GCDF)is included,which helps to maintain an excellent convergence rate of the algorithm.Based on the commonly used indicators generational distance(GD)and hypervolume(HV),we compare the MOPSO-BM with several other latest algorithms on the benchmark functions,and it shows a better overall performance.Furthermore,for a real reconfigurable production line of smart home appliances,three algorithms,namely non-dominated sorting genetic algorithm-II(NSGA-II),decomposition-based MOPSO(dMOPSO)and MOPSO-BM,are applied to tackle the scheduling problem.It is demonstrated that MOPSO-BM outperforms the others in terms of convergence rate and quality of solutions.
基金supported by the National Natural Science Foundation of China(7180121871701067+3 种基金72071075)the Research Project of National University of Defense Technology(ZK18-03-16)the Natural Science Foundation of Hunan Province,China(2020JJ46722019JJ50039)。
文摘Most earth observation satellites(EOSs)are low-orbit satellites equipped with optical sensors that cannot see through clouds.Hence,cloud coverage,high dynamics,and cloud uncertainties are important issues in the scheduling of EOSs.The proactive-reactive scheduling framework has been proven to be effective and efficient for the uncertain scheduling problem and has been extensively employed.Numerous studies have been conducted on methods for the proactive scheduling of EOSs,including expectation,chance-constrained,and robust optimization models and the relevant solution algorithms.This study focuses on the reactive scheduling of EOSs under cloud uncertainties.First,using an example,we describe the reactive scheduling problem in detail,clarifying its significance and key issues.Considering the two key objectives of observation profits and scheduling stability,we construct a multi-objective optimization mathematical model.Then,we obtain the possible disruptions of EOS scheduling during execution under cloud uncertainties,adopting an event-driven policy for the reactive scheduling.For the different disruptions,different reactive scheduling algorithms are designed.Finally,numerous simulation experiments are conducted to verify the feasibility and effectiveness of the proposed reactive scheduling algorithms.The experimental results show that the reactive scheduling algorithms can both improve observation profits and reduce system perturbations.
文摘The industrial Internet of Things(IIoT)is a new indus-trial idea that combines the latest information and communica-tion technologies with the industrial economy.In this paper,a cloud control structure is designed for IIoT in cloud-edge envi-ronment with three modes of 5G.For 5G based IIoT,the time sensitive network(TSN)service is introduced in transmission network.A 5G logical TSN bridge is designed to transport TSN streams over 5G framework to achieve end-to-end configuration.For a transmission control protocol(TCP)model with nonlinear disturbance,time delay and uncertainties,a robust adaptive fuzzy sliding mode controller(AFSMC)is given with control rule parameters.IIoT workflows are made up of a series of subtasks that are linked by the dependencies between sensor datasets and task flows.IIoT workflow scheduling is a non-deterministic polynomial(NP)-hard problem in cloud-edge environment.An adaptive and non-local-convergent particle swarm optimization(ANCPSO)is designed with nonlinear inertia weight to avoid falling into local optimum,which can reduce the makespan and cost dramatically.Simulation and experiments demonstrate that ANCPSO has better performances than other classical algo-rithms.
