This paper considers a reentrant scheduling problem on parallel primary machines with a remote server machine, which is required to carry out the setup operation. In this problem, each job has three operations. The fi...This paper considers a reentrant scheduling problem on parallel primary machines with a remote server machine, which is required to carry out the setup operation. In this problem, each job has three operations. The first and last operations are performed by the same primary machine, implying the reentrance, and the second operation is processed on the single server machine. The order of jobs is predetermined in our context. The challenge is to assign jobs to the primary machines to minimize the makespan. We develop a genetic algorithm(GA) to solve this problem. Based on a simple strategy of assigning jobs in batches on the parallel primary machines, the standardized random key vector representation is employed to split the jobs into batches. Comparisons among the proposed algorithm, the branch and bound(BB) algorithm and the heuristic algorithm, coordinated scheduling(CS), which is only one heuristic algorithm to solve this problem in the literature, are made on the benchmark data. The computational experiments show that the proposed genetic algorithm outperforms the heuristic CS and the maximum relative improvement rate in the makespan is 1.66%.展开更多
With the development of operationally responsive space（ORS） and on-board processing techniques, the end users canreceive the observation data from the ORS satellite directly. Tosatisfy the demand for reducing the re...With the development of operationally responsive space（ORS） and on-board processing techniques, the end users canreceive the observation data from the ORS satellite directly. Tosatisfy the demand for reducing the requirements-tasking-effectscycle from one day to hours, the various resources of the wholedata acquisition chain （including satellites, ground stations, dataprocessing centers, users, etc.） should be taken into an overallconsideration, and the traditional batch task planning mode shouldbe transformed into the user-oriented task planning mode. Consideringthere are many approaches for data acquisition due tothe new techniques of ORS satellite, the data acquisition chaintask planning problem for ORS satellite can be seen as the multimodalroute planning problem. Thereby, a framework is presentedusing label-constrained shortest path technique with the conflictresolution. To apply this framework to solve the ORS satellite taskplanning problem, the preprocessing and the conflict resolutionstrategies are discussed in detail. Based on the above work, theuser-oriented data acquisition chain task planning algorithm forORS satellite is proposed. The exact solution can be obtainedin polynomial time using the proposed algorithm. The simulationexperiments validate the feasibility and the adaptability of the proposedapproach.展开更多
基金Supported by National Natural Science Foundation of China(No.61271374)Beijing Natural Science Foundation(No.4122068)
文摘This paper considers a reentrant scheduling problem on parallel primary machines with a remote server machine, which is required to carry out the setup operation. In this problem, each job has three operations. The first and last operations are performed by the same primary machine, implying the reentrance, and the second operation is processed on the single server machine. The order of jobs is predetermined in our context. The challenge is to assign jobs to the primary machines to minimize the makespan. We develop a genetic algorithm(GA) to solve this problem. Based on a simple strategy of assigning jobs in batches on the parallel primary machines, the standardized random key vector representation is employed to split the jobs into batches. Comparisons among the proposed algorithm, the branch and bound(BB) algorithm and the heuristic algorithm, coordinated scheduling(CS), which is only one heuristic algorithm to solve this problem in the literature, are made on the benchmark data. The computational experiments show that the proposed genetic algorithm outperforms the heuristic CS and the maximum relative improvement rate in the makespan is 1.66%.
基金supported by the National Natural Science Foundation of China(6110118461174159)
文摘With the development of operationally responsive space（ORS） and on-board processing techniques, the end users canreceive the observation data from the ORS satellite directly. Tosatisfy the demand for reducing the requirements-tasking-effectscycle from one day to hours, the various resources of the wholedata acquisition chain （including satellites, ground stations, dataprocessing centers, users, etc.） should be taken into an overallconsideration, and the traditional batch task planning mode shouldbe transformed into the user-oriented task planning mode. Consideringthere are many approaches for data acquisition due tothe new techniques of ORS satellite, the data acquisition chaintask planning problem for ORS satellite can be seen as the multimodalroute planning problem. Thereby, a framework is presentedusing label-constrained shortest path technique with the conflictresolution. To apply this framework to solve the ORS satellite taskplanning problem, the preprocessing and the conflict resolutionstrategies are discussed in detail. Based on the above work, theuser-oriented data acquisition chain task planning algorithm forORS satellite is proposed. The exact solution can be obtainedin polynomial time using the proposed algorithm. The simulationexperiments validate the feasibility and the adaptability of the proposedapproach.
