Job shop scheduling has become the basis and core of advanced manufacturing technology. Various differences exist between academic research and practical production. The majority of previous researches on job shop sch...Job shop scheduling has become the basis and core of advanced manufacturing technology. Various differences exist between academic research and practical production. The majority of previous researches on job shop scheduling problem (JSSP)describe the basic production environment, which have a single objective and limited constraints. However,a practical process of production is characterized by having multiple objectives,no-wait constraint,and limited storage. Thus this research focused on multiobjective,no-wait JSSP. To analyze the problem,it was further divided into two sub-problems, namely, sequencing and timetabling. Hybrid non-order strategy and modified complete local search with memory were used to solve each problem individually. A Pareto-based strategy for performing fitness assessment was presented in this study. Various experiments on benchmark problems proved the feasibility and effectiveness of the proposed algorithm.展开更多
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.展开更多
A scheduling model of closely spaced parallel runways for arrival aircraft was proposed,with multi-objections of the minimum flight delay cost,the maximum airport capacity,the minimum workload of air traffic controlle...A scheduling model of closely spaced parallel runways for arrival aircraft was proposed,with multi-objections of the minimum flight delay cost,the maximum airport capacity,the minimum workload of air traffic controller and the maximum fairness of airlines′scheduling.The time interval between two runways and changes of aircraft landing order were taken as the constraints.Genetic algorithm was used to solve the model,and the model constrained unit delay cost of the aircraft with multiple flight tasks to reduce its delay influence range.Each objective function value or the fitness of particle unsatisfied the constrain condition would be punished.Finally,one domestic airport hub was introduced to verify the algorithm and the model.The results showed that the genetic algorithm presented strong convergence and timeliness for solving constraint multi-objective aircraft landing problem on closely spaced parallel runways,and the optimization results were better than that of actual scheduling.展开更多
In this paper, by considering the fuzzy nature of the data in real-life problems, single machine scheduling problems with fuzzy processing time and multiple objectives are formulated and an efficient genetic algorithm...In this paper, by considering the fuzzy nature of the data in real-life problems, single machine scheduling problems with fuzzy processing time and multiple objectives are formulated and an efficient genetic algorithm which is suitable for solving these problems is proposed. As illustrative numerical examples, twenty jobs processing on a machine is considered. The feasibility and effectiveness of the proposed method have been demonstrated in the simulation.展开更多
<div style="text-align:justify;"> In the multi-objective of intelligent building load scheduling, aiming at the problem of how to select Pareto frontier scheme for multi-objective optimization algorith...<div style="text-align:justify;"> In the multi-objective of intelligent building load scheduling, aiming at the problem of how to select Pareto frontier scheme for multi-objective optimization algorithm, the current optimal scheme mechanism combined with multi-objective multi-verse algorithm is used to optimize the intelligent building load scheduling. The update mechanism is changed in updating the position of the universe, and the process of correction coding is omitted in the iterative process of the algorithm, which reduces the com-putational complexity. The feasibility and effectiveness of the proposed method are verified by the optimal scheduling experiments of residential loads. </div>展开更多
Task scheduling in cloud computing environments is a multi-objective optimization problem, which is NP hard. It is also a challenging problem to find an appropriate trade-off among resource utilization, energy consump...Task scheduling in cloud computing environments is a multi-objective optimization problem, which is NP hard. It is also a challenging problem to find an appropriate trade-off among resource utilization, energy consumption and Quality of Service(QoS) requirements under the changing environment and diverse tasks. Considering both processing time and transmission time, a PSO-based Adaptive Multi-objective Task Scheduling(AMTS) Strategy is proposed in this paper. First, the task scheduling problem is formulated. Then, a task scheduling policy is advanced to get the optimal resource utilization, task completion time, average cost and average energy consumption. In order to maintain the particle diversity, the adaptive acceleration coefficient is adopted. Experimental results show that the improved PSO algorithm can obtain quasi-optimal solutions for the cloud task scheduling problem.展开更多
Considering the multivariable, strong-coupled, and nonlinear features of tandem cold rolling mill, a mathematical model of multi-objective optimization was built to facilitate the design of new systems aiming at equat...Considering the multivariable, strong-coupled, and nonlinear features of tandem cold rolling mill, a mathematical model of multi-objective optimization was built to facilitate the design of new systems aiming at equating the relative load, preventing slip, and obtaining best shape. BP （back propagation） neural network based on Levenberg- Marquardt algorithm was used for predicting the rolling force. The multi-objective fuzzy theory and method were introduced during the optimization. With an example of 1 370 mm tandem cold rolling mill, the rolling schedule of the common rolling, the single-objective optimization design, and the multi-objective fuzzy optimization design were compared with each other. The results generated from the case study showed that the proposed approach could significantly decreased the values of three objective functions simultaneously and the performance of the optimal rolling schedule was satisfactory and promising. Moreover, the capability and usefulness of fuzzy application in tandem cold rolling schedule were clearly demonstrated.展开更多
According to the actual requirements,profile and rolling energy consumption are selected as objective functions of rolling schedule optimization for tandem cold rolling.Because of mechanical wear,roll diameter has som...According to the actual requirements,profile and rolling energy consumption are selected as objective functions of rolling schedule optimization for tandem cold rolling.Because of mechanical wear,roll diameter has some uncertainty during the rolling process,ignoring which will cause poor robustness of rolling schedule.In order to solve this problem,a robust multi-objective optimization model of rolling schedule for tandem cold rolling was established.A differential evolution algorithm based on the evolutionary direction was proposed.The algorithm calculated the horizontal angle of the vector,which was used to choose mutation vector.The chosen vector contained converging direction and it changed the random mutation operation in differential evolution algorithm.Efficiency of the proposed algorithm was verified by two benchmarks.Meanwhile,in order to ensure that delivery thicknesses have descending order like actual rolling schedule during evolution,a modified Latin Hypercube Sampling process was proposed.Finally,the proposed algorithm was applied to the model above.Results showed that profile was improved and rolling energy consumption was reduced compared with the actual rolling schedule.Meanwhile,robustness of solutions was ensured.展开更多
An optimizing method of observation scheduling based on time-division multiplexing is proposed in this paper,and its efficiency is verified by outdoor experiments. The initial observation scheduling is first obtained ...An optimizing method of observation scheduling based on time-division multiplexing is proposed in this paper,and its efficiency is verified by outdoor experiments. The initial observation scheduling is first obtained by using a semi-random search algorithm,and secondly the connection time pair（ CTP） between adjacent objects is optimized by using a genetic algorithm. After obtaining these two parameters,the final observation scheduling can be obtained. According to pre-designed tracks between each adjacent objects in observation order,the seamless observation of neighboring targets is derived by automatically steering the antenna beam,so the observation efficiency is improved.展开更多
The ease of accessing a virtually unlimited pool of resources makes Infrastructure as a Service (IaaS) clouds an ideal platform for running data-intensive workflow applications comprising hundreds of computational tas...The ease of accessing a virtually unlimited pool of resources makes Infrastructure as a Service (IaaS) clouds an ideal platform for running data-intensive workflow applications comprising hundreds of computational tasks. However, executing scientific workflows in IaaS cloud environments poses significant challenges due to conflicting objectives, such as minimizing execution time (makespan) and reducing resource utilization costs. This study responds to the increasing need for efficient and adaptable optimization solutions in dynamic and complex environments, which are critical for meeting the evolving demands of modern users and applications. This study presents an innovative multi-objective approach for scheduling scientific workflows in IaaS cloud environments. The proposed algorithm, MOS-MWMC, aims to minimize total execution time (makespan) and resource utilization costs by leveraging key features of virtual machine instances, such as a high number of cores and fast local SSD storage. By integrating realistic simulations based on the WRENCH framework, the method effectively dimensions the cloud infrastructure and optimizes resource usage. Experimental results highlight the superiority of MOS-MWMC compared to benchmark algorithms HEFT and Max-Min. The Pareto fronts obtained for the CyberShake, Epigenomics, and Montage workflows demonstrate closer proximity to the optimal front, confirming the algorithm’s ability to balance conflicting objectives. This study contributes to optimizing scientific workflows in complex environments by providing solutions tailored to specific user needs while minimizing costs and execution times.展开更多
This paper introduces a multi-granularity locking model (MGL) for concurrency control in object-oriented database system briefiy, and presents a MGL model formally. Four lockingscheduling algorithms for MGL are propos...This paper introduces a multi-granularity locking model (MGL) for concurrency control in object-oriented database system briefiy, and presents a MGL model formally. Four lockingscheduling algorithms for MGL are proposed in the paper. The ideas of single queue scheduling(SQS) and dual queue scheduling (DQS) are proposed and the algorithm and the performance evaluation for these two scheduling are presented in some paper. This paper describes a new idea of thescheduling for MGL, compatible requests first (CRF). Combining the new idea with SQS and DQS,we propose two new scheduling algorithms called CRFS and CRFD. After describing the simulationmodel, this paper illustrates the comparisons of the performance among these four algorithms. Asshown in the experiments, DQS has better performance than SQS, CRFD is better than DQS, CRFSperforms better than SQS, and CRFS is the best one of these four scheduling algorithms.展开更多
Considering the independent optimization requirement for each demander of modernmanufacture, we explore the application of noncooperative game in production scheduling research,and model scheduling problem as competit...Considering the independent optimization requirement for each demander of modernmanufacture, we explore the application of noncooperative game in production scheduling research,and model scheduling problem as competition of machine resources among a group of selfish jobs.Each job has its own performance objective. For the single machine, multi-jobs and non-preemptivescheduling problem, a noncooperative game model is established. Based on the model, many prob-lems about Nash equilibrium solution, such as the existence, quantity, properties of solution space,performance of solution and algorithm are discussed. The results are tested by numerical example.展开更多
Due to the intermittency and instability of Wind-Solar energy and easy compensation of hydropower, this study proposes a Wind-Solar-Hydro power optimal scheduling model. This model is aimed at maximizing the total sys...Due to the intermittency and instability of Wind-Solar energy and easy compensation of hydropower, this study proposes a Wind-Solar-Hydro power optimal scheduling model. This model is aimed at maximizing the total system power generation and the minimum ten-day joint output. To effectively optimize the multi-objective model, a new algorithm named non-dominated sorting culture differential evolution algorithm(NSCDE) is proposed. The feasibility of NSCDE was verified through several well-known benchmark problems. It was then applied to the Jinping Wind-Solar-Hydro complementary power generation system. The results demonstrate that NSCDE can provide decision makers a series of optimized scheduling schemes.展开更多
Project scheduling problem is mainly to determine the schedule of allocating resources in order to balance the total cost and the completion time. This paper chiefly uses chance theory to introduce project scheduling ...Project scheduling problem is mainly to determine the schedule of allocating resources in order to balance the total cost and the completion time. This paper chiefly uses chance theory to introduce project scheduling problem with uncertain variables. First, two types of single-objective programming models with uncertain variables as uncertain chance-constrained model and uncertain maximization chance-constrained model are established to meet different management requirements, then they are extended to multi-objective programming model with uncertain variables.展开更多
The goal of railway rolling stock maintenance and replacement approaches is to reduce overall cost while increasing reliability which is multi objective op</span><span style="font-family:Verdana;"&g...The goal of railway rolling stock maintenance and replacement approaches is to reduce overall cost while increasing reliability which is multi objective op</span><span style="font-family:Verdana;">timization problem and a proper predictive maintenance scheduling table sh</span><span style="font-family:Verdana;">ould be adequately designed. We propose Breeding Particle Swarm Optimization (BPSO) model based on the concepts of Breeding Swarm and Genetic Algor</span><span style="font-family:Verdana;">ithm (GA) operators to design this table. The practical experiment shows th</span><span style="font-family:Verdana;">at our model reduces cost while increasing reliability compared to other models previously utilized.展开更多
With the continuous expansion of power distribution grid, the number of distribution equipments has become larger and larger. In order to make sure that all the equipments can operate reliably, a large amount of maint...With the continuous expansion of power distribution grid, the number of distribution equipments has become larger and larger. In order to make sure that all the equipments can operate reliably, a large amount of maintenance tasks should be conducted. Therefore, maintenance scheduling of distribution network is an important content, which has significant influence on reliability and economy of distribution network operation. This paper proposes a new model for maintenance scheduling which considers load loss, grid active power loss and system risk as objective functions. On this basis, Differential Evolution algorithm is adopted to optimize equipment maintenance time and load transfer path. Finally, the general distribution network of 33 nodes is taken for example which shows the maintenance scheduling model’s effectiveness and validity.展开更多
A FMS (flexible manufacturing system)scheduling algorithm based on an evolution algorithm (EA) is developed by intensively analyzing and researching the scheduling method in this paper.Many factors related to FMS sche...A FMS (flexible manufacturing system)scheduling algorithm based on an evolution algorithm (EA) is developed by intensively analyzing and researching the scheduling method in this paper.Many factors related to FMS scheduling are considered sufficiently.New explanations for a common kind of the encoding model are given.The rationality of encoding model is ensured by designing a set of new encoding methods,while the simulation experiment is performed.The results show that a FMS scheduling optimum problem with multi-constraint conditions can be effectively solved by a FMS scheduling simulation model based on EA.Compating this method with others,this algorithm has the advantage of good stability and quick convergence.展开更多
In this paper, we propose a multi-criteria machine-schedules decision making method that can be applied to a produc-tion environment involving several unrelated parallel machines and we will focus on three objectives:...In this paper, we propose a multi-criteria machine-schedules decision making method that can be applied to a produc-tion environment involving several unrelated parallel machines and we will focus on three objectives: minimizing makespan, total flow time, and total number of tardy jobs. The decision making method consists of three phases. In the first phase, a mathematical model of a single machine scheduling problem, of which the objective is a weighted sum of the three objectives, is constructed. Such a model will be repeatedly solved by the CPLEX in the proposed Multi-Objective Simulated Annealing (MOSA) algorithm. In the second phase, the MOSA that integrates job clustering method, job group scheduling method, and job group – machine assignment method, is employed to obtain a set of non-dominated group schedules. During this phase, CPLEX software and the bipartite weighted matching algorithm are used repeatedly as parts of the MOSA algorithm. In the last phase, the technique of data envelopment analysis is applied to determine the most preferable schedule. A practical example is then presented in order to demonstrate the applicability of the proposed decision making method.展开更多
基金National Natural Science Foundations of China(Nos.61174040,61573144,11304200)Shanghai Commission of Science and Technology,China(No.12JC1403400)+1 种基金Shanghai Municipal Education Commission for Training Young Teachers,China(No.ZZSDJ15031)Shanghai Teaching and Reforming Experimental Undergraduate Majors Construction Program,China
文摘Job shop scheduling has become the basis and core of advanced manufacturing technology. Various differences exist between academic research and practical production. The majority of previous researches on job shop scheduling problem (JSSP)describe the basic production environment, which have a single objective and limited constraints. However,a practical process of production is characterized by having multiple objectives,no-wait constraint,and limited storage. Thus this research focused on multiobjective,no-wait JSSP. To analyze the problem,it was further divided into two sub-problems, namely, sequencing and timetabling. Hybrid non-order strategy and modified complete local search with memory were used to solve each problem individually. A Pareto-based strategy for performing fitness assessment was presented in this study. Various experiments on benchmark problems proved the feasibility and effectiveness of the proposed algorithm.
基金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.
文摘A scheduling model of closely spaced parallel runways for arrival aircraft was proposed,with multi-objections of the minimum flight delay cost,the maximum airport capacity,the minimum workload of air traffic controller and the maximum fairness of airlines′scheduling.The time interval between two runways and changes of aircraft landing order were taken as the constraints.Genetic algorithm was used to solve the model,and the model constrained unit delay cost of the aircraft with multiple flight tasks to reduce its delay influence range.Each objective function value or the fitness of particle unsatisfied the constrain condition would be punished.Finally,one domestic airport hub was introduced to verify the algorithm and the model.The results showed that the genetic algorithm presented strong convergence and timeliness for solving constraint multi-objective aircraft landing problem on closely spaced parallel runways,and the optimization results were better than that of actual scheduling.
基金supported by the National Natural Science Foundation of China(NNSFC)(the grant No.60274043)supported by the National High-tech Research&Development Project(863)(the grant No.2002AA412610)
文摘In this paper, by considering the fuzzy nature of the data in real-life problems, single machine scheduling problems with fuzzy processing time and multiple objectives are formulated and an efficient genetic algorithm which is suitable for solving these problems is proposed. As illustrative numerical examples, twenty jobs processing on a machine is considered. The feasibility and effectiveness of the proposed method have been demonstrated in the simulation.
文摘<div style="text-align:justify;"> In the multi-objective of intelligent building load scheduling, aiming at the problem of how to select Pareto frontier scheme for multi-objective optimization algorithm, the current optimal scheme mechanism combined with multi-objective multi-verse algorithm is used to optimize the intelligent building load scheduling. The update mechanism is changed in updating the position of the universe, and the process of correction coding is omitted in the iterative process of the algorithm, which reduces the com-putational complexity. The feasibility and effectiveness of the proposed method are verified by the optimal scheduling experiments of residential loads. </div>
基金partially been sponsored by the National Science Foundation of China(No.61572355,61272093,610172063)Tianjin Research Program of Application Foundation and Advanced Technology under grant No.15JCYBJC15700
文摘Task scheduling in cloud computing environments is a multi-objective optimization problem, which is NP hard. It is also a challenging problem to find an appropriate trade-off among resource utilization, energy consumption and Quality of Service(QoS) requirements under the changing environment and diverse tasks. Considering both processing time and transmission time, a PSO-based Adaptive Multi-objective Task Scheduling(AMTS) Strategy is proposed in this paper. First, the task scheduling problem is formulated. Then, a task scheduling policy is advanced to get the optimal resource utilization, task completion time, average cost and average energy consumption. In order to maintain the particle diversity, the adaptive acceleration coefficient is adopted. Experimental results show that the improved PSO algorithm can obtain quasi-optimal solutions for the cloud task scheduling problem.
基金Item Sponsored by National Key Technology Research and Development Programin 11th Five-Year Plan of China(2007BAF02B12)
文摘Considering the multivariable, strong-coupled, and nonlinear features of tandem cold rolling mill, a mathematical model of multi-objective optimization was built to facilitate the design of new systems aiming at equating the relative load, preventing slip, and obtaining best shape. BP （back propagation） neural network based on Levenberg- Marquardt algorithm was used for predicting the rolling force. The multi-objective fuzzy theory and method were introduced during the optimization. With an example of 1 370 mm tandem cold rolling mill, the rolling schedule of the common rolling, the single-objective optimization design, and the multi-objective fuzzy optimization design were compared with each other. The results generated from the case study showed that the proposed approach could significantly decreased the values of three objective functions simultaneously and the performance of the optimal rolling schedule was satisfactory and promising. Moreover, the capability and usefulness of fuzzy application in tandem cold rolling schedule were clearly demonstrated.
基金funded by the Science and Technology Research Project of Education Department of Liaoning(L2015387)Natural Science Foundation of Liaoning(201602542)the National Natural Science Foundation of China(51407119)
文摘According to the actual requirements,profile and rolling energy consumption are selected as objective functions of rolling schedule optimization for tandem cold rolling.Because of mechanical wear,roll diameter has some uncertainty during the rolling process,ignoring which will cause poor robustness of rolling schedule.In order to solve this problem,a robust multi-objective optimization model of rolling schedule for tandem cold rolling was established.A differential evolution algorithm based on the evolutionary direction was proposed.The algorithm calculated the horizontal angle of the vector,which was used to choose mutation vector.The chosen vector contained converging direction and it changed the random mutation operation in differential evolution algorithm.Efficiency of the proposed algorithm was verified by two benchmarks.Meanwhile,in order to ensure that delivery thicknesses have descending order like actual rolling schedule during evolution,a modified Latin Hypercube Sampling process was proposed.Finally,the proposed algorithm was applied to the model above.Results showed that profile was improved and rolling energy consumption was reduced compared with the actual rolling schedule.Meanwhile,robustness of solutions was ensured.
基金Supported by the National Natural Science Foundation of China(61271373,61571043)111 Project of China(B14010)
文摘An optimizing method of observation scheduling based on time-division multiplexing is proposed in this paper,and its efficiency is verified by outdoor experiments. The initial observation scheduling is first obtained by using a semi-random search algorithm,and secondly the connection time pair（ CTP） between adjacent objects is optimized by using a genetic algorithm. After obtaining these two parameters,the final observation scheduling can be obtained. According to pre-designed tracks between each adjacent objects in observation order,the seamless observation of neighboring targets is derived by automatically steering the antenna beam,so the observation efficiency is improved.
文摘The ease of accessing a virtually unlimited pool of resources makes Infrastructure as a Service (IaaS) clouds an ideal platform for running data-intensive workflow applications comprising hundreds of computational tasks. However, executing scientific workflows in IaaS cloud environments poses significant challenges due to conflicting objectives, such as minimizing execution time (makespan) and reducing resource utilization costs. This study responds to the increasing need for efficient and adaptable optimization solutions in dynamic and complex environments, which are critical for meeting the evolving demands of modern users and applications. This study presents an innovative multi-objective approach for scheduling scientific workflows in IaaS cloud environments. The proposed algorithm, MOS-MWMC, aims to minimize total execution time (makespan) and resource utilization costs by leveraging key features of virtual machine instances, such as a high number of cores and fast local SSD storage. By integrating realistic simulations based on the WRENCH framework, the method effectively dimensions the cloud infrastructure and optimizes resource usage. Experimental results highlight the superiority of MOS-MWMC compared to benchmark algorithms HEFT and Max-Min. The Pareto fronts obtained for the CyberShake, Epigenomics, and Montage workflows demonstrate closer proximity to the optimal front, confirming the algorithm’s ability to balance conflicting objectives. This study contributes to optimizing scientific workflows in complex environments by providing solutions tailored to specific user needs while minimizing costs and execution times.
文摘This paper introduces a multi-granularity locking model (MGL) for concurrency control in object-oriented database system briefiy, and presents a MGL model formally. Four lockingscheduling algorithms for MGL are proposed in the paper. The ideas of single queue scheduling(SQS) and dual queue scheduling (DQS) are proposed and the algorithm and the performance evaluation for these two scheduling are presented in some paper. This paper describes a new idea of thescheduling for MGL, compatible requests first (CRF). Combining the new idea with SQS and DQS,we propose two new scheduling algorithms called CRFS and CRFD. After describing the simulationmodel, this paper illustrates the comparisons of the performance among these four algorithms. Asshown in the experiments, DQS has better performance than SQS, CRFD is better than DQS, CRFSperforms better than SQS, and CRFS is the best one of these four scheduling algorithms.
文摘Considering the independent optimization requirement for each demander of modernmanufacture, we explore the application of noncooperative game in production scheduling research,and model scheduling problem as competition of machine resources among a group of selfish jobs.Each job has its own performance objective. For the single machine, multi-jobs and non-preemptivescheduling problem, a noncooperative game model is established. Based on the model, many prob-lems about Nash equilibrium solution, such as the existence, quantity, properties of solution space,performance of solution and algorithm are discussed. The results are tested by numerical example.
基金supported by the National Key R&D Program of China (2016YFC0402209)the Major Research Plan of the National Natural Science Foundation of China (No. 91647114)
文摘Due to the intermittency and instability of Wind-Solar energy and easy compensation of hydropower, this study proposes a Wind-Solar-Hydro power optimal scheduling model. This model is aimed at maximizing the total system power generation and the minimum ten-day joint output. To effectively optimize the multi-objective model, a new algorithm named non-dominated sorting culture differential evolution algorithm(NSCDE) is proposed. The feasibility of NSCDE was verified through several well-known benchmark problems. It was then applied to the Jinping Wind-Solar-Hydro complementary power generation system. The results demonstrate that NSCDE can provide decision makers a series of optimized scheduling schemes.
文摘Project scheduling problem is mainly to determine the schedule of allocating resources in order to balance the total cost and the completion time. This paper chiefly uses chance theory to introduce project scheduling problem with uncertain variables. First, two types of single-objective programming models with uncertain variables as uncertain chance-constrained model and uncertain maximization chance-constrained model are established to meet different management requirements, then they are extended to multi-objective programming model with uncertain variables.
文摘The goal of railway rolling stock maintenance and replacement approaches is to reduce overall cost while increasing reliability which is multi objective op</span><span style="font-family:Verdana;">timization problem and a proper predictive maintenance scheduling table sh</span><span style="font-family:Verdana;">ould be adequately designed. We propose Breeding Particle Swarm Optimization (BPSO) model based on the concepts of Breeding Swarm and Genetic Algor</span><span style="font-family:Verdana;">ithm (GA) operators to design this table. The practical experiment shows th</span><span style="font-family:Verdana;">at our model reduces cost while increasing reliability compared to other models previously utilized.
文摘With the continuous expansion of power distribution grid, the number of distribution equipments has become larger and larger. In order to make sure that all the equipments can operate reliably, a large amount of maintenance tasks should be conducted. Therefore, maintenance scheduling of distribution network is an important content, which has significant influence on reliability and economy of distribution network operation. This paper proposes a new model for maintenance scheduling which considers load loss, grid active power loss and system risk as objective functions. On this basis, Differential Evolution algorithm is adopted to optimize equipment maintenance time and load transfer path. Finally, the general distribution network of 33 nodes is taken for example which shows the maintenance scheduling model’s effectiveness and validity.
文摘A FMS (flexible manufacturing system)scheduling algorithm based on an evolution algorithm (EA) is developed by intensively analyzing and researching the scheduling method in this paper.Many factors related to FMS scheduling are considered sufficiently.New explanations for a common kind of the encoding model are given.The rationality of encoding model is ensured by designing a set of new encoding methods,while the simulation experiment is performed.The results show that a FMS scheduling optimum problem with multi-constraint conditions can be effectively solved by a FMS scheduling simulation model based on EA.Compating this method with others,this algorithm has the advantage of good stability and quick convergence.
文摘In this paper, we propose a multi-criteria machine-schedules decision making method that can be applied to a produc-tion environment involving several unrelated parallel machines and we will focus on three objectives: minimizing makespan, total flow time, and total number of tardy jobs. The decision making method consists of three phases. In the first phase, a mathematical model of a single machine scheduling problem, of which the objective is a weighted sum of the three objectives, is constructed. Such a model will be repeatedly solved by the CPLEX in the proposed Multi-Objective Simulated Annealing (MOSA) algorithm. In the second phase, the MOSA that integrates job clustering method, job group scheduling method, and job group – machine assignment method, is employed to obtain a set of non-dominated group schedules. During this phase, CPLEX software and the bipartite weighted matching algorithm are used repeatedly as parts of the MOSA algorithm. In the last phase, the technique of data envelopment analysis is applied to determine the most preferable schedule. A practical example is then presented in order to demonstrate the applicability of the proposed decision making method.
