Patents
Literature
Patsnap Copilot is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Patsnap Copilot

169results about How to "Solve scheduling problems" patented technology

Combined scheduling method of satellite-ground measurement and control resources of low-mid-orbit satellite constellation based on orbit determination constraint satisfaction

The invention discloses a combined scheduling method of satellite-ground measurement and control resources of a low-mid-orbit satellite constellation based on orbit determination constraint satisfaction, and belongs to the field of combined scheduling of the satellite-ground measurement and control resources. The method comprises the steps of (1) building a visible geometry model, (2) building a visible link model, (3) building the constraint condition of orbit determination, (4) carrying out preprocessing, (5) determining a resource distribution principle, (6) building a combined scheduling model of the satellite-ground measurement and control resources, and (7) carrying out algorithm solution. Compared with the prior art, the method has the advantages that the scheduling result is reasonable, the scheduling process is efficient, and the scheduling method is high in universality. The air-and-ground-based integrated scheduling of the measurement and control resources is achieved. The transition from ground-based measurement and control to air-and-ground-based combined measurement and control in China is achieved.
Owner:CHINA XIAN SATELLITE CONTROL CENT

Aircraft crew scheduling method and system realizing the same

InactiveCN102542404AImprove scheduling resultsRun fastResourcesOriginal dataSimulation
The invention discloses an aircraft crew scheduling method, which comprises the following steps: (1) acquiring original data meeting requirements of a user from a user interface and a database, and analyzing, converting and arranging the original data to acquire all essential data meeting required forms; (2) carrying constraint control on the essential data according to a scheduling rule, generating all probably scheduled task combinations for each aircraft crew, namely generating a relative task string LoW for each aircraft crew, and evaluating and correcting the task strings LoW; (3) converting all corrected task strings into a task column and establishing a constraint matrix; (4) solving the constraint matrix by utilizing an algorithm of disassembling a large-scale problem formed by integer programming problems into sub problems; and (5) outputting calculation results. The invention further discloses a system for realizing the aircraft crew scheduling method, wherein the system comprises a data input module, a model generation module, a solving module, a control module, a basic module and the like. According to the system for realizing the aircraft crew scheduling method, disclosed by the invention, requirements on equitable distribution of flight number plane, aircraft crew scheduling and flight task are met through cooperation of all modules.
Owner:中国南方航空股份有限公司

Bidirectional grade gridding resource scheduling method based on QoS restriction

The invention relates to a bidirectional stepped grid resource scheduling method based on QoS constraints, which includes: 1. QoS service is offered to all available machines for testing according to QoS request provided by the task and the testing results are recorded in a matrix form, if the request is executable, the execution time is recorded and if the request is non-executable corresponding signs are made; 2. the matrix of the testing results is deformed according to the designated principle and the deformed matrix is accumulated according to the horizontal and vertical directions, thus calculating two vectors; 3. the tasks and the resources are grouped in a non-descending order according to the two vectors; 4. the priority scheduling is conducted according to the task grouping results, wherein, the group with small value has high priority and is firstly scheduled and the interior of the grouping is scheduled according to Min-min algorithm principle; 5. if the task has the same minimum completion time with different resources in the scheduling, the scheduling is conducted according to the resource grouping results and the group with small value has high priority and is firstly scheduled; 6. the fourth step and the fifth step are repeatedly executed until the scheduling of all tasks is completed.
Owner:WUHAN UNIV OF TECH

Genetic algorithm using improved coding method to solve distributed flexible job shop scheduling problem

The invention provides a genetic algorithm using an improved coding method to solve a distributed flexible job shop scheduling problem. The algorithm is suitable for the field of flexible job shop scheduling. The distributed flexible job shop scheduling problem refers to production activities carried out in several factories and manufacturing units, contains the information of flexible job shop scheduling problems, and contains the selection of suitable factories and flexible manufacturing units. The allocation of specific workpieces to different factories produces different production scheduling, which affects a supply chain. The existing technology has little research on the problem. The invention proposes the genetic algorithm to solve the problem. A traditional genetic algorithm is easy to fall into local optimum and leads to premature convergence, and the coding method produces infeasible solution and other problems. According to the invention, the improved coding method based on probability is provided; the crossover of a tabu table is introduced; the problems are avoided based on the variation of neighborhood search; and the genetic algorithm takes into account the actual production situation, and has the characteristics of high practicability and the like.
Owner:SICHUAN YONGLIAN INFORMATION TECH CO LTD

Single job shop scheduling method for multi-Agent deep reinforcement learning

The invention provides a single-piece job-shop scheduling method based on multi-Agent deep reinforcement learning, aiming at the characteristics that the single-piece job-shop scheduling problem is complex in constraint and various in solution space types, and the traditional mathematical programming algorithm and meta-heuristic algorithm cannot meet the quick solution of the large-scale job-shopscheduling problem. The method comprises the following steps: firstly, designing a communication mechanism among multiple Agents, and carrying out reinforcement learning modeling on a single job shopscheduling problem by adopting a multi-Agent method; secondly, constructing a deep neural network to extract a workshop state, and designing an operation workshop action selection mechanism on the basis of the deep neural network to realize interaction between a workshop processing workpiece and a workshop environment; thirdly, designing a reward function to evaluate the whole scheduling decision,and updating the scheduling decision by using a PolicyGraphic algorithm to obtain a more excellent scheduling result; and finally, performing performance evaluation and verification on the algorithmperformance by using the standard data set. The job shop scheduling problem can be solved, and the method system of the job shop scheduling problem is enriched.
Owner:DONGHUA UNIV

Drop-and-pull transport dynamic path planning method based on receding horizon optimization

The invention discloses a drop-and-pull transport dynamic path planning method based on receding horizon optimization. The drop-and-pull transport dynamic path planning method is characterized by comprising the following steps of 1, dividing vehicle queue operation time into a plurality of time fragments by means of a rolling optimization method; 2, acquiring an inner dispensing cost matrix of a plurality of future time segments at each time segment; 3, establishing a drop-and-pull transport dynamic path planning model based on receding horizon optimization by means of the dispensing cost matrix; 4, solving an optimal plan in the plurality of future time segments by means of the drop-and-pull transport dynamic path planning model; and 5, randomly generating an initial solution, performing iterative solving on the initial solution by means of a simulated annealing algorithm, thereby obtaining an optimal solution, and executing the optimal solution. The drop-and-pull transport dynamic path planning method can perform structured decision on a drop-and-pull transport dynamic path planning problem and quickly generates a dynamic path planning scheme, thereby improving real-time performance, rationality and accuracy of the dynamic path planning scheme and reducing transport cost.
Owner:HEFEI UNIV OF TECH

Network resource scheduling method in heterogeneous network and wireless resource controller

The invention discloses a network resource scheduling method in a heterogeneous network and a wireless resource controller. The network resource scheduling method is suitable for multimedia data transmission in the heterogeneous network and comprises the following steps: each mobile terminal measures and determines the respective expected binding number of terminal sublayers every other first schedule time, the respective expected binding number of terminal sublayers and the type of the mobile terminal are reported, the wireless resource controller determines the forwarding sublayer information of the network coverage area every other second schedule time according to the reported message of the mobile terminal, and sends the forwarding sublayer information of the network covering area where the mobile terminal is located to the mobile terminal; the mobile terminal determines the binding number of terminal sublayers according to the type of the mobile terminal and the received forwarding sublayer information to decode and play back the multimedia data according to the determined binding number of terminal sublayers, wherein the forwarding sublayer information is the information relevant to the data required to be forwarded in the network coverage area. The network resource scheduling method ensures that the network resources can be fully utilized.
Owner:BEIJING UNIV OF POSTS & TELECOMM

Network scheduling algorithm for CAN (controller area network) bus master-slave answer mode protocol

The invention discloses a network scheduling algorithm for a CAN (controller area network) bus master-slave answer mode protocol; the network scheduling algorithm is used for message scheduling in a CAN bus network which adopts a master-slave answer mode application protocol for network communication. According to the scheduling algorithm, when a time-triggered scheduling list is created, constraint conditions that requests and answer messages are placed alternately, request messages of the same destination ID are not arranged in adjacent columns of the same row of the scheduling list are adopted for creating the scheduling list in an alternate type bin packing algorithm. A genetic algorithm is improved for optimizing the exclusive time window of the scheduling list, so that the bus use ratio is improved. Node messages in the network are subjected to periodical statistics, the scheduling list is dynamically updated, and reasonable use of resources is realized. According to the scheduling algorithm, the use ratio of network buses can be improved, waiting time lapse of messages can be reduced, messages can be reasonably scheduled, and defects of an existing network scheduling algorithm when a master-slave answer mode is adopted are overcome.
Owner:BEIJING EPSOLAR TECH

Hybrid fruit fly algorithm based on double-objective job shop scheduling

The invention provides a hybrid fruit fly algorithm based on double-objective job shop scheduling. The method comprises the following steps: a mathematical model is built; the constraint conditions for the processing order of different working procedures of each work piece are built; the constraint conditions for the processing order of the working procedures of different work pieces on each machine are built; an objective function is built; fruit fly individual and fruit fly population initialization are carried out; a new fruit fly population is obtained, and a global collaboration mechanismis carried out; the new obtained fruit fly population is evaluated and iterative optimization is carried out; and if termination conditions are met, non-inferior sets obtained through multiple timesof operation are combined and screened to obtain a pareto solution set. Only two parameters need to be set, the algorithm is simple to realize, the complexity of job shop scheduling is reduced, and the job shop scheduling efficiency is enhanced; besides, the global optimization ability is strong, and the job shop scheduling problem can be effectively solved; and the hybrid fruit fly algorithm based on double-objective job shop scheduling has the advantages of few set parameters, strong convergence and strong robustness and the like.
Owner:北京创源微致软件有限公司 +1

Satellite resource dynamic scheduling method based on solution set construction and pheromone deposition

The invention discloses a satellite resource dynamic scheduling method based on solution set construction and pheromone deposition. The method comprises the following steps of taking satellite resources, channel resources and time slot resources as scheduling objects, and taking conditions such as a time window, satellite energy consumption, the number of channels, the priority of ground users andcommunication burstiness as constraints; establishing a system resource scheduling model and a low-orbit satellite resource scheduling model; judging whether the task set is an empty set or not, if so, ending task scheduling, and outputting an optimal resource scheduling result; otherwise, randomly selecting one task in the task set, judging whether a low-orbit satellite exists in the visual range or not, and if so, selecting one low-orbit satellite in the visual range for resource scheduling; otherwise, task transmission fails. The resource scheduling model provided by the invention is moresuitable for low-orbit satellite resource scheduling under a large-scale dense networking condition, and has the characteristics of simple control, strong compatibility, low hardware requirement, easiness in programming realization and the like.
Owner:军事科学院系统工程研究院网络信息研究所

Wireless management system and method based on NB-IOT (Narrow Band Internet of Things) technology for electric vehicle battery

The invention discloses a wireless management system and method based on an NB-IOT (Narrow Band Internet of Things) technology for an electric vehicle battery. The system comprises a user terminal, avehicle-mounted battery terminal and a monitoring center. The electric vehicle battery is provided with a unique electronic label; the vehicle-mounted battery terminal records information such as theelectric quantity, the capacity, the geographical position and the charging and discharging times of the electric vehicle battery in real time, and transmits the information to the monitoring center through an NB-IOT cellular base station, so that the monitoring center performs intelligent management on the electric vehicle battery; and the user terminal acquires real-time information of the battery through information interaction with the monitoring center, and communicates with the battery through wireless communication, so that the user terminal can perform permission management on the battery conveniently. The NB-IOT technology is used, so that real-time information acquisition and remote monitoring of the information of the electric vehicle battery are realized, the problems concernedwith scheduling of a mobile charging battery and the like are solved; the real-time information of the electric vehicle battery can be checked in a mobile way by the user terminal; and a battery authorization use flow is simplified.
Owner:ZHEJIANG UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products