To increase efficiency in fierce competition,it is necessary and urgent to improve the standard of production planning for shipbuilding.The construction of curved blocks is the bottleneck to improve the efficiency of ...To increase efficiency in fierce competition,it is necessary and urgent to improve the standard of production planning for shipbuilding.The construction of curved blocks is the bottleneck to improve the efficiency of shipbuilding.Thus it is a key breakthrough for higher shipbuilding productivity to study the curved block production.By analyzing the scheduling problem in curved blocks production,we propose an intelligent curved block production scheduling method and its system based on a knowledge base,and show the main process of the system.The functions of the system include data management,assembly plan generation,plan adjustment,and plan evaluation.In order to deal with the actual situation and inherit the empirical knowledge,the system extracts some rules to control block selecting,algorithm selection,and evaluation thresholds to build a production decision-making knowledge base in the curved block scheduling system.The proposed knowledge base could be referred and modified by users,especially after a few interactions between the users and the knowledge base.The final assembly plan can be visualized and evaluated to facilitate the observation of plan implementation and effects of the decisions in the process.Finally,the system is verified by a large shipyard in Shanghai using real data and the results illustrate that the proposed method can perform the knowledge-based scheduling for curved blocks construction effectively.展开更多
Dear Editor,This letter presents a joint probabilistic scheduling and resource allocation method(PSRA) for 5G-based wireless networked control systems(WNCSs). As a control-aware optimization method, PSRA minimizes the...Dear Editor,This letter presents a joint probabilistic scheduling and resource allocation method(PSRA) for 5G-based wireless networked control systems(WNCSs). As a control-aware optimization method, PSRA minimizes the linear quadratic Gaussian(LQG) control cost of WNCSs by optimizing the activation probability of subsystems, the number of uplink repetitions, and the durations of uplink and downlink phases. Simulation results show that PSRA achieves smaller LQG control costs than existing works.展开更多
In this paper,a novel control structure called feedback scheduling of model-based networked control systems is proposed to cope with a flexible network load and resource constraints.The state update time is adjusted a...In this paper,a novel control structure called feedback scheduling of model-based networked control systems is proposed to cope with a flexible network load and resource constraints.The state update time is adjusted according to the real-time network congestion situation.State observer is used under the situation where the state of the controlled plant could not be acquired.The stability criterion of the proposed structure is proved with time-varying state update time.On the basis of the stability of the novel system structure,the compromise between the control performance and the network utilization is realized by using feedback scheduler. Examples are provided to show the advantage of the proposed control structure.展开更多
Job shop scheduling problem is typically a NP-Hard problem. In the recent past efforts put by researchers were to provide the most generic genetic algorithm to solve efficiently the job shop scheduling problems. Less ...Job shop scheduling problem is typically a NP-Hard problem. In the recent past efforts put by researchers were to provide the most generic genetic algorithm to solve efficiently the job shop scheduling problems. Less attention has been paid to initial population aspects in genetic algorithms and much attention to recombination operators. Therefore authors are of the opinion that by proper design of all the aspects in genetic algorithms starting from initial population may provide better and promising solutions. Hence this paper attempts to enhance the effectiveness of genetic algorithm by providing a new look to initial population. This new technique along with job based representation has been used to obtain the optimal or near optimal solutions of 66 benchmark instances which comprise of varying degree of complexity.展开更多
This study is aimed to assess the usefulness of weather forecasts for irrigation scheduling in crops to economize water use. The short-term gains for the farmers come from reducing costs of irrigation with the help of...This study is aimed to assess the usefulness of weather forecasts for irrigation scheduling in crops to economize water use. The short-term gains for the farmers come from reducing costs of irrigation with the help of advisory for when not to irrigate because rain is predicted (risk-free because the wrong forecast only delays irrigation within tolerance). Here, a quantitative assessment of saving (indirect income) if irrigation is avoided as rain is imminent (as per forecast), using a five-year archived forecast data over Karnataka state at hobli (a cluster of small villages) level is presented. Estimates showed that the economic benefits to the farmers from such advisories were significant. The potential gain in annual income from such forecast-based irrigation scheduling was of the order of 10% - 15%. Our analysis also indicated that the use of advisory by a small percentage of more than 10 million marginal farmers (landholding < 3 acres) in Karnataka could lead to huge cumulative savings of the order of many crores.展开更多
Increasing consumption, changing nature of loads and the need to reduce carbon emission are some of the factors threatening electricity grid stability and reliability. Demand side management programs mainly work by sh...Increasing consumption, changing nature of loads and the need to reduce carbon emission are some of the factors threatening electricity grid stability and reliability. Demand side management programs mainly work by shifting consumption from peak to off-peak period, which inconveniences some consumers and possibly creates a new peak (Reverse Peak) in off-peak hours. Growing use of Photovoltaic solar power in residences provides an opportunity to manage grid reliability and stability in a more flexible manner, and mitigates reverse peaks. We propose a community based scheduling algorithm that guarantees access to shared power capacity and integrates residences’ solar power into the grid. Results indicate peak demand can be reduced by up to 32.1%, while energy costs can be reduced by up to 14.0%. Furthermore, coordinated discharging can mitigate reverse peaks by up to 23.4%. Encouraging and integrating green energy generation and storage in the consumer side is crucial to grid stability and reliability.展开更多
In flexible job-shop batch scheduling problem, the optimal lot-size of different process is not always the same because of different processing time and set-up time. Even for the same process of the same workpiece, th...In flexible job-shop batch scheduling problem, the optimal lot-size of different process is not always the same because of different processing time and set-up time. Even for the same process of the same workpiece, the choice of machine also affects the optimal lot-size. In addition, different choices of lot-size between the constrained processes will impact the manufacture efficiency. Considering that each process has its own appropriate lot-size, we put forward the concept of scheduling with lot-splitting based on process and set up the scheduling model of lot-splitting to critical path process as the core. The model could update the set of batch process and machine selection strategy dynamically to determine processing route and arrange proper lot-size for different processes, to achieve the purpose of optimizing the makespan and reducing the processing batches effectively. The experiment results show that, comparing with lot-splitting scheduling scheme based on workpiece, this model optimizes the makespan and improves the utilization efficiency of the machine. It also greatly decreases the machined batches （42%） and reduces the complexity of shop scheduling production management.展开更多
Ongoing research is described that is focused upon modelling the space base information network and simulating its behaviours： simulation of spaced based communications and networking project. Its objective is to dem...Ongoing research is described that is focused upon modelling the space base information network and simulating its behaviours： simulation of spaced based communications and networking project. Its objective is to demonstrate the feasibility of producing a tool that can provide a performance evaluation of various eonstellation access techniques and routing policies. The architecture and design of the simulation system are explored. The algorithm of data routing and instrument scheduling in this project is described. Besides these, the key methodologies of simulating the inter-satellite link features in the data transmissions are also discussed. The performance of both instrument scheduling algorithm and routing schemes is evaluated and analyzed through extensive simulations under a typical scenario.展开更多
Due to the complex,uncertainty and dynamics in the modern manufacturing environment,a flexible and robust shop floor scheduler is essential to achieve the production goals.A design framework of a shop floor dynamical ...Due to the complex,uncertainty and dynamics in the modern manufacturing environment,a flexible and robust shop floor scheduler is essential to achieve the production goals.A design framework of a shop floor dynamical scheduler is presented in this paper.The workflow and function modules of the scheduler are discussed in detail.A multi-step adaptive scheduling strategy and a process specification language,which is an ontology-based representation of process plan,are utilized in the proposed scheduler.The scheduler acquires the dispatching rule from the knowledge base and uses the build-in on-line simulator to evaluate the obtained rule.These technologies enable the scheduler to improve its fine-tune ability and effectively transfer process information into other heterogeneous information systems in a shop floor.The effectiveness of the suggested structure will be demonstrated via its application in the scheduling system of a manufacturing enterprise.展开更多
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.展开更多
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 wor...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.展开更多
Network-based manufacturing is a kind of distributed system, which enables manufacturers to finish production tasks as well as to grasp the opportunities in the market, even if manufacturing resources are insufficient...Network-based manufacturing is a kind of distributed system, which enables manufacturers to finish production tasks as well as to grasp the opportunities in the market, even if manufacturing resources are insufficient. One of the main problems in network-based manufacturing is the allocation of resources and the assignment of tasks rationally, according to flexible resource distribution. The mapping rules and relations between production techniques and resources are proposed, followed by the definition of the resource unit. Ultimately, the genetic programming method for the optimization of the manufacturing system is put forward. A set of software for the optimization system of simulation process using genetic programming techniques has been developed, and the problems of manufacturing resource planning in network-based manufacturing are solved with the simulation of optimizing methods by genetic programming. The optimum proposal of hardware planning, selection of company and scheduling will be obtained in theory to help company managers in scientific decision-making.展开更多
An improved differential evolution（IDE）algorithm that adopts a novel mutation strategy to speed up the convergence rate is introduced to solve the resource-constrained project scheduling problem（RCPSP）with the obj...An improved differential evolution（IDE）algorithm that adopts a novel mutation strategy to speed up the convergence rate is introduced to solve the resource-constrained project scheduling problem（RCPSP）with the objective of minimizing project duration Activities priorities for scheduling are represented by individual vectors and a senal scheme is utilized to transform the individual-represented priorities to a feasible schedule according to the precedence and resource constraints so as to be evaluated.To investigate the performance of the IDE-based approach for the RCPSP,it is compared against the meta-heuristic methods of hybrid genetic algorithm（HGA）,particle swarm optimization（PSO） and several well selected heuristics.The results show that the proposed scheduling method is better than general heuristic rules and is able to obtain the same optimal result as the HGA and PSO approaches but more efficient than the two algorithms.展开更多
This research provides academic and practical contributions. From a theoretical standpoint, a hybrid harmony search(HS)algorithm, namely the oppositional global-based HS(OGHS), is proposed for solving the multi-object...This research provides academic and practical contributions. From a theoretical standpoint, a hybrid harmony search(HS)algorithm, namely the oppositional global-based HS(OGHS), is proposed for solving the multi-objective flexible job-shop scheduling problems(MOFJSPs) to minimize makespan, total machine workload and critical machine workload. An initialization program embedded in opposition-based learning(OBL) is developed for enabling the individuals to scatter in a well-distributed manner in the initial harmony memory(HM). In addition, the recursive halving technique based on opposite number is employed for shrinking the neighbourhood space in the searching phase of the OGHS. From a practice-related standpoint, a type of dual vector code technique is introduced for allowing the OGHS algorithm to adapt the discrete nature of the MOFJSP. Two practical techniques, namely Pareto optimality and technique for order preference by similarity to an ideal solution(TOPSIS), are implemented for solving the MOFJSP.Furthermore, the algorithm performance is tested by using different strategies, including OBL and recursive halving, and the OGHS is compared with existing algorithms in the latest studies.Experimental results on representative examples validate the performance of the proposed algorithm for solving the MOFJSP.展开更多
The software-based computer numerical control（CNC） system includes three types of tasks： periodic real-time tasks, aperiodic real-time tasks, and non-real-time tasks. The tasks are characterized by concurrency, hyb...The software-based computer numerical control（CNC） system includes three types of tasks： periodic real-time tasks, aperiodic real-time tasks, and non-real-time tasks. The tasks are characterized by concurrency, hybridization, and correlation, which make system implementation difficult. The conventional scheduling algorithm can not meet the demands of system implementation in the software-based CNC system completely. The uncertainty factors when running real-time tasks affect control performance by degrading manufacturing accuracy as a result of system resource and processor use restrictions. To address the technical difficulty of embedded system implementation, a novel fuzzy feedback scheduling algorithm based on output jitter of key real-time tasks for a software-based CNC system is proposed. Time characteristics, such as sampling jitter, input-output jitter, and non-schedulability are discussed, followed by quantification through simulations of the impact of time characteristics on manufacturing accuracy. On the basis of this research, the scheduler architecture is designed, and then the algorithm table is calculated. When the system resource changes, the key periodic real-time tasks meet their deadlines by means of dynamically adjusting the task period. The simulated results show that the machining precision rises by an order of magnitude for the proposed scheduler in resource-constrained software-based CNC systems. Moreover, unlike conventional feedback scheduling methods, the algorithm in this paper does not rely on the availability of task execution times and is easy to implement while incurring only a small overhead.展开更多
An improved fruit fly optimization algorithm( iFOA) is proposed for solving the lot-streaming flow-shop scheduling problem( LSFSP) with equal-size sub-lots. In the proposed iFOA,a solution is encoded as two vectors to...An improved fruit fly optimization algorithm( iFOA) is proposed for solving the lot-streaming flow-shop scheduling problem( LSFSP) with equal-size sub-lots. In the proposed iFOA,a solution is encoded as two vectors to determine the splitting of jobs and the sequence of the sub-lots simultaneously. Based on the encoding scheme,three kinds of neighborhoods are developed for generating new solutions. To well balance the exploitation and exploration,two main search procedures are designed within the evolutionary search framework of the iFOA,including the neighborhood-based search( smell-vision-based search) and the global cooperation-based search. Finally,numerical testing results are provided,and the comparisons demonstrate the effectiveness of the proposed iFOA for solving the LSFSP.展开更多
Task scheduling for electro-magnetic detection satellite is a typical combinatorial optimization problem. The count of constraints that need to be taken into account is of large scale. An algorithm combined integer pr...Task scheduling for electro-magnetic detection satellite is a typical combinatorial optimization problem. The count of constraints that need to be taken into account is of large scale. An algorithm combined integer programming with constraint programming is presented. This algorithm is deployed in this problem through two steps. The first step is to decompose the original problem into master and sub-problem using the logic-based Benders decomposition; then a circus combines master and sub-problem solving process together, and the connection between them is general Benders cut. This hybrid algorithm is tested by a set of derived experiments. The result is compared with corresponding outcomes generated by the strength Pareto evolutionary algorithm and the pure constraint programming solver GECODE, which is an open source software. These tests and comparisons yield promising effect.展开更多
In the Long Term Evolution(LTE)downlink multicast scheduling,Base Station(BS)usually allocates transmit power equally among all Resource Blocks(RBs),it may cause the waste of transmit power.To avoid it,this paper put ...In the Long Term Evolution(LTE)downlink multicast scheduling,Base Station(BS)usually allocates transmit power equally among all Resource Blocks(RBs),it may cause the waste of transmit power.To avoid it,this paper put forward a new algorithm for LTE multicast downlink scheduling called the Energy-saving based Inter-group Proportional Fair(EIPF).The basic idea of EIPF is to calculate an appropriate transmitting power for each group according to its data rate respectively,and then follow the inter-group proportional fair principle to allocate RBs among multicast groups.The results of EIPF simulation show that the proposed algorithm not only can reduce the transmit power of BS effectively but also improve the utilization rate of energy.展开更多
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.展开更多
基金the China High-Tech Ship Project of the Ministry of Industry and Information Technology(No.2021-51(MC-202032-Z08))。
文摘To increase efficiency in fierce competition,it is necessary and urgent to improve the standard of production planning for shipbuilding.The construction of curved blocks is the bottleneck to improve the efficiency of shipbuilding.Thus it is a key breakthrough for higher shipbuilding productivity to study the curved block production.By analyzing the scheduling problem in curved blocks production,we propose an intelligent curved block production scheduling method and its system based on a knowledge base,and show the main process of the system.The functions of the system include data management,assembly plan generation,plan adjustment,and plan evaluation.In order to deal with the actual situation and inherit the empirical knowledge,the system extracts some rules to control block selecting,algorithm selection,and evaluation thresholds to build a production decision-making knowledge base in the curved block scheduling system.The proposed knowledge base could be referred and modified by users,especially after a few interactions between the users and the knowledge base.The final assembly plan can be visualized and evaluated to facilitate the observation of plan implementation and effects of the decisions in the process.Finally,the system is verified by a large shipyard in Shanghai using real data and the results illustrate that the proposed method can perform the knowledge-based scheduling for curved blocks construction effectively.
基金supported by the Liaoning Revitalization Talents Program(XLYC2203148)
文摘Dear Editor,This letter presents a joint probabilistic scheduling and resource allocation method(PSRA) for 5G-based wireless networked control systems(WNCSs). As a control-aware optimization method, PSRA minimizes the linear quadratic Gaussian(LQG) control cost of WNCSs by optimizing the activation probability of subsystems, the number of uplink repetitions, and the durations of uplink and downlink phases. Simulation results show that PSRA achieves smaller LQG control costs than existing works.
文摘In this paper,a novel control structure called feedback scheduling of model-based networked control systems is proposed to cope with a flexible network load and resource constraints.The state update time is adjusted according to the real-time network congestion situation.State observer is used under the situation where the state of the controlled plant could not be acquired.The stability criterion of the proposed structure is proved with time-varying state update time.On the basis of the stability of the novel system structure,the compromise between the control performance and the network utilization is realized by using feedback scheduler. Examples are provided to show the advantage of the proposed control structure.
文摘Job shop scheduling problem is typically a NP-Hard problem. In the recent past efforts put by researchers were to provide the most generic genetic algorithm to solve efficiently the job shop scheduling problems. Less attention has been paid to initial population aspects in genetic algorithms and much attention to recombination operators. Therefore authors are of the opinion that by proper design of all the aspects in genetic algorithms starting from initial population may provide better and promising solutions. Hence this paper attempts to enhance the effectiveness of genetic algorithm by providing a new look to initial population. This new technique along with job based representation has been used to obtain the optimal or near optimal solutions of 66 benchmark instances which comprise of varying degree of complexity.
文摘This study is aimed to assess the usefulness of weather forecasts for irrigation scheduling in crops to economize water use. The short-term gains for the farmers come from reducing costs of irrigation with the help of advisory for when not to irrigate because rain is predicted (risk-free because the wrong forecast only delays irrigation within tolerance). Here, a quantitative assessment of saving (indirect income) if irrigation is avoided as rain is imminent (as per forecast), using a five-year archived forecast data over Karnataka state at hobli (a cluster of small villages) level is presented. Estimates showed that the economic benefits to the farmers from such advisories were significant. The potential gain in annual income from such forecast-based irrigation scheduling was of the order of 10% - 15%. Our analysis also indicated that the use of advisory by a small percentage of more than 10 million marginal farmers (landholding < 3 acres) in Karnataka could lead to huge cumulative savings of the order of many crores.
文摘Increasing consumption, changing nature of loads and the need to reduce carbon emission are some of the factors threatening electricity grid stability and reliability. Demand side management programs mainly work by shifting consumption from peak to off-peak period, which inconveniences some consumers and possibly creates a new peak (Reverse Peak) in off-peak hours. Growing use of Photovoltaic solar power in residences provides an opportunity to manage grid reliability and stability in a more flexible manner, and mitigates reverse peaks. We propose a community based scheduling algorithm that guarantees access to shared power capacity and integrates residences’ solar power into the grid. Results indicate peak demand can be reduced by up to 32.1%, while energy costs can be reduced by up to 14.0%. Furthermore, coordinated discharging can mitigate reverse peaks by up to 23.4%. Encouraging and integrating green energy generation and storage in the consumer side is crucial to grid stability and reliability.
基金Supported by National Key Technology R&D Program(No.2013BAJ06B)
文摘In flexible job-shop batch scheduling problem, the optimal lot-size of different process is not always the same because of different processing time and set-up time. Even for the same process of the same workpiece, the choice of machine also affects the optimal lot-size. In addition, different choices of lot-size between the constrained processes will impact the manufacture efficiency. Considering that each process has its own appropriate lot-size, we put forward the concept of scheduling with lot-splitting based on process and set up the scheduling model of lot-splitting to critical path process as the core. The model could update the set of batch process and machine selection strategy dynamically to determine processing route and arrange proper lot-size for different processes, to achieve the purpose of optimizing the makespan and reducing the processing batches effectively. The experiment results show that, comparing with lot-splitting scheduling scheme based on workpiece, this model optimizes the makespan and improves the utilization efficiency of the machine. It also greatly decreases the machined batches （42%） and reduces the complexity of shop scheduling production management.
基金This project was supported by the National "863" High-Tech Research and Development Program of China(2002AA7170)
文摘Ongoing research is described that is focused upon modelling the space base information network and simulating its behaviours： simulation of spaced based communications and networking project. Its objective is to demonstrate the feasibility of producing a tool that can provide a performance evaluation of various eonstellation access techniques and routing policies. The architecture and design of the simulation system are explored. The algorithm of data routing and instrument scheduling in this project is described. Besides these, the key methodologies of simulating the inter-satellite link features in the data transmissions are also discussed. The performance of both instrument scheduling algorithm and routing schemes is evaluated and analyzed through extensive simulations under a typical scenario.
基金National Defense Fund(No.20030119)NSFC(No.60775060)the Foundation Research Fund of Harbin Engineering University(No.HEUFT07027)
文摘Due to the complex,uncertainty and dynamics in the modern manufacturing environment,a flexible and robust shop floor scheduler is essential to achieve the production goals.A design framework of a shop floor dynamical scheduler is presented in this paper.The workflow and function modules of the scheduler are discussed in detail.A multi-step adaptive scheduling strategy and a process specification language,which is an ontology-based representation of process plan,are utilized in the proposed scheduler.The scheduler acquires the dispatching rule from the knowledge base and uses the build-in on-line simulator to evaluate the obtained rule.These technologies enable the scheduler to improve its fine-tune ability and effectively transfer process information into other heterogeneous information systems in a shop floor.The effectiveness of the suggested structure will be demonstrated via its application in the scheduling system of a manufacturing enterprise.
基金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.
基金Projects(61573144,61773165,61673175,61174040)supported by the National Natural Science Foundation of ChinaProject(222201717006)supported by the Fundamental Research Funds for the Central Universities,China
文摘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.
基金supported by National Hi-tech Research and Development Program of China (863 Program, Grant No. 2002AA411030)National Defense Foundation Scientific Research of China (Grant No. d2520061124)
文摘Network-based manufacturing is a kind of distributed system, which enables manufacturers to finish production tasks as well as to grasp the opportunities in the market, even if manufacturing resources are insufficient. One of the main problems in network-based manufacturing is the allocation of resources and the assignment of tasks rationally, according to flexible resource distribution. The mapping rules and relations between production techniques and resources are proposed, followed by the definition of the resource unit. Ultimately, the genetic programming method for the optimization of the manufacturing system is put forward. A set of software for the optimization system of simulation process using genetic programming techniques has been developed, and the problems of manufacturing resource planning in network-based manufacturing are solved with the simulation of optimizing methods by genetic programming. The optimum proposal of hardware planning, selection of company and scheduling will be obtained in theory to help company managers in scientific decision-making.
基金supported by the National Natural Science Foundation of China(6083500460775047+4 种基金60974048)the National High Technology Research and Development Program of China(863 Program)(2007AA0422442008AA04Z214)the Natural Science Foundation of Hunan Province(09JJ9012)Scientific Research Fund of Hunan Provincial Education Department(08C337)
文摘An improved differential evolution（IDE）algorithm that adopts a novel mutation strategy to speed up the convergence rate is introduced to solve the resource-constrained project scheduling problem（RCPSP）with the objective of minimizing project duration Activities priorities for scheduling are represented by individual vectors and a senal scheme is utilized to transform the individual-represented priorities to a feasible schedule according to the precedence and resource constraints so as to be evaluated.To investigate the performance of the IDE-based approach for the RCPSP,it is compared against the meta-heuristic methods of hybrid genetic algorithm（HGA）,particle swarm optimization（PSO） and several well selected heuristics.The results show that the proposed scheduling method is better than general heuristic rules and is able to obtain the same optimal result as the HGA and PSO approaches but more efficient than the two algorithms.
基金supported by the National Key Research and Development Program of China(2016YFD0700605)the Fundamental Research Funds for the Central Universities(JZ2016HGBZ1035)the Anhui University Natural Science Research Project(KJ2017A891)
文摘This research provides academic and practical contributions. From a theoretical standpoint, a hybrid harmony search(HS)algorithm, namely the oppositional global-based HS(OGHS), is proposed for solving the multi-objective flexible job-shop scheduling problems(MOFJSPs) to minimize makespan, total machine workload and critical machine workload. An initialization program embedded in opposition-based learning(OBL) is developed for enabling the individuals to scatter in a well-distributed manner in the initial harmony memory(HM). In addition, the recursive halving technique based on opposite number is employed for shrinking the neighbourhood space in the searching phase of the OGHS. From a practice-related standpoint, a type of dual vector code technique is introduced for allowing the OGHS algorithm to adapt the discrete nature of the MOFJSP. Two practical techniques, namely Pareto optimality and technique for order preference by similarity to an ideal solution(TOPSIS), are implemented for solving the MOFJSP.Furthermore, the algorithm performance is tested by using different strategies, including OBL and recursive halving, and the OGHS is compared with existing algorithms in the latest studies.Experimental results on representative examples validate the performance of the proposed algorithm for solving the MOFJSP.
基金supported by National Natural Science Foundation of China(Grant No.50875090,Grant No.50905063)National Hi-tech Research and Development Program of China(863 Program,Grant No.2009AA4Z111)China Postdoctoral Science Foundation (Grant No.20090460769)
文摘The software-based computer numerical control（CNC） system includes three types of tasks： periodic real-time tasks, aperiodic real-time tasks, and non-real-time tasks. The tasks are characterized by concurrency, hybridization, and correlation, which make system implementation difficult. The conventional scheduling algorithm can not meet the demands of system implementation in the software-based CNC system completely. The uncertainty factors when running real-time tasks affect control performance by degrading manufacturing accuracy as a result of system resource and processor use restrictions. To address the technical difficulty of embedded system implementation, a novel fuzzy feedback scheduling algorithm based on output jitter of key real-time tasks for a software-based CNC system is proposed. Time characteristics, such as sampling jitter, input-output jitter, and non-schedulability are discussed, followed by quantification through simulations of the impact of time characteristics on manufacturing accuracy. On the basis of this research, the scheduler architecture is designed, and then the algorithm table is calculated. When the system resource changes, the key periodic real-time tasks meet their deadlines by means of dynamically adjusting the task period. The simulated results show that the machining precision rises by an order of magnitude for the proposed scheduler in resource-constrained software-based CNC systems. Moreover, unlike conventional feedback scheduling methods, the algorithm in this paper does not rely on the availability of task execution times and is easy to implement while incurring only a small overhead.
基金National Key Basic Research and Development Program of China(No.2013CB329503)National Natural Science Foundation of China(No.61174189)the Doctoral Program Foundation of Institutions of Higher Education of China(No.20130002110057)
文摘An improved fruit fly optimization algorithm( iFOA) is proposed for solving the lot-streaming flow-shop scheduling problem( LSFSP) with equal-size sub-lots. In the proposed iFOA,a solution is encoded as two vectors to determine the splitting of jobs and the sequence of the sub-lots simultaneously. Based on the encoding scheme,three kinds of neighborhoods are developed for generating new solutions. To well balance the exploitation and exploration,two main search procedures are designed within the evolutionary search framework of the iFOA,including the neighborhood-based search( smell-vision-based search) and the global cooperation-based search. Finally,numerical testing results are provided,and the comparisons demonstrate the effectiveness of the proposed iFOA for solving the LSFSP.
基金supported by the National Security Fundamental Research Foundation of China (61361)the National Natural Science Foundation of China (61104180)
文摘Task scheduling for electro-magnetic detection satellite is a typical combinatorial optimization problem. The count of constraints that need to be taken into account is of large scale. An algorithm combined integer programming with constraint programming is presented. This algorithm is deployed in this problem through two steps. The first step is to decompose the original problem into master and sub-problem using the logic-based Benders decomposition; then a circus combines master and sub-problem solving process together, and the connection between them is general Benders cut. This hybrid algorithm is tested by a set of derived experiments. The result is compared with corresponding outcomes generated by the strength Pareto evolutionary algorithm and the pure constraint programming solver GECODE, which is an open source software. These tests and comparisons yield promising effect.
基金Supported by the National Science and Technology Major Projects(2011ZX03005-004-03)Jiangsu University Natural Science Basic Research Project(10KJA510037)+3 种基金Nanjing University of Posts and Telecommunications (NJUPT)Introduction of Talent Project(NY209002)NJUPT Broadband Wireless Communication and Sensor Network Technology Key Laboratory of the Ministry of Education Research Fund Project(NYKL201108)Jiangsu Provincial Science and Technology Support Program of Industrial Projects(No.BE2013019)Jiangsu Construction Engineering College Dominant Disciplines Funded Projects(Information and Communication Engineering)
文摘In the Long Term Evolution(LTE)downlink multicast scheduling,Base Station(BS)usually allocates transmit power equally among all Resource Blocks(RBs),it may cause the waste of transmit power.To avoid it,this paper put forward a new algorithm for LTE multicast downlink scheduling called the Energy-saving based Inter-group Proportional Fair(EIPF).The basic idea of EIPF is to calculate an appropriate transmitting power for each group according to its data rate respectively,and then follow the inter-group proportional fair principle to allocate RBs among multicast groups.The results of EIPF simulation show that the proposed algorithm not only can reduce the transmit power of BS effectively but also improve the utilization rate of energy.
文摘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.
