Research on Multitask Collaborative Scheduling Problem with Heuristic Strategies

2011 ◽  
Vol 66-68 ◽  
pp. 758-763
Author(s):  
Fan Zhang ◽  
Gui Fa Teng ◽  
Jian Bin Ma ◽  
Jie Yao
Keyword(s):  
Scheduling Algorithm ◽  
Scheduling Problem ◽  
Agricultural Machinery ◽  
Start Time ◽  
Farm Machinery ◽  
Scheduling Scheme ◽  
Scheduling Model ◽  
Heuristic Strategies ◽  
Collaborative Scheduling ◽  
Minimal Resource

According to problems existed in the current farm machinery scheduling process, a new farm machinery scheduling scheme is adopted in this dissertation. The collaborative scheduling model of farm machinery is established and multitask collaborative scheduling algorithm is designed through analyzing the differences between Vehicle Scheduling Problem and agricultural machinery scheduling in the dissertation. Earliest Start Time First and minimal resource allocated capacity first strategies are used in the farm machinery scheduling. The algorithm is useful for the case of machinery owner with sufficient farm machinery. The experiment proves that the collaborative scheduling algorithm is more effective than the serial scheduling algorithm.

scholarly journals Research on the Scheduling of Tractors in the Major Epidemic to Ensure Spring Ploughing

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Chen Cong ◽  
Hu Jianping ◽  
Zhang Qingkai ◽  
Zhang Meng ◽  
Li Yibai ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing Algorithm ◽  
Time Window ◽  
Scheduling Algorithm ◽  
Utilization Efficiency ◽  
Agricultural Machinery ◽  
Scheduling Scheme ◽  
Transfer Distance ◽  
Scheduling Model ◽  
Operation Scheduling

When the outbreak of COVID-19 began, people could not go out. It was not allowed to provide agricultural machinery services in different places across regions to reduce the flow and gathering of people. Improvement of utilization efficiency of agricultural machinery resources is required through scientific scheduling of agricultural machinery. With seizing the farming season and stabilizing production as the goal, this paper studied the scientific scheduling of tractors within the scope of town and established agricultural machinery operation scheduling model with the minimization of total scheduling cost as the optimization objective. Factors such as farmland area, agricultural machinery, and farmland location information and operating time window are considered in this model to improve the accuracy of the agricultural machinery operation scheduling model. The characteristics of multiple scheduling algorithms are analyzed comprehensively. The scheduling requirements of agricultural machinery operation to ensure spring ploughing are combined to design the agricultural machinery scheduling algorithm based on the SA algorithm. With Hushu Street, Jiangning District, Nanjing City, as an example, a comparative experiment is conducted on the simulated annealing algorithm (SA) designed in this paper and the empirical algorithm and genetic algorithm (GA). The results suggest that the total cost of the scheduling scheme generated by the SA algorithm is 19,042.07 yuan lower than that by the empirical scheduling algorithm and 779.19 yuan lower than that by the genetic algorithm on average. Compared with the GA algorithm, the transfer distance, waiting cost, and delay cost of the SA algorithm are reduced by 11.6%, 100%, and 98.1% on average, indicating that the transfer distance of agricultural machinery in the scheduling scheme generated by the SA algorithm is shorter, so is the waiting and delay time. Meanwhile, it can effectively obtain the near-optimal solution that meets the time window constraint, with good convergence, stability, and adaptability.

A multi-shop integrated scheduling algorithm with fixed output constraint

2021 ◽  
pp. 1-9
Author(s):  
Yingchun Xia ◽  
Zhiqiang Xie ◽  
Yu Xin ◽  
Xiaowei Zhang
Keyword(s):  
Constraint Programming ◽  
Programming Model ◽  
Scheduling Algorithm ◽  
Processing Parameters ◽  
Scheduling Problem ◽  
Integrated Scheduling ◽  
Scheduling Scheme ◽  
Wide Range ◽  
Constraint Programming Model ◽  
Output Constraint

The customized products such as electromechanical prototype products are a type of product with research and trial manufacturing characteristics. The BOM structures and processing parameters of the products vary greatly, making it difficult for a single shop to meet such a wide range of processing parameters. For the dynamic and fuzzy manufacturing characteristics of the products, not only the coordinated transport time of multiple shops but also the fact that the product has a designated output shop should be considered. In order to solve such Multi-shop Integrated Scheduling Problem with Fixed Output Constraint (MISP-FOC), a constraint programming model is developed to minimize the total tardiness, and then a Multi-shop Integrated Scheduling Algorithm (MISA) based on EGA (Enhanced Genetic Algorithm) and B&B (Branch and Bound) is proposed. MISA is a hybrid optimization method and consists of four parts. Firstly, to deal with the dynamic and fuzzy manufacturing characteristics, the dynamic production process is transformed into a series of time-continuous static scheduling problem according to the proposed dynamic rescheduling mechanism. Secondly, the pre-scheduling scheme is generated by the EGA at each event moment. Thirdly, the jobs in the pre-scheduling scheme are divided into three parts, namely, dispatched jobs, jobs to be dispatched, and jobs available for rescheduling, and at last, the B&B method is used to optimize the jobs available for rescheduling by utilizing the period when the dispatched jobs are in execution. Google OR-Tools is used to verify the proposed constraint programming model, and the experiment results show that the proposed algorithm is effective and feasible.

A NEW ALGORITHM FOR MULTI-SKILL RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM BASED ON CUCKOO SEARCH STRATEGY

2020 ◽  
Vol 65 (6) ◽  
pp. 98-109
Author(s):  
Huu Dang Quoc ◽  
Loc Nguyen The ◽  
Cuong Nguyen Doan ◽  
Toan Phan Thanh
Keyword(s):  
Project Scheduling ◽  
Search Strategy ◽  
Scheduling Algorithm ◽  
Optimal Schedule ◽  
Cuckoo Search ◽  
Scheduling Problem ◽  
Resource Constrained ◽  
Start Time ◽  
Resource Constrained Project Scheduling ◽  
Project Scheduling Problem

The purpose of this paper is to consider the project scheduling problem under such limited constraint, called Multi-Skill Resource-Constrained Project Scheduling Problem or MS-RCPSP. The algorithm proposed in this paper is to find the optimal schedule, determine the start time for each task so that the execution time (also called makespan) taken is minimal. At the same time, our scheduling algorithm ensures that the given priority relationships and constraints are not violated. Our scheduling algorithm is built based on the Cuckoo Search strategy. In order to evaluate the proposed algorithm, experiments were conducted by using the iMOPSE dataset. The experimental results proved that the proposed algorithm found better solutions than the previous algorithm.

Integrated Scheduling Algorithm with Setup Time

2011 ◽  
Vol 213 ◽  
pp. 226-230
Author(s):  
Zhi Qiang Xie ◽  
Jing Yang ◽  
Yu Zheng Teng ◽  
Lan Lan
Keyword(s):  
Time Complexity ◽  
Scheduling Algorithm ◽  
Research Result ◽  
Setup Time ◽  
Scheduling Problem ◽  
Start Time ◽  
Complex Products ◽  
Integrated Scheduling

Aiming at the problem that there is no research result in the complex products processing and assemble integrated scheduling problem with setup time, this paper proposes strategy to resolve this problem. That is to determine scheduling sequence of procedures according to layer priority strategy, shorten time strategy and long path strategy. Then adopt algorithm of inserting setup time dynamically to determine the start time of procedures by scheduling sequence. As this algorithm avoids to move scheduled procedures many times after inserting setup time, the time complexity is only secondary. So this algorithm is simple and has high scheduling efficiency.

scholarly journals SIMULATED ANNEALING GENETIC ALGORITHM-BASED HARVESTER OPERATION SCHEDULING MODEL

2021 ◽  
pp. 249-260
Author(s):  
Qingkai Zhang ◽  
Guangqiao Cao ◽  
Junjie Zhang ◽  
Yuxiang Huang ◽  
Cong Chen ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Scheduling Algorithm ◽  
Supply And Demand ◽  
Operating Cost ◽  
Optimal Solution ◽  
Agricultural Machinery ◽  
Simulated Annealing Genetic Algorithm ◽  
Scheduling Model ◽  
Operation Scheduling

To address problems involving the poor matching ability of supply and demand information and outdated scheduling methods in agricultural machinery operation service, in this study, we proposed a harvester operation scheduling model and algorithm for an order-oriented multi-machine collaborative operation within a region. First, we analysed the order-oriented multi-machine collaborative operation within the region and the characteristics of agricultural machinery operation scheduling, examined the revenue of a mechanized harvesting operation and the components of each cost, and constructed a harvester operation scheduling model with the operation income as the optimization goal. Second, we proposed a simulated annealing genetic algorithm-based harvester operation scheduling algorithm and analysed the validity and stability of the algorithm through experimental simulations. The results showed that the proposed harvester operation scheduling model effectively integrated the operating cost, transfer cost, waiting time cost, and operation delay cost of the harvester, and the accuracy of the harvester operation scheduling model was improved; the harvester operation scheduling algorithm based on simulated annealing genetic algorithm (SAGA) was able to obtain a global near-optimal solution of high quality and stability with high computational efficiency.

Emergency Scheduling Model of Urban Rail Transit Based on Genetic Algorithm

2013 ◽  
Vol 397-400 ◽  
pp. 2511-2516
Author(s):  
Yi Jun Li ◽  
Yu Fang
Keyword(s):  
Daily Life ◽  
Economic Benefits ◽  
Urban Rail Transit ◽  
Rail Transit ◽  
Scheduling Problem ◽  
Transit Network ◽  
Scheduling Scheme ◽  
Passenger Flow ◽  
Scheduling Model ◽  
Urban Rail

Urban rail transit plays an important role in daily life and optimal emergency scheduling determines social and economic benefits. To solve emergency scheduling problem of urban rail transit, a mathematical scheduling model is proposed in this paper. Based on the characteristic of urban rail transit, this scheduling model considers the benefits of both passengers and rail transit operator. Furthermore, on the basis of the model, three sorts of emergencies, such as closure of stations, outage of metro lines and surge of passenger flow are described and formulated, thus, model is solved through several GA operations. The testing results show that the model can accurately reflect the change of rail transit network during emergencies and quickly provide an effective emergency scheduling scheme.

Parallel Scheduling Algorithms Investigation of Support Strict Resource Reservation from Grid

2014 ◽  
Vol 519-520 ◽  
pp. 108-113 ◽  
Author(s):  
Jun Chen ◽  
Bo Li ◽  
Er Fei Wang
Keyword(s):  
Parallel Computing ◽  
Resource Utilization ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Resource Reservation ◽  
Parallel Scheduling ◽  
Scheduling Model ◽  
Computing Grid ◽  
Simulation Results ◽  
Reservation Request

This paper studies resource reservation mechanisms in the strict parallel computing grid,and proposed to support the parallel strict resource reservation request scheduling model and algorithms, FCFS and EASY backfill analysis of two important parallel scheduling algorithm, given four parallel scheduling algorithms supporting resource reservation. Simulation results of four algorithms of resource utilization, job bounded slowdown factor and the success rate of Advanced Reservation (AR) jobs were studied. The results show that the EASY backfill + firstfit algorithm can ensure QoS of AR jobs while taking into account the performance of good non-AR jobs.

Scheduling Scheme Based on Smart Grid of Energy-Saving

2013 ◽  
Vol 340 ◽  
pp. 908-912
Author(s):  
Ke Zhang
Keyword(s):  
Smart Grid ◽  
Energy Saving ◽  
Energy Efficient ◽  
Power Industry ◽  
Ideal Solution ◽  
Scheduling Scheme ◽  
Electricity System ◽  
Scheduling Model ◽  
The Future ◽  
Energy Efficient Scheduling

The smart grid is an ideal solution of the future electricity system, and scheduling aspects of the smart grid, the nerve center of the most intelligent can best embody the intelligent characteristic, this article summarizes the development of smart grid technologies, energy-saving scheduling, and the smart grid ofsignificance analysis to explore the implementation of energy-saving dispatch to the power industry, an energy efficient scheduling model and highlight the superiority of the energy-saving scheduling in order to ensure the smooth implementation of energy-saving scheduling.

Linear Rail Space Dynamic Scheduling Technology for Multi-Tasking Hybrid Assembly Sections

2012 ◽  
Vol 271-272 ◽  
pp. 650-656
Author(s):  
Zhi Bing Lu ◽  
Ai Min Wang ◽  
Cheng Tong Tang ◽  
Jing Sheng Li
Keyword(s):  
Production Scheduling ◽  
Dynamic Scheduling ◽  
Scheduling Algorithm ◽  
Real Data ◽  
Utilization Rate ◽  
Filter Method ◽  
Scheduling Problem ◽  
Rule Based ◽  
Comprehensive Utilization ◽  
Space Production

For the rapid response to production scheduling problem driven by high-density production tasks, a dynamic scheduling technology for the large precision strip products assembly with a mixture of task time nodes and line-rail space is proposed. A scheduling constrained model containing coverage, proximity, timeliness and resource is established. A linear rail space production scheduling technology using heuristic automatic scheduling and event-driven method is put forward. The time rule based on delivery and single completion assembly is formed, at the same time the space rule based on the adjacent rail and comprehensive utilization is researched. Supposing the privilege of single product assembling as the core, the scheduling parts filter method based on multiple constraints and former rules. For the space layout problem, a clingy forward and backward algorithms is proposed to judge the assemble position regarding the space comprehensive utilization rate. The classification of the various disturbances in the actual production is summarized. Three basic algorithms are proposed, including insertion, moving and re-scheduling algorithm, in order to solve the assembly dynamic scheduling problem driven by production disturbance events. Finally, take rocket as the example， the rocket assembly space production scheduling system is developed, combining with the proposed algorithm. The practicability of the system is validated using real data.

Sign in / Sign up

Export Citation Format

Share Document