104results about How to "Improve scheduling effect" patented technology

A self-adaptive selection dynamic production scheduling control system, which is realized via a computer, is characterized in that: the system comprises a system emulator, a learning machine, a decision-making machine, a scheduling rules base, a scheduling knowledge base, a carrier, processing equipments and a buffer station thereof; the buffer station is provided with an optical grating, a sensor and a detection equipment; when a working piece reaches the buffer station and is processed, the learning machine detects the current system status for learning, so as to acquire dynamic scheduling knowledge about the system and update the knowledge in the scheduling knowledge base; when one processing equipment needs to be scheduled, the decision-making machine reads corresponding scheduling knowledge in the scheduling knowledge base according to the detected system status, acquires new scheduling knowledge through continuous interactive learning with the processing system, dynamically selects the scheduling rules based on the status of the processing equipments and the working piece in the system, and chooses the optimized scheduling rules to schedule the processing equipments. The invention can adapt to instable time-varying workshop dynamic production environments, obtain a better working-piece arrangement than prior rule-based scheduling technology, effectively reduce the process waiting time, and improve the fill rate of product delivery time.

The invention relates to a workflow scheduling method based on critical path prospects. The method comprises the steps that a user submits workflow; the workflow is converted into a directed acyclic task model graph (DAG); and scheduling of DAG task nodes is performed, and a workflow scheduling scheme is output. According to the method, a longest path from an entrance task to a current task and a longest path from the current task to an exit task are considered at a task priority determination stage; and influences of critical path tasks and non-critical path tasks on a scheduling result are considered at a resource selection stage. Compared with other methods, completion time of workflow scheduling is short through the method.

The invention provides an intelligent carrying robot trolley and a management method thereof. The intelligent carrying robot trolley comprises a grabbing mechanism, a lifting mechanism and an intelligent trolley, wherein the grabbing mechanism comprises a pneumatic hand grab, a robot, a material box and an infrared scanner; the lifting mechanism comprises a lifting table and a hydraulic cylinder;the intelligent trolley comprises an intelligent trolley system, an installation plate, a signal lamp, a signal transmitter, an anti-collision bar, a buzzer, a charging port, a laser sensor, a laser sensor installation plate and a path planning module; the grabbing mechanism is arranged above the lifting mechanism; an upper panel is arranged between the grabbing mechanism and the lifting mechanism; the lifting mechanism is arranged above the intelligent trolley; and a lower bottom plate is arranged between the lifting mechanism and the intelligent trolley. The intelligent carrying robot trolley and the management method thereof provided by the invention solve the problem that a large number of manpower resources are wasted since processes such as detecting, assembling, disassembling, sorting, carrying and stacking are carried out by using a large number of manpower in the logistics and express delivery industries, and realizes intelligence, automation, and automatic managerial statistics.

The invention relates to a meme evolution multiobjective optimization scheduling method based on objective importance decomposition, comprising following steps: randomly generating an initial population with volume of N; in every generation of the algorithm, selecting by the current population through binary championship, generating an offspring population by a genetic operator; carrying out fine search to the offspring population by a partial search strategy to obtain improved population; combining the current population, the offspring population and the improved population to generate a population, carrying out mutation operation to the individuals in the population with identical objective size; sorting the individuals in the population through using the rapid nondominated sorting and crowding distance method in the NSGA-II (Nondominated Sorting Genetic Algorithm II), thus selecting N best solutions as the next generation populations. According to the invention, a multiobjective flexible working shop system can be scheduled effectively; the scheduling effect is superior to the existing advanced algorithm; and the method of the invention can be widely applied in the computer application technical field and the production scheduling field.

A multi-task reinforcement learning method for realizing parallel task scheduling is realized based on an asynchronous advantage actor-critic algorithm, and comprises the following operation steps: (1) setting an algorithm model to better solve the parallel multi-task scheduling problem, including setting a state space, setting an action space and setting an award definition; (2) improving the algorithm network as follows: using a deep neural network to represent a strategy function and a value function, wherein the global network is composed of an input layer, a shared sub-network and an output sub-network; (3) setting a new loss function of the algorithm; and (4) training the algorithm network by utilizing the collected and observed parallel task scheduling data, and applying the algorithm network to parallel task scheduling after algorithm convergence.

The invention relates to an integrated search method for large-scale flexible job shop scheduling. The integrated search method comprises the following steps that: 1) a solution vector of FJSS (flexible job shop scheduling) to be solved is defined; 2) a solution vector in hybrid harmony search is converted into the codes of a feasible solution of the FJSS; 3) a hybrid harmony search algorithm is adopted to perform harmony search; 4) the solution vector of the harmony search is converted into the scheduling solution of an FJSP problems, and corresponding neighborhoods are designed based on the scheduling solution, and local search is performed through using the designed neighborhoods, and an improved scheduling solution which is obtained through the local search is converted into a solution vector, and the solution vector is utilized to replace the solution vector before the local search, and the search process of the harmony search is continued, so that an optimal solution can be obtained; and 5) the optimal solution which is found based on the hybrid harmony search algorithm is adopted as the initial solution of a large-scale search algorithm, and the large-scale search algorithm is adopted to continue search until a termination condition is satisfied, and scheduling of which the solution is completion time can be obtained.

The invention provides a production line scheduling method based on a constructive heuristic algorithm. The method comprises the following steps: S1, setting p(i, j) as the execution time of a jth workpiece on an ith machine if n workpieces are processed on m machines, and constructing a matrix P, wherein i is a natural number from 1 to m, and j is a natural number from 1 to n; S2, randomly selecting two columns of elements in the matrix P, namely the execution time Pa and Pb of workpieces (a, b) on the m machines, wherein a is less than or equal to 1, b is less than or equal to n, and a is not equal to b; S3, determining the processing sequence of the workpieces (a, b); and S4, determining whether n columns of elements in the matrix P are compared pairwise, stopping determination if the n columns of elements are compared, adjusting the workpieces according to the determined processing sequence, and sequentially processing the workpieces on the m machines, otherwise, returning to the step S2. The production line scheduling method provided by the invention can be used for scheduling the production line of a flow shop to achieve the shortest total completion time, and reducing the waiting time of each workpiece before processing by adjusting the workpiece processing sequence. Compared with the prior art, the method provided by the invention has the advantages of low computation complexity, short computation time and better scheduling performance.

The invention discloses a vulcanizing workshop energy consumption optimized dispatching method based on the heuristic rule. The method includes the steps that firstly, a vulcanizing workshop energy consumption optimized dispatching model is established; secondly, three types of heuristic rule algorithms are proposed for a tardiness cost optimization target in the dispatching model; thirdly, a minimum operation energy consumption heuristic algorithm is proposed for an energy consumption cost optimization target; fourthly, a control machine 'off-on' state algorithm is proposed for machine waiting and halts which affect energy consumption cost; fifthly, based on the lean principle that the number of state conversion times is reduced for energy conservation, a BC algorithm based on workpiece batch machining is proposed; sixthly, based on the principle that the performance of a combinational rule is superior to that of a simple dispatching rule theory, four heuristic algorithms based on the combinational rule are proposed; seventhly, a segmentation experimental method is adopted for designing a simulation experiment case and a simulation experiment is conducted; eighthly, an experiment result is analyzed. According to the method, the dispatching performance is good, the optimizing effect on vulcanizing workshop energy consumption is obvious, and the good energy conservation effect is achieved.

The invention discloses a dynamic and semi-static combined dispatching method in an LTE system. The method comprises the steps that a base station obtains status information and parameters, so that whether service flows are retransmitted or not is determined, if not, whether the service flows are VoIP services is further determined, and a dynamic dispatching mechanism or a semi-static dispatching mechanism is carried out on the different service flows. Due to the fact that the semi-static dispatching mechanism and the dynamic dispatching mechanism are combined, the problem of service quality of real-time services and the throughput of non-real-time services are both considered, signaling resources are saved, and limited resources are fully utilized for achieving a better dispatching effect. Furthermore, on the basis of the dynamic dispatching mechanism, according to the improvement on an existing algorithm, calculation can be simplified on the premise that the real-time services and a bit rate are guaranteed, and secondary allocation on remaining resources is achieved. The dynamic and semi-static combined dispatching method in the LTE system can be widely applied in the field of wireless communication.

The invention provides a scheduling method preventing centralized arrival of buses on the basis of a GPS technology, and relates to the field of urban road traffic control. The method aims to solve the problems that in the prior art, arrival punctuality of the buses is poor and arrival time of the buses is not balanced. According to the method, retrieval is performed on the first bus nearest to a route starting point, i is equal to 1, the number, coordinates and running speeds of buses running on a route at the same time are obtained according to a GPS, a ratio interval is judged by calculating running distance, ideal distance and predicted distance between two buses and the ratio of the predicted distance of the two buses to the ideal distance between the two buses, i is equal to i plus 2, i is smaller than N, all the buses are scheduled repeatedly, the average speed of all the buses is calculated, whether operation of the buses is finished or not is judged, data of the running buses are obtained again if operation is not finished, and scheduling is achieved. The method can be used for vehicle scheduling.

The invention discloses a cloud resource online scheduling method for distributed machine learning tasks. The method comprises the following steps: firstly, starting from each time period, enabling acloud resource broker to observe a price function of each resource of each data center, and the data volume of each task needing to be trained; calculating the sum of all costs generated in the distributed machine learning task scheduling process; representing the sum with integral linear programming; decoupling the relationship between every two adjacent time periods of the relaxed linear programming through a regularization method; converting an online planning problem of the whole T moment which is difficult to process into independent linear planning at each moment. In this way, real-timedecision making can be carried out without depending on future information; and finally, the designed independent rounding method is adopted to solve the deployment scheme and the data migration scheme of the computing node and the parameter server of each machine learning task at each moment, so that the total cost sum is minimum on the basis of ensuring the task completion effect, and the scheduling effect is optimized.

The invention provides a construction method of a cascade reservoir ecological power generation multi-objective medium-and-long-term random scheduling model and an optimal scheduling method. The method comprises the following steps of: 1, analyzing random reservoir inflow runoff of a cascade reservoir, and employing an ecological water demand level index method to calculate a suitable ecological flow as an ecological flow reference value; 2, establishing a cascade reservoir ecological power generation multi-objective medium-and-long-term optimization scheduling model which comprises a cascadereservoir power generation amount closeness objective function, an ecological flow closeness objective function and constraint conditions; 3, adopting a reinforcement learning SARSA algorithm to solveand learn the model in different random storage runoff scenes, and introducing a heuristic function and a utility trace function to improve the precision and solving speed of the algorithm; and 4, according to a scheduling rule learned by the algorithm, obtaining a cascade reservoir medium-and-long-term scheduling scheme meeting the maximum ecological power generation comprehensive closeness. According to the methods of the invention, the comprehensive utilization benefit of water resources is improved, and the scheduling effect is improved.

The invention provides an upstream bandwidth distribution method of a wideband wireless metropolitan area network base station, which is used for realizing the upstream bandwidth distribution between the base station and the mobile user station, and the base station comprises global multi-class mobile user station business queues which are used for managing various businesses of the mobile user station; the method comprises the following steps: calculating the size of bandwidth resources which can be dispatched in the dispatching distribution process of the upstream bandwidth; the bandwidth distribution is sequentially carried out on initial competition ranging, a contention channel and a rapid feedback channel; calculating the residual bandwidth resources, and if the residual bandwidth exists, the bandwidth resources are distributed in the order of first processing UGS/ertPS business, then rtPS business and last nrtPS/BE business for the business in the global multi-class mobile user station business queues according to the height of priority scheme, until the bandwidth resources are completely distributed or the distribution of the bandwidth resources of all the businesses is finished.

The invention provides an AC/DC hybrid microgrid modular structure and a multi-mode operation mode, and belongs to the field of microgrid modular design and operation control. An AC/DC hybrid microgrid is divided into six modules, and the type and the control mode of distributed power supplies or energy storage in each module are determined. The six modules are a PCC module, an AC microgrid regulation module, an AC microgrid non-regulation module, a DC microgrid regulation module, a DC microgrid non-regulation module and an interconnection module. Double guarantee is provided for the relatively "weak" DC microgrid in the grid-connected microgrid through the conversion operation among the DC microgrid automatic control mode in the grid-connected state, the interconnection module control mode and the island mode in the off-grid state. The controllable distributed power supplies, energy storage and interconnected converters in different modules are combined to be controlled and the microgrid is accessed to a large power grid with a variable power load or power supply. The dependency of MGCC on the communication system is reduced by using a two-layer control method including a module lay and a microgrid layer.

The invention discloses an MPI (Moldflow Plastics Insight) information scheduling method based on reinforcement learning under a multi-network environment, aiming at overcoming the defect of low practical application performance of a high-performance parallel computer, caused by the traditional circulating scheduling method. The method comprises the steps of: initiating parameters in a process of starting an MPI system, creating Cm<2> Q tables according to a multiple Q table combined method for a computing environment matched with m networks; continuously receiving an MPI information sending request sent by application in a process of starting the MPI system, determining a current information segment, then obtaining a current environment state, scheduling the current information segment to an optimal network according to the state information of historical empirical values stored in the Q tables; and finally, computing an instant reward value obtained by the scheduling and updating Q values in the Q tables. By adopting the invention, the problems that communication loads are distributed unequally, can not adapt to the network state dynamic change and have poor adaptability on the computing environment can be solved, and the practical application performance of the high-performance parallel computer is improved.

This invention relates to one task dispatching optimization method to support OSEK standard imbedded operation system, which comprises the following steps: a, analyzing each switch situations according to task situation; b, dividing the dispatching process into four steps: finding optimization task in the prepare task; storing the current operation task environment; demoting the CPU needle; restoring optimization task running environment; c, optimizing the dispatching strategy according to four steps covering situation into four types of strategy; d, selecting different dispatching strategy according to real dispatching situation.

The embodiment of the invention discloses an order batch scheduling method and device and a computer system, and the method comprises the steps: taking a to-be-distributed batch as a unit after a scheduling period starts, and carrying out the batch appointment to a distribution terminal in a first state, wherein the to-be-allocated batch is a batch which has been packaged and is in a to-be-allocated distribution terminal state, the distribution terminals in the first state are the distribution terminals which have been allocated with batch groups and have not left yet after returning to the distribution station; and combining the remaining batches to be allocated, which are not allocated to the delivery terminals in the first state, into a plurality of batch groups, and allocating the batches to be allocated to the delivery terminals in a second state, the delivery terminals in the second state being idle delivery terminals in the delivery station or delivery terminals which are aboutto return to the delivery station and are not allocated with the batch groups. According to the embodiment of the invention, the method can reduce the waste of delivery resources while guaranteeing the delivery time efficiency.

The invention relates to an emergency resource scheduling method based on an ant colony algorithm and a multi-objective function model, belongs to the research category of data analysis, relates to the technical field of ant colony algorithms, Hungary algorithms, optimal paths, resource scheduling and the like. The method mainly aims at selection of emergency resource scheduling schemes during earthquakes, constructs an optimal path selection model between two points and a multi-objective function mathematical model, performs data analysis training by adopting an ant colony optimization algorithm and a Hungary algorithm, and obtains an optimal emergency resource scheduling scheme by utilizing the trained model. The method has the advantages that the path cost can be considered as low as possible under the condition that the time efficiency is the first essentials, the characteristics of timeliness, casualty, economy and the like of emergency material transportation can be refined, theimportance degrees of the characteristics are distinguished through weights, and the most reasonable overall scheduling scheme can be obtained.

The invention discloses a power utilization dispatching system and method, solves the problem of poor effect of performing power demand side management by utilizing off-peak power utilization in the prior art, and belongs to the field of power load dispatching. The power utilization dispatching system comprises a dispatching platform and a plurality of client terminals, the dispatching platform isused for receiving a power consumption demand of one client in a set time period, determining the power consumption demand for other clients in the time period according to the power consumption demand of the client in combination with schedulable power consumption, and sending the power consumption demand to the corresponding client terminal; and the client terminal is used for counting the electricity consumption time and the electricity consumption of the client, sending the electricity consumption time and the electricity consumption to the dispatching platform, inputting the electricityconsumption demand in a set time period, sending the electricity consumption demand to the dispatching platform, receiving the electricity consumption requirement of the dispatching platform and displaying the electricity consumption requirement.

The invention discloses a Coflow scheduling method based on deep reinforcement learning. Based on deep reinforcement learning and in combination with a multi-level priority queue and a basic flow scheduling algorithm, a Markov decision model is established, a Coflow scheduling strategy is expressed in a formalized mode, and then adjustment of the Coflow scheduling strategy is completed. Accordingto the method, a state matrix is formed by using the data size, the total flow number, the active flow number and the duration of Coflow in the current network environment to represent the network state, define and adjust the action of a flow transmission multistage priority queue, an evaluation equation is established to realize the minimum optimization of the Coflow average completion time. According to the method, deep reinforcement learning and multi-level priority queues are combined, the Coflow scheduling strategy is adjusted through a large number of trial and error and learning in theCoflow sending scheduling environment, more environmental parameters are brought into account compared with a traditional heuristic algorithm, and the transmission efficiency of Coflow is effectivelyimproved.

The invention provides an accessing method, an access system, and an access gateway for the application of a broadband service network. The invention comprises: accessing all the applications of broadband service networks, (the application of each broadband service network comprises at least one service capacity); triggering the process of authentication of the service capacity; asking for reserved resource after the authentication is approved; scheduling the allocation principle and the application principle of the service capacity when the reserved resource succeeds; combining the service capacities adaptive to the allocation principle and the application principle so as to provide the applications of the broadband service networks. The invention collectively manages and schedules the service capacities under the environment of broadband service network, and can satisfy the diversity of the service capacities and the applications in the broadband service network.