Fabric dyeing is a critical production process in the clothing industry and heavily relies on batch processing machines(BPM).In this study,the parallel BPM scheduling problem with machine eligibility in fabric dyeing ...Fabric dyeing is a critical production process in the clothing industry and heavily relies on batch processing machines(BPM).In this study,the parallel BPM scheduling problem with machine eligibility in fabric dyeing is considered,and an adaptive cooperated shuffled frog-leaping algorithm(ACSFLA)is proposed to minimize makespan and total tardiness simultaneously.ACSFLA determines the search times for each memeplex based on its quality,with more searches in high-quality memeplexes.An adaptive cooperated and diversified search mechanism is applied,dynamically adjusting search strategies for each memeplex based on their dominance relationships and quality.During the cooperated search,ACSFLA uses a segmented and dynamic targeted search approach,while in non-cooperated scenarios,the search focuses on local search around superior solutions to improve efficiency.Furthermore,ACSFLA employs adaptive population division and partial population shuffling strategies.Through these strategies,memeplexes with low evolutionary potential are selected for reconstruction in the next generation,while thosewithhighevolutionarypotential are retained to continue their evolution.Toevaluate the performance of ACSFLA,comparative experiments were conducted using ACSFLA,SFLA,ASFLA,MOABC,and NSGA-CC in 90 instances.The computational results reveal that ACSFLA outperforms the other algorithms in 78 of the 90 test cases,highlighting its advantages in solving the parallel BPM scheduling problem with machine eligibility.展开更多
As a complicated optimization problem,parallel batch processing machines scheduling problem(PBPMSP)exists in many real-life manufacturing industries such as textiles and semiconductors.Machine eligibility means that a...As a complicated optimization problem,parallel batch processing machines scheduling problem(PBPMSP)exists in many real-life manufacturing industries such as textiles and semiconductors.Machine eligibility means that at least one machine is not eligible for at least one job.PBPMSP and scheduling problems with machine eligibility are frequently considered;however,PBPMSP with machine eligibility is seldom explored.This study investigates PBPMSP with machine eligibility in fabric dyeing and presents a novel shuffled frog-leaping algorithm with competition(CSFLA)to minimize makespan.In CSFLA,the initial population is produced in a heuristic and random way,and the competitive search of memeplexes comprises two phases.Competition between any two memeplexes is done in the first phase,then iteration times are adjusted based on competition,and search strategies are adjusted adaptively based on the evolution quality of memeplexes in the second phase.An adaptive population shuffling is given.Computational experiments are conducted on 100 instances.The computational results showed that the new strategies of CSFLA are effective and that CSFLA has promising advantages in solving the considered PBPMSP.展开更多
With the growing adoption of automated guided vehicles(AGVs)in various industries,the integrated production and transportation scheduling problem(IPTSP)has emerged as a critical research focus.The IPTSP is classified ...With the growing adoption of automated guided vehicles(AGVs)in various industries,the integrated production and transportation scheduling problem(IPTSP)has emerged as a critical research focus.The IPTSP is classified as a strongly NP-hard problem due to the simultaneous scheduling of two resources:machines and transportation equipment.Meta-heuristic algorithms are one of the most popular and effective approaches to solving this problem.However,their effectiveness heavily depends on the choice of solution representation,which influences both the algorithm’s search space and convergence speed.This paper reviews the existing encoding and decoding methods and proposes a novel active decoding approach.Based on different combinations of encoding and decoding methods,six solution representations are identified,among which the newly proposed representation offers a trade-off between the search space and the algorithm’s efficiency.Specifically,four scenarios of IPTSP under different assumptions are first analyzed.Next,the variations in the six solution representations across unused scenarios and different layouts,as well as their respective encoding spaces and qualities,are summarized.Subsequently,the search efficiency of the six solution representations is evaluated using a genetic algorithm to analyze their performance under different scenarios,layouts,time ratios,and number of AGVs.Finally,the advantages,disadvantages and applicable scenes for each solution representation are summarized based on the experimental results and analysis.These findings provide valuable insights for designing more efficient algorithms to address the IPTSP.展开更多
The Virtual Power Plant(VPP),as an innovative power management architecture,achieves flexible dispatch and resource optimization of power systems by integrating distributed energy resources.However,due to significant ...The Virtual Power Plant(VPP),as an innovative power management architecture,achieves flexible dispatch and resource optimization of power systems by integrating distributed energy resources.However,due to significant differences in operational costs and flexibility of various types of generation resources,as well as the volatility and uncertainty of renewable energy sources(such as wind and solar power)and the complex variability of load demand,the scheduling optimization of virtual power plants has become a critical issue that needs to be addressed.To solve this,this paper proposes an intelligent scheduling method for virtual power plants based on Deep Reinforcement Learning(DRL),utilizing Deep Q-Networks(DQN)for real-time optimization scheduling of dynamic peaking unit(DPU)and stable baseload unit(SBU)in the virtual power plant.By modeling the scheduling problem as a Markov Decision Process(MDP)and designing an optimization objective function that integrates both performance and cost,the scheduling efficiency and economic performance of the virtual power plant are significantly improved.Simulation results show that,compared with traditional scheduling methods and other deep reinforcement learning algorithms,the proposed method demonstrates significant advantages in key performance indicators:response time is shortened by up to 34%,task success rate is increased by up to 46%,and costs are reduced by approximately 26%.Experimental results verify the efficiency and scalability of the method under complex load environments and the volatility of renewable energy,providing strong technical support for the intelligent scheduling of virtual power plants.展开更多
This paper investigates a distributed heterogeneous hybrid blocking flow-shop scheduling problem(DHHBFSP)designed to minimize the total tardiness and total energy consumption simultaneously,and proposes an improved pr...This paper investigates a distributed heterogeneous hybrid blocking flow-shop scheduling problem(DHHBFSP)designed to minimize the total tardiness and total energy consumption simultaneously,and proposes an improved proximal policy optimization(IPPO)method to make real-time decisions for the DHHBFSP.A multi-objective Markov decision process is modeled for the DHHBFSP,where the reward function is represented by a vector with dynamic weights instead of the common objectiverelated scalar value.A factory agent(FA)is formulated for each factory to select unscheduled jobs and is trained by the proposed IPPO to improve the decision quality.Multiple FAs work asynchronously to allocate jobs that arrive randomly at the shop.A two-stage training strategy is introduced in the IPPO,which learns from both single-and dual-policy data for better data utilization.The proposed IPPO is tested on randomly generated instances and compared with variants of the basic proximal policy optimization(PPO),dispatch rules,multi-objective metaheuristics,and multi-agent reinforcement learning methods.Extensive experimental results suggest that the proposed strategies offer significant improvements to the basic PPO,and the proposed IPPO outperforms the state-of-the-art scheduling methods in both convergence and solution quality.展开更多
The models, algorithms and implementation results of a computerized scheduling system were introduced for the steelmaking-continuous casting process （SCCP） of a steel plant in China. The scheduling of SCCP in this p...The models, algorithms and implementation results of a computerized scheduling system were introduced for the steelmaking-continuous casting process （SCCP） of a steel plant in China. The scheduling of SCCP in this plant required that each cast plan should be processed on time, the charges in the same cast should be processed con- tinuously on the same caster, and the waiting time of the charges which are in front of each caster cannot exceed the given threshold. At the same time, the processing time of charges cannot be conflicted mutually in the same convert- ers or refining furnaces. Based on the research background, a hybrid optimal scheduling approach and its application were discussed. Aiming at the main equipment scheduling, an optimal scheduling method was proposed which con- sisted of equipment assignment algorithm based on dynamic program （DP） technique and conflict elimination algo rithm based on linear program （LP） technique. The approach guarantees that the charges are continuously processed on the same caster. Meanwhile, the requirement for high temperature ladle can also be satisfied due to the ladle matching function. Numerical results demonstrate solution quality, computational efficiency, and values of the mod els and algorithm.展开更多
The steelmaking process scheduling problem by considering variable electricity price （SMSPVEP） was in- vestigated. A decomposition approach was proposed for the SMSPVEP. At the first stage, mathematical program-ming...The steelmaking process scheduling problem by considering variable electricity price （SMSPVEP） was in- vestigated. A decomposition approach was proposed for the SMSPVEP. At the first stage, mathematical program-ming was utilized to minimize the maximum completion time for each cast without considering variable electricity price. At the second stage, based on obtained relative schedules of all casts, a mathematical model was formulated with an objective of minimizing the energy cost for all casts scheduling problem. The two-stage models were tested on randomly generated instances based on the practical process in a Chinese steelmaking plant. Computational results demonstrate the effectiveness of the proposed approach.展开更多
Sensing coverage is a fundamental design issue in wireless sensor networks(WSNs),while sensor scheduling ensures coverage degree to the monitored event and extends the network lifetime.In this paper,we address k-cover...Sensing coverage is a fundamental design issue in wireless sensor networks(WSNs),while sensor scheduling ensures coverage degree to the monitored event and extends the network lifetime.In this paper,we address k-coverage scheduling problem in dense WSNs,we maintain a connected k-coverage energy efficiently through a novel Hard-Core based Coordinated Scheduling(HCCS),in which hardcore is a thinning process in stochastic geometry that inhibits more than one active sensor covering any area redundantly in a minimum distance. As compared with existing coordinated scheduling,HCCS allows coordination between sensors with little communication overhead.Moreover,due to the traditional sensing models in k-coverage analysis is unsuitable to describe the characteristic of transmit channel in dense WSNs,we propose a novel sensing model integrating Rayleigh Fading and Distribution of Active sensors(RFDA),and derive the coverage measure and k-coverage probability for the monitored event under RFDA. In addition,we analyze the influence factors,i.e. the transmit condition and monitoring degree to the k-coverage probability. Finally,through Monte Carlo simulations,it is shown that the k-coverage probability of HCCS outperforms that of its random scheduling counterpart.展开更多
Chemical batch processes have become significant in chemical manufacturing. In these processes, large numbers of chemical products are produced to satisfy human demands in daily life. Recently, economy globalization h...Chemical batch processes have become significant in chemical manufacturing. In these processes, large numbers of chemical products are produced to satisfy human demands in daily life. Recently, economy globalization has resulted, in growing worldwide competitions in tradi.tional chemical .process industry. In order to keep competitive in the global marketplace, each company must optimize its production management and set up a reactive system for market fluctuation. Scheduling is the core of production management in chemical processes. The goal of this paper is to review the recent developments in this challenging area. Classifications of batch scheduling problems and optimization methods are introduced. A comparison of six typical models is shown in a general benchmark example from the literature. Finally, challenges and applications in future research are discussed.展开更多
This study focuses on the scheduling problem of unrelated parallel batch processing machines(BPM)with release times,a scenario derived from the moulding process in a foundry.In this process,a batch is initially formed...This study focuses on the scheduling problem of unrelated parallel batch processing machines(BPM)with release times,a scenario derived from the moulding process in a foundry.In this process,a batch is initially formed,placed in a sandbox,and then the sandbox is positioned on a BPM formoulding.The complexity of the scheduling problem increases due to the consideration of BPM capacity and sandbox volume.To minimize the makespan,a new cooperated imperialist competitive algorithm(CICA)is introduced.In CICA,the number of empires is not a parameter,and four empires aremaintained throughout the search process.Two types of assimilations are achieved:The strongest and weakest empires cooperate in their assimilation,while the remaining two empires,having a close normalization total cost,combine in their assimilation.A new form of imperialist competition is proposed to prevent insufficient competition,and the unique features of the problem are effectively utilized.Computational experiments are conducted across several instances,and a significant amount of experimental results show that the newstrategies of CICAare effective,indicating promising advantages for the considered BPMscheduling problems.展开更多
In this paper, a single-machine scheduling model with a given common due date is considered. Job processing time is a linear decreasing function of its starting time. The objective function is to minimize the total we...In this paper, a single-machine scheduling model with a given common due date is considered. Job processing time is a linear decreasing function of its starting time. The objective function is to minimize the total weighted earliness award and tardiness penalty. Our aim is to find an optimal schedule so as to minimize the objective function. As the problem is NP-hard, some properties and polynomial time solvable cases of this problem are given. A dynamic programming algorithm for the general case of the problem is provided.展开更多
The energy Internet operation platform provides market entities such as energy users,energy enterprises,suppliers,and governments with the ability to interact,transact,and manage various operations.Owing to the large ...The energy Internet operation platform provides market entities such as energy users,energy enterprises,suppliers,and governments with the ability to interact,transact,and manage various operations.Owing to the large number of platform users,complex businesses,and large amounts of data-mining tasks,it is necessary to solve the problems afflicting platform task scheduling and the provision of simultaneous access to a large number of users.This study examines the two core technologies of platform task scheduling and multiuser concurrent processing,proposing a distributed task-scheduling method and a technical implementation scheme based on the particle swarm optimization algorithm,and presents a systematic solution in concurrent processing for massive user numbers.Based on the results of this study,the energy internet operation platform can effectively deal with the concurrent access of tens of millions of users and complex task-scheduling problems.展开更多
Ethylene cracking process is the core production process in ethylene industry,and is paid more attention to reduce high energy consumption.Because of the interdependent relationships between multi-flow allocation and ...Ethylene cracking process is the core production process in ethylene industry,and is paid more attention to reduce high energy consumption.Because of the interdependent relationships between multi-flow allocation and multi-parameter setting in cracking process,it is difficult to find the overall energy efficiency scheduling for the purpose of saving energy.The traditional scheduling solutions with optimal economic benefit are not applicable for energy efficiency scheduling issue due to the neglecting of recycle and lost energy,as well as critical operation parameters as coil outlet pressure(COP)and dilution ratio.In addition,the scheduling solutions mostly regard each cracking furnace as an elementary unit,regardless of the coordinated operation of internal dual radiation chambers(DRC).Therefore,to improve energy utilization and production operation,a novel energy efficiency scheduling solution for ethylene cracking process is proposed in this paper.Specifically,steam heat recycle and exhaust heat loss are considered in cracking process based on 6 types of extreme learning machine(ELM)based cracking models incorporating DRC operation and three operation parameters as coil outlet temperature(COT),COP,and dilution ratio according to semi-mechanism analysis.Then to provide long-term decision-making basis for energy efficiency scheduling,overall energy efficiency indexes,including overall output per unit net energy input(OONE),output-input ratio per unit net energy input(ORNE),exhaust gas heat loss ratio(EGHL),are designed based on input-output analysis in terms of material and energy flows.Finally,a multiobjective evolutionary algorithm based on decomposition(MOEA/D)is employed to solve the formulated multi-objective mixed-integer nonlinear programming(MOMINLP)model.The validities of the proposed scheduling solution are illustrated through a case study.The scheduling results demonstrate that an optimal balance between multi-flow allocation,multi-parameter setting,and DRC coordinated operation is reached,which achieves 3.37%and 2.63%decreases in net energy input for same product output and conversion ratio,as well as the 1.56%decrease in energy loss ratio.展开更多
This paper introduces a dynamic facilitating mechan is m for the integration of process planning and scheduling in a batch-manufacturi ng environment. This integration is essential for the optimum use of production re...This paper introduces a dynamic facilitating mechan is m for the integration of process planning and scheduling in a batch-manufacturi ng environment. This integration is essential for the optimum use of production resources and generation of realistic process plans that can be readily executed with little or no modification. In this paper, integration is modeled in two le vels, viz., process planning and scheduling, which are linked by an intelligent facilitator. The process planning module employs an optimization approach in whi ch the entire plan solution space is first generated and a search algorithm is t hen used to find the optimal plan. Based on the result of scheduling module an u nsatisfactory performance parameter is fed back to the facilitator, which then i dentifies a particular job and issues a change to its process plan solution spac e to obtain a satisfactory schedule.展开更多
The intense competition in the current marketplace ha s forced firms to reexamine their methods of doing business, using superior manu facturing practices in the form of just-in-time (JIT), production with JIT pra cti...The intense competition in the current marketplace ha s forced firms to reexamine their methods of doing business, using superior manu facturing practices in the form of just-in-time (JIT), production with JIT pra ctices pursue completion on time and zero inventory, which is often instruct ed according to the custom’s demand or the sale contract. Earliness and tardine ss are undesirable because both of them will bring the extra cost, cost will als o be increased by some factors such as operation condition, intermediate storage , clean method, etc, to minimize the total cost is often the main scheduling objective, but sometime it is most important for factories to eliminate the tar diness cost in order to maintain the commercial credit and to avoid penalty, the refore, minimum of tardiness cost becomes the first objective. It is more import ant to select a reasonable objective by the actual condition during scheduli ng. In this paper scheduling problem of chemical batch process with due date is studied, two different intermediate storage policies and two different productio n modes are also discussed, production scheduling with different intermediate st orage policy and different production mode is proposed and the result is compare d. In order to complete all products within the due date, not only earliness and tardiness but also holding problem is considered, the objective is to selec t a proper intermediate storage policy and production mode and to minimize the c ost resulted by the earliness and tardiness, even the cost result by the interme diate storage. Scheduling with multiple stage and multiple machine is known as a NP-hard problem, mathematical program (MP) method, such as branch-and-bound (BAB), mixed integer linear program (MILP), etc, is often used to solve the sche duling problem. But as is well known, MP method is not good for combination opti mization, especially for large scale and complex optimal problem, whereas geneti c algorithm (GA) can overcome the MP method’s shortcoming and is fit for solvin g such scheduling problem. In this paper a modified genetic algorithm with speci al crossover operator and mutation operator is presented to solve this schedulin g problem. The results show such problem can be solved effectively with the pres ented method.展开更多
The number of tardy jobs of the single machine scheduling problem with a variable processing time is studied in accordance with the published instances of traffic transportation management engineering. It is proved ...The number of tardy jobs of the single machine scheduling problem with a variable processing time is studied in accordance with the published instances of traffic transportation management engineering. It is proved by 3 partition problem that if the problem is of ready time and common deadline constrained, its complexity is NP hard in the strong sense. Finally, a polynomial algorithm for solving unit processing time and common deadline problems is proposed.展开更多
In this paper, single machine scheduling problems with variable processing time are raised. The criterions of the problem considered are minimizing scheduling length of all jobs, flow time and number of tardy jobs and...In this paper, single machine scheduling problems with variable processing time are raised. The criterions of the problem considered are minimizing scheduling length of all jobs, flow time and number of tardy jobs and so on. The complexity of the problem is determined. [WT5HZ]展开更多
In this paper, single machine scheduling problems with variable processing time is discussed according to published instances of management engineering. Processing time of a job is the product of a “coefficient' ...In this paper, single machine scheduling problems with variable processing time is discussed according to published instances of management engineering. Processing time of a job is the product of a “coefficient' of the job on position i and a “normal' processing time of the job. The criteria considered is to minimize scheduled length of all jobs. A lemma is proposed and proved. In no deadline constrained condition, the problem belongs to polynomial time algorithm. It is proved by using 3 partition that if the problem is deadline constrained, its complexity is strong NP hard. Finally, a conjuncture is proposed that is to be proved.展开更多
This paper considers an ant colony optimization algorithm based on AND/OR graph for integrated process planning and scheduling(IPPS). Generally, the process planning and scheduling are studied separately. Due to the c...This paper considers an ant colony optimization algorithm based on AND/OR graph for integrated process planning and scheduling(IPPS). Generally, the process planning and scheduling are studied separately. Due to the complexity of manufacturing system, IPPS combining both process planning and scheduling can depict the real situation of a manufacturing system. The IPPS is represented on AND/OR graph consisting of nodes, and undirected and directed arcs. The nodes denote operations of jobs, and undirected/directed arcs denote possible visiting path among the nodes. Ant colony goes through the necessary nodes on the graph from the starting node to the end node to obtain the optimal solution with the objective of minimizing makespan. In order to avoid local convergence and low convergence, some improved strategy is incorporated in the standard ant colony optimization algorithm. Extensive computational experiments are carried out to study the influence of various parameters on the system performance.展开更多
文摘Fabric dyeing is a critical production process in the clothing industry and heavily relies on batch processing machines(BPM).In this study,the parallel BPM scheduling problem with machine eligibility in fabric dyeing is considered,and an adaptive cooperated shuffled frog-leaping algorithm(ACSFLA)is proposed to minimize makespan and total tardiness simultaneously.ACSFLA determines the search times for each memeplex based on its quality,with more searches in high-quality memeplexes.An adaptive cooperated and diversified search mechanism is applied,dynamically adjusting search strategies for each memeplex based on their dominance relationships and quality.During the cooperated search,ACSFLA uses a segmented and dynamic targeted search approach,while in non-cooperated scenarios,the search focuses on local search around superior solutions to improve efficiency.Furthermore,ACSFLA employs adaptive population division and partial population shuffling strategies.Through these strategies,memeplexes with low evolutionary potential are selected for reconstruction in the next generation,while thosewithhighevolutionarypotential are retained to continue their evolution.Toevaluate the performance of ACSFLA,comparative experiments were conducted using ACSFLA,SFLA,ASFLA,MOABC,and NSGA-CC in 90 instances.The computational results reveal that ACSFLA outperforms the other algorithms in 78 of the 90 test cases,highlighting its advantages in solving the parallel BPM scheduling problem with machine eligibility.
基金supported by the National Natural Science Foundation of China(Grant Number 61573264).
文摘As a complicated optimization problem,parallel batch processing machines scheduling problem(PBPMSP)exists in many real-life manufacturing industries such as textiles and semiconductors.Machine eligibility means that at least one machine is not eligible for at least one job.PBPMSP and scheduling problems with machine eligibility are frequently considered;however,PBPMSP with machine eligibility is seldom explored.This study investigates PBPMSP with machine eligibility in fabric dyeing and presents a novel shuffled frog-leaping algorithm with competition(CSFLA)to minimize makespan.In CSFLA,the initial population is produced in a heuristic and random way,and the competitive search of memeplexes comprises two phases.Competition between any two memeplexes is done in the first phase,then iteration times are adjusted based on competition,and search strategies are adjusted adaptively based on the evolution quality of memeplexes in the second phase.An adaptive population shuffling is given.Computational experiments are conducted on 100 instances.The computational results showed that the new strategies of CSFLA are effective and that CSFLA has promising advantages in solving the considered PBPMSP.
基金Supported by National Key R&D Program of China(Grant No.2022YFB3302700)National Natural Science Foundation of China(Grant No.U21B2029)Fundamental Research Funds for the Central Universities(Grant No.2024BRA004).
文摘With the growing adoption of automated guided vehicles(AGVs)in various industries,the integrated production and transportation scheduling problem(IPTSP)has emerged as a critical research focus.The IPTSP is classified as a strongly NP-hard problem due to the simultaneous scheduling of two resources:machines and transportation equipment.Meta-heuristic algorithms are one of the most popular and effective approaches to solving this problem.However,their effectiveness heavily depends on the choice of solution representation,which influences both the algorithm’s search space and convergence speed.This paper reviews the existing encoding and decoding methods and proposes a novel active decoding approach.Based on different combinations of encoding and decoding methods,six solution representations are identified,among which the newly proposed representation offers a trade-off between the search space and the algorithm’s efficiency.Specifically,four scenarios of IPTSP under different assumptions are first analyzed.Next,the variations in the six solution representations across unused scenarios and different layouts,as well as their respective encoding spaces and qualities,are summarized.Subsequently,the search efficiency of the six solution representations is evaluated using a genetic algorithm to analyze their performance under different scenarios,layouts,time ratios,and number of AGVs.Finally,the advantages,disadvantages and applicable scenes for each solution representation are summarized based on the experimental results and analysis.These findings provide valuable insights for designing more efficient algorithms to address the IPTSP.
基金supported by the National Key Research and Development Program of China,Grant No.2020YFB0905900.
文摘The Virtual Power Plant(VPP),as an innovative power management architecture,achieves flexible dispatch and resource optimization of power systems by integrating distributed energy resources.However,due to significant differences in operational costs and flexibility of various types of generation resources,as well as the volatility and uncertainty of renewable energy sources(such as wind and solar power)and the complex variability of load demand,the scheduling optimization of virtual power plants has become a critical issue that needs to be addressed.To solve this,this paper proposes an intelligent scheduling method for virtual power plants based on Deep Reinforcement Learning(DRL),utilizing Deep Q-Networks(DQN)for real-time optimization scheduling of dynamic peaking unit(DPU)and stable baseload unit(SBU)in the virtual power plant.By modeling the scheduling problem as a Markov Decision Process(MDP)and designing an optimization objective function that integrates both performance and cost,the scheduling efficiency and economic performance of the virtual power plant are significantly improved.Simulation results show that,compared with traditional scheduling methods and other deep reinforcement learning algorithms,the proposed method demonstrates significant advantages in key performance indicators:response time is shortened by up to 34%,task success rate is increased by up to 46%,and costs are reduced by approximately 26%.Experimental results verify the efficiency and scalability of the method under complex load environments and the volatility of renewable energy,providing strong technical support for the intelligent scheduling of virtual power plants.
基金partially supported by the National Key Research and Development Program of the Ministry of Science and Technology of China(2022YFE0114200)the National Natural Science Foundation of China(U20A6004).
文摘This paper investigates a distributed heterogeneous hybrid blocking flow-shop scheduling problem(DHHBFSP)designed to minimize the total tardiness and total energy consumption simultaneously,and proposes an improved proximal policy optimization(IPPO)method to make real-time decisions for the DHHBFSP.A multi-objective Markov decision process is modeled for the DHHBFSP,where the reward function is represented by a vector with dynamic weights instead of the common objectiverelated scalar value.A factory agent(FA)is formulated for each factory to select unscheduled jobs and is trained by the proposed IPPO to improve the decision quality.Multiple FAs work asynchronously to allocate jobs that arrive randomly at the shop.A two-stage training strategy is introduced in the IPPO,which learns from both single-and dual-policy data for better data utilization.The proposed IPPO is tested on randomly generated instances and compared with variants of the basic proximal policy optimization(PPO),dispatch rules,multi-objective metaheuristics,and multi-agent reinforcement learning methods.Extensive experimental results suggest that the proposed strategies offer significant improvements to the basic PPO,and the proposed IPPO outperforms the state-of-the-art scheduling methods in both convergence and solution quality.
基金Item Sponsored by National Natural Science Foundation of China(61174187,71021061,60974091,61104174)Startup Fund of Northeastern University of China(29321006)Basic Scientific Research Foundation of Northeast University of China(N110208001)
文摘The models, algorithms and implementation results of a computerized scheduling system were introduced for the steelmaking-continuous casting process （SCCP） of a steel plant in China. The scheduling of SCCP in this plant required that each cast plan should be processed on time, the charges in the same cast should be processed con- tinuously on the same caster, and the waiting time of the charges which are in front of each caster cannot exceed the given threshold. At the same time, the processing time of charges cannot be conflicted mutually in the same convert- ers or refining furnaces. Based on the research background, a hybrid optimal scheduling approach and its application were discussed. Aiming at the main equipment scheduling, an optimal scheduling method was proposed which con- sisted of equipment assignment algorithm based on dynamic program （DP） technique and conflict elimination algo rithm based on linear program （LP） technique. The approach guarantees that the charges are continuously processed on the same caster. Meanwhile, the requirement for high temperature ladle can also be satisfied due to the ladle matching function. Numerical results demonstrate solution quality, computational efficiency, and values of the mod els and algorithm.
基金Item Sponsored by National Natural Science Foundation of China (71171038,71021061 )Fundamental Research Funds for Central Universities of China (N100504001)
文摘The steelmaking process scheduling problem by considering variable electricity price （SMSPVEP） was in- vestigated. A decomposition approach was proposed for the SMSPVEP. At the first stage, mathematical program-ming was utilized to minimize the maximum completion time for each cast without considering variable electricity price. At the second stage, based on obtained relative schedules of all casts, a mathematical model was formulated with an objective of minimizing the energy cost for all casts scheduling problem. The two-stage models were tested on randomly generated instances based on the practical process in a Chinese steelmaking plant. Computational results demonstrate the effectiveness of the proposed approach.
基金supported by the National Science Foundation of China under Grant 61271186
文摘Sensing coverage is a fundamental design issue in wireless sensor networks(WSNs),while sensor scheduling ensures coverage degree to the monitored event and extends the network lifetime.In this paper,we address k-coverage scheduling problem in dense WSNs,we maintain a connected k-coverage energy efficiently through a novel Hard-Core based Coordinated Scheduling(HCCS),in which hardcore is a thinning process in stochastic geometry that inhibits more than one active sensor covering any area redundantly in a minimum distance. As compared with existing coordinated scheduling,HCCS allows coordination between sensors with little communication overhead.Moreover,due to the traditional sensing models in k-coverage analysis is unsuitable to describe the characteristic of transmit channel in dense WSNs,we propose a novel sensing model integrating Rayleigh Fading and Distribution of Active sensors(RFDA),and derive the coverage measure and k-coverage probability for the monitored event under RFDA. In addition,we analyze the influence factors,i.e. the transmit condition and monitoring degree to the k-coverage probability. Finally,through Monte Carlo simulations,it is shown that the k-coverage probability of HCCS outperforms that of its random scheduling counterpart.
基金Supported by the National Natural Science Foundation of China （20536020, 20876056）.
文摘Chemical batch processes have become significant in chemical manufacturing. In these processes, large numbers of chemical products are produced to satisfy human demands in daily life. Recently, economy globalization has resulted, in growing worldwide competitions in tradi.tional chemical .process industry. In order to keep competitive in the global marketplace, each company must optimize its production management and set up a reactive system for market fluctuation. Scheduling is the core of production management in chemical processes. The goal of this paper is to review the recent developments in this challenging area. Classifications of batch scheduling problems and optimization methods are introduced. A comparison of six typical models is shown in a general benchmark example from the literature. Finally, challenges and applications in future research are discussed.
基金the National Natural Science Foundation of China(Grant Number 61573264).
文摘This study focuses on the scheduling problem of unrelated parallel batch processing machines(BPM)with release times,a scenario derived from the moulding process in a foundry.In this process,a batch is initially formed,placed in a sandbox,and then the sandbox is positioned on a BPM formoulding.The complexity of the scheduling problem increases due to the consideration of BPM capacity and sandbox volume.To minimize the makespan,a new cooperated imperialist competitive algorithm(CICA)is introduced.In CICA,the number of empires is not a parameter,and four empires aremaintained throughout the search process.Two types of assimilations are achieved:The strongest and weakest empires cooperate in their assimilation,while the remaining two empires,having a close normalization total cost,combine in their assimilation.A new form of imperialist competition is proposed to prevent insufficient competition,and the unique features of the problem are effectively utilized.Computational experiments are conducted across several instances,and a significant amount of experimental results show that the newstrategies of CICAare effective,indicating promising advantages for the considered BPMscheduling problems.
文摘In this paper, a single-machine scheduling model with a given common due date is considered. Job processing time is a linear decreasing function of its starting time. The objective function is to minimize the total weighted earliness award and tardiness penalty. Our aim is to find an optimal schedule so as to minimize the objective function. As the problem is NP-hard, some properties and polynomial time solvable cases of this problem are given. A dynamic programming algorithm for the general case of the problem is provided.
基金supported by the Science and Technology Project of State Grid Corporation“Research and Application of Internet Operation Platform for Ubiquitous Power Internet of Things”(5700-201955462A-0-0-00).
文摘The energy Internet operation platform provides market entities such as energy users,energy enterprises,suppliers,and governments with the ability to interact,transact,and manage various operations.Owing to the large number of platform users,complex businesses,and large amounts of data-mining tasks,it is necessary to solve the problems afflicting platform task scheduling and the provision of simultaneous access to a large number of users.This study examines the two core technologies of platform task scheduling and multiuser concurrent processing,proposing a distributed task-scheduling method and a technical implementation scheme based on the particle swarm optimization algorithm,and presents a systematic solution in concurrent processing for massive user numbers.Based on the results of this study,the energy internet operation platform can effectively deal with the concurrent access of tens of millions of users and complex task-scheduling problems.
基金supported by the High-tech Research and Development Program of China(2014AA041802)。
文摘Ethylene cracking process is the core production process in ethylene industry,and is paid more attention to reduce high energy consumption.Because of the interdependent relationships between multi-flow allocation and multi-parameter setting in cracking process,it is difficult to find the overall energy efficiency scheduling for the purpose of saving energy.The traditional scheduling solutions with optimal economic benefit are not applicable for energy efficiency scheduling issue due to the neglecting of recycle and lost energy,as well as critical operation parameters as coil outlet pressure(COP)and dilution ratio.In addition,the scheduling solutions mostly regard each cracking furnace as an elementary unit,regardless of the coordinated operation of internal dual radiation chambers(DRC).Therefore,to improve energy utilization and production operation,a novel energy efficiency scheduling solution for ethylene cracking process is proposed in this paper.Specifically,steam heat recycle and exhaust heat loss are considered in cracking process based on 6 types of extreme learning machine(ELM)based cracking models incorporating DRC operation and three operation parameters as coil outlet temperature(COT),COP,and dilution ratio according to semi-mechanism analysis.Then to provide long-term decision-making basis for energy efficiency scheduling,overall energy efficiency indexes,including overall output per unit net energy input(OONE),output-input ratio per unit net energy input(ORNE),exhaust gas heat loss ratio(EGHL),are designed based on input-output analysis in terms of material and energy flows.Finally,a multiobjective evolutionary algorithm based on decomposition(MOEA/D)is employed to solve the formulated multi-objective mixed-integer nonlinear programming(MOMINLP)model.The validities of the proposed scheduling solution are illustrated through a case study.The scheduling results demonstrate that an optimal balance between multi-flow allocation,multi-parameter setting,and DRC coordinated operation is reached,which achieves 3.37%and 2.63%decreases in net energy input for same product output and conversion ratio,as well as the 1.56%decrease in energy loss ratio.
文摘This paper introduces a dynamic facilitating mechan is m for the integration of process planning and scheduling in a batch-manufacturi ng environment. This integration is essential for the optimum use of production resources and generation of realistic process plans that can be readily executed with little or no modification. In this paper, integration is modeled in two le vels, viz., process planning and scheduling, which are linked by an intelligent facilitator. The process planning module employs an optimization approach in whi ch the entire plan solution space is first generated and a search algorithm is t hen used to find the optimal plan. Based on the result of scheduling module an u nsatisfactory performance parameter is fed back to the facilitator, which then i dentifies a particular job and issues a change to its process plan solution spac e to obtain a satisfactory schedule.
文摘The intense competition in the current marketplace ha s forced firms to reexamine their methods of doing business, using superior manu facturing practices in the form of just-in-time (JIT), production with JIT pra ctices pursue completion on time and zero inventory, which is often instruct ed according to the custom’s demand or the sale contract. Earliness and tardine ss are undesirable because both of them will bring the extra cost, cost will als o be increased by some factors such as operation condition, intermediate storage , clean method, etc, to minimize the total cost is often the main scheduling objective, but sometime it is most important for factories to eliminate the tar diness cost in order to maintain the commercial credit and to avoid penalty, the refore, minimum of tardiness cost becomes the first objective. It is more import ant to select a reasonable objective by the actual condition during scheduli ng. In this paper scheduling problem of chemical batch process with due date is studied, two different intermediate storage policies and two different productio n modes are also discussed, production scheduling with different intermediate st orage policy and different production mode is proposed and the result is compare d. In order to complete all products within the due date, not only earliness and tardiness but also holding problem is considered, the objective is to selec t a proper intermediate storage policy and production mode and to minimize the c ost resulted by the earliness and tardiness, even the cost result by the interme diate storage. Scheduling with multiple stage and multiple machine is known as a NP-hard problem, mathematical program (MP) method, such as branch-and-bound (BAB), mixed integer linear program (MILP), etc, is often used to solve the sche duling problem. But as is well known, MP method is not good for combination opti mization, especially for large scale and complex optimal problem, whereas geneti c algorithm (GA) can overcome the MP method’s shortcoming and is fit for solvin g such scheduling problem. In this paper a modified genetic algorithm with speci al crossover operator and mutation operator is presented to solve this schedulin g problem. The results show such problem can be solved effectively with the pres ented method.
文摘The number of tardy jobs of the single machine scheduling problem with a variable processing time is studied in accordance with the published instances of traffic transportation management engineering. It is proved by 3 partition problem that if the problem is of ready time and common deadline constrained, its complexity is NP hard in the strong sense. Finally, a polynomial algorithm for solving unit processing time and common deadline problems is proposed.
文摘In this paper, single machine scheduling problems with variable processing time are raised. The criterions of the problem considered are minimizing scheduling length of all jobs, flow time and number of tardy jobs and so on. The complexity of the problem is determined. [WT5HZ]
文摘In this paper, single machine scheduling problems with variable processing time is discussed according to published instances of management engineering. Processing time of a job is the product of a “coefficient' of the job on position i and a “normal' processing time of the job. The criteria considered is to minimize scheduled length of all jobs. A lemma is proposed and proved. In no deadline constrained condition, the problem belongs to polynomial time algorithm. It is proved by using 3 partition that if the problem is deadline constrained, its complexity is strong NP hard. Finally, a conjuncture is proposed that is to be proved.
基金Supported by the Fundamental Research Funds for the Central Universities(13MS100)the Hebei Province Research Foundation of Natural Science(E2011502024)the National Natural Science Foundation of China(51177046)
文摘This paper considers an ant colony optimization algorithm based on AND/OR graph for integrated process planning and scheduling(IPPS). Generally, the process planning and scheduling are studied separately. Due to the complexity of manufacturing system, IPPS combining both process planning and scheduling can depict the real situation of a manufacturing system. The IPPS is represented on AND/OR graph consisting of nodes, and undirected and directed arcs. The nodes denote operations of jobs, and undirected/directed arcs denote possible visiting path among the nodes. Ant colony goes through the necessary nodes on the graph from the starting node to the end node to obtain the optimal solution with the objective of minimizing makespan. In order to avoid local convergence and low convergence, some improved strategy is incorporated in the standard ant colony optimization algorithm. Extensive computational experiments are carried out to study the influence of various parameters on the system performance.
