This paper presents the two-machine flowshop group scheduling problem with the optimal objective of maximum lateness. A dominance rule within group and a dominance rule between groups are established. These dominance ...This paper presents the two-machine flowshop group scheduling problem with the optimal objective of maximum lateness. A dominance rule within group and a dominance rule between groups are established. These dominance rules along with a previously established dominance rule are used to develop a heuristic algorithm. Experimental results are given and analyzed.展开更多
Focusing on the single machine scheduling problem which minimizes the total completion time in the presence of dynamic job arrivals, a rolling optimization scheduling algorithm is proposed based on the analysis of the...Focusing on the single machine scheduling problem which minimizes the total completion time in the presence of dynamic job arrivals, a rolling optimization scheduling algorithm is proposed based on the analysis of the character and structure of scheduling. An optimal scheduling strategy in collision window is presented. Performance evaluation of this algorithm is given. Simulation indicates that the proposed algorithm is better than other common heuristic algorithms on both the total performance and stability.展开更多
Resource-constrained project scheduling problem（RCPSP） is an important problem in research on project management. But there has been little attention paid to the objective of minimizing activities＇ cost with the re...Resource-constrained project scheduling problem（RCPSP） is an important problem in research on project management. But there has been little attention paid to the objective of minimizing activities＇ cost with the resource constraints that is a critical sub-problem in partner selection of construction supply chain management because the capacities of the renewable resources supplied by the partners will effect on the project scheduling. Its mathematic model is presented firstly, and analysis on the characteristic of the problem shows that the objective function is non-regular and the problem is NP-complete following which the basic idea for solution is clarified. Based on a definition of preposing activity cost matrix, a heuristic algorithm is brought forward. Analyses on the complexity of the heuristics and the result of numerical studies show that the heuristic algorithm is feasible and relatively effective.展开更多
This paper considers a project scheduling problem with the objective of minimizing resource availability costs appealed to finish al activities before the deadline. There are finish-start type precedence relations amo...This paper considers a project scheduling problem with the objective of minimizing resource availability costs appealed to finish al activities before the deadline. There are finish-start type precedence relations among the activities which require some kinds of renewable resources. We predigest the process of sol-ving the resource availability cost problem （RACP） by using start time of each activity to code the schedule. Then, a novel heuris-tic algorithm is proposed to make the process of looking for the best solution efficiently. And then pseudo particle swarm optimiza-tion （PPSO） combined with PSO and path relinking procedure is presented to solve the RACP. Final y, comparative computational experiments are designed and the computational results show that the proposed method is very effective to solve RACP.展开更多
To solve the scheduling problem of dual-armed cluster tools for wafer fabrications with residency time and reentrant constraints,a heuristic scheduling algorithm was developed.Firstly,on the basis of formulating sched...To solve the scheduling problem of dual-armed cluster tools for wafer fabrications with residency time and reentrant constraints,a heuristic scheduling algorithm was developed.Firstly,on the basis of formulating scheduling problems domain of dual-armed cluster tools,a non-integer programming model was set up with a minimizing objective function of the makespan.Combining characteristics of residency time and reentrant constraints,a scheduling algorithm of searching the optimal operation path of dual-armed transport module was presented under many kinds of robotic scheduling paths for dual-armed cluster tools.Finally,the experiments were designed to evaluate the proposed algorithm.The results show that the proposed algorithm is feasible and efficient for obtaining an optimal scheduling solution of dual-armed cluster tools with residency time and reentrant constraints.展开更多
Most earth observation satellites(EOSs)are low-orbit satellites equipped with optical sensors that cannot see through clouds.Hence,cloud coverage,high dynamics,and cloud uncertainties are important issues in the sched...Most earth observation satellites(EOSs)are low-orbit satellites equipped with optical sensors that cannot see through clouds.Hence,cloud coverage,high dynamics,and cloud uncertainties are important issues in the scheduling of EOSs.The proactive-reactive scheduling framework has been proven to be effective and efficient for the uncertain scheduling problem and has been extensively employed.Numerous studies have been conducted on methods for the proactive scheduling of EOSs,including expectation,chance-constrained,and robust optimization models and the relevant solution algorithms.This study focuses on the reactive scheduling of EOSs under cloud uncertainties.First,using an example,we describe the reactive scheduling problem in detail,clarifying its significance and key issues.Considering the two key objectives of observation profits and scheduling stability,we construct a multi-objective optimization mathematical model.Then,we obtain the possible disruptions of EOS scheduling during execution under cloud uncertainties,adopting an event-driven policy for the reactive scheduling.For the different disruptions,different reactive scheduling algorithms are designed.Finally,numerous simulation experiments are conducted to verify the feasibility and effectiveness of the proposed reactive scheduling algorithms.The experimental results show that the reactive scheduling algorithms can both improve observation profits and reduce system perturbations.展开更多
Motivated by the projects constrained by space capacity and resource transporting time, a project scheduling probIem with capacity constraint was modeled. A hybrid algorithm is proposed, which uses the ideas of bi-lev...Motivated by the projects constrained by space capacity and resource transporting time, a project scheduling probIem with capacity constraint was modeled. A hybrid algorithm is proposed, which uses the ideas of bi-level scheduling and project decomposition technology, and the genetic algorithm and tabu search is combined. Topological reordering technology is used to improve the efficiency of evaluation. Simulation results show the proposed algorithm can obtain satisfied scheduling results in acceptable time.展开更多
With increased dependence on space assets,scheduling and tasking of the space surveillance network(SSN)are vitally important.The multi-sensor collaborative observation scheduling(MCOS)problem is a multi-constraint and...With increased dependence on space assets,scheduling and tasking of the space surveillance network(SSN)are vitally important.The multi-sensor collaborative observation scheduling(MCOS)problem is a multi-constraint and high-conflict complex combinatorial optimization problem that is nondeterministic polynomial(NP)-hard.This research establishes a sub-time window constraint satisfaction problem(STWCSP)model with the objective of maximizing observation profit.Considering the significant effect of genetic algorithms(GA)on solving the problem of resource allocation,an evolution heuristic(EH)algorithm containing three strategies that focus on the MCOS problem is proposed.For each case,a task scheduling sequence is first obtained via an improved GA with penalty(GAPE)algorithm,and then a mission planning algorithm(heuristic rule)is used to determine the specific observation time.Compared to the model without sub-time windows and some other algorithms,a series of experiments illustrate the STWCSP model has better performance in terms of total profit.Experiments about strategy and parameter sensitivity validate its excellent performance in terms of EH algorithms.展开更多
文摘This paper presents the two-machine flowshop group scheduling problem with the optimal objective of maximum lateness. A dominance rule within group and a dominance rule between groups are established. These dominance rules along with a previously established dominance rule are used to develop a heuristic algorithm. Experimental results are given and analyzed.
文摘Focusing on the single machine scheduling problem which minimizes the total completion time in the presence of dynamic job arrivals, a rolling optimization scheduling algorithm is proposed based on the analysis of the character and structure of scheduling. An optimal scheduling strategy in collision window is presented. Performance evaluation of this algorithm is given. Simulation indicates that the proposed algorithm is better than other common heuristic algorithms on both the total performance and stability.
文摘Resource-constrained project scheduling problem（RCPSP） is an important problem in research on project management. But there has been little attention paid to the objective of minimizing activities＇ cost with the resource constraints that is a critical sub-problem in partner selection of construction supply chain management because the capacities of the renewable resources supplied by the partners will effect on the project scheduling. Its mathematic model is presented firstly, and analysis on the characteristic of the problem shows that the objective function is non-regular and the problem is NP-complete following which the basic idea for solution is clarified. Based on a definition of preposing activity cost matrix, a heuristic algorithm is brought forward. Analyses on the complexity of the heuristics and the result of numerical studies show that the heuristic algorithm is feasible and relatively effective.
基金supported by the National Natural Science Foundation of China(7120116671201170)
文摘This paper considers a project scheduling problem with the objective of minimizing resource availability costs appealed to finish al activities before the deadline. There are finish-start type precedence relations among the activities which require some kinds of renewable resources. We predigest the process of sol-ving the resource availability cost problem （RACP） by using start time of each activity to code the schedule. Then, a novel heuris-tic algorithm is proposed to make the process of looking for the best solution efficiently. And then pseudo particle swarm optimiza-tion （PPSO） combined with PSO and path relinking procedure is presented to solve the RACP. Final y, comparative computational experiments are designed and the computational results show that the proposed method is very effective to solve RACP.
基金Projects(7107111561273035)supported by the National Natural Science Foundation of China
文摘To solve the scheduling problem of dual-armed cluster tools for wafer fabrications with residency time and reentrant constraints,a heuristic scheduling algorithm was developed.Firstly,on the basis of formulating scheduling problems domain of dual-armed cluster tools,a non-integer programming model was set up with a minimizing objective function of the makespan.Combining characteristics of residency time and reentrant constraints,a scheduling algorithm of searching the optimal operation path of dual-armed transport module was presented under many kinds of robotic scheduling paths for dual-armed cluster tools.Finally,the experiments were designed to evaluate the proposed algorithm.The results show that the proposed algorithm is feasible and efficient for obtaining an optimal scheduling solution of dual-armed cluster tools with residency time and reentrant constraints.
基金supported by the National Natural Science Foundation of China(7180121871701067+3 种基金72071075)the Research Project of National University of Defense Technology(ZK18-03-16)the Natural Science Foundation of Hunan Province,China(2020JJ46722019JJ50039)。
文摘Most earth observation satellites(EOSs)are low-orbit satellites equipped with optical sensors that cannot see through clouds.Hence,cloud coverage,high dynamics,and cloud uncertainties are important issues in the scheduling of EOSs.The proactive-reactive scheduling framework has been proven to be effective and efficient for the uncertain scheduling problem and has been extensively employed.Numerous studies have been conducted on methods for the proactive scheduling of EOSs,including expectation,chance-constrained,and robust optimization models and the relevant solution algorithms.This study focuses on the reactive scheduling of EOSs under cloud uncertainties.First,using an example,we describe the reactive scheduling problem in detail,clarifying its significance and key issues.Considering the two key objectives of observation profits and scheduling stability,we construct a multi-objective optimization mathematical model.Then,we obtain the possible disruptions of EOS scheduling during execution under cloud uncertainties,adopting an event-driven policy for the reactive scheduling.For the different disruptions,different reactive scheduling algorithms are designed.Finally,numerous simulation experiments are conducted to verify the feasibility and effectiveness of the proposed reactive scheduling algorithms.The experimental results show that the reactive scheduling algorithms can both improve observation profits and reduce system perturbations.
基金the National Basic Research Program (973 Program) (2002CB312200)
文摘Motivated by the projects constrained by space capacity and resource transporting time, a project scheduling probIem with capacity constraint was modeled. A hybrid algorithm is proposed, which uses the ideas of bi-level scheduling and project decomposition technology, and the genetic algorithm and tabu search is combined. Topological reordering technology is used to improve the efficiency of evaluation. Simulation results show the proposed algorithm can obtain satisfied scheduling results in acceptable time.
基金Supported by National Natural Science Foundation of China(60474058,60604026)National High Technology Research and Development Program of China(863 Program)(2007AA04Z156)
基金supported by the National Natural Science Foundation of China(11802333)the Scientific Research Program of the National University of Defense Technology(ZK19-31)。
文摘With increased dependence on space assets,scheduling and tasking of the space surveillance network(SSN)are vitally important.The multi-sensor collaborative observation scheduling(MCOS)problem is a multi-constraint and high-conflict complex combinatorial optimization problem that is nondeterministic polynomial(NP)-hard.This research establishes a sub-time window constraint satisfaction problem(STWCSP)model with the objective of maximizing observation profit.Considering the significant effect of genetic algorithms(GA)on solving the problem of resource allocation,an evolution heuristic(EH)algorithm containing three strategies that focus on the MCOS problem is proposed.For each case,a task scheduling sequence is first obtained via an improved GA with penalty(GAPE)algorithm,and then a mission planning algorithm(heuristic rule)is used to determine the specific observation time.Compared to the model without sub-time windows and some other algorithms,a series of experiments illustrate the STWCSP model has better performance in terms of total profit.Experiments about strategy and parameter sensitivity validate its excellent performance in terms of EH algorithms.
