127 results about "Job shop" patented technology

The invention discloses a flexible job-shop scheduling multi-objective method. The specific implementation procedures of the flexible job-shop scheduling multi-objective method are that: establishing a model for a multi-objective flexible job shop; optimizing the model by using an ant colony algorithm, and evaluating the result to check whether the scheme is the optimal scheme; and improving a pheromone updating rule according to the optimal scheme, and increasing convergence rate of the algorithm to obtain a Pareto optimal solution of a multi-objective flexible job shop scheduling problem. Compared with the prior art, the flexible job-shop scheduling multi-objective method effectively reduces workshop production cost, shortens the processing time, improves qualified rate of products, is high in practicability, and is easy to popularize.

A flexible job shop order insertion dynamic scheduling optimization method is a solution method aiming at the delay problems caused by the order insertion in the job shop batch dynamic scheduling, andcomprises the steps of on the basis of establishing a mathematical model of the task sequence optimization and the order batch distribution, researching a batch selection strategy, adopting an example simulation mode to obtain the reasonable sub-batch number, at the same time, according to the simulation and calculation of the typical examples, giving a recommending value of the batch number; secondly, based on the three-layer gene chromosomes of the processes, the machines and the order distribution number, taking the minimum maximum time of completion and the delay period as the optimization targets; and finally, adopting a mixed algorithm of a particle swarm optimization algorithm and a genetic algorithm to improve the speed of evolution of the sub-batch number towards an optimal direction, thereby effectively reducing the tardiness quantity. The method is good at reducing the delay period in the job shop dynamic scheduling, and for the conventional genetic algorithm, enables the convergence speed and the stability to be improved substantially, at the same time, fully combines the actual production statuses of the intelligent job shops, greatly promotes the dynamic scheduling solution, and has the great application value in the engineering.

The invention relates to a cell-machine based dynamic scheduling method for a large part flexible job shop, which comprises the steps of: 1) establishing a gridding model of a cell machine; 2) describing the cell state; 3) defining initial and entrance boundary conditions of a whole model system as beats of particles entering the system, wherein the exit boundary condition is reception capacity of a downriver factory of a supply chain on products; 4) determining the self-organized evolution rule of the model; and 5) for the work station selecting rule R[p--c], taking completion of the jth step as the start point and completion of the (j+1)th step as the finish point, taking the period (wq+w1/pe) as a measuring standard, selecting the work station with minimum (wq+w1/pe) as the processing work station of the (j+1)th step, wherein the work sequencing rule R[c--p] is determined according to a ''first come first serviced'' rule with the combination of workpiece processing priority. According to the cell-machine based dynamic scheduling method for the large part flexible job shop, the operating efficiency is improved and the stability of the device is enhanced.

The invention provides a method for dynamically re-dispatching job shop multi-process routes in batches based on a two-stage differential evolution algorithm, relating to the evaluation of a re-dispatching parameter, the construction of a dispatching model and the compilation of a dispatching proposal. The method comprises the following steps: setting up a multi-process routes batching dispatching model based on a period and event driven re-dispatching strategy, and providing the two-stage differential evolution algorithm to solve the model, so as to solve the problems of batching dividing and dispatching optimizing. Considering the condition that each work procedure of work pieces possibly has uneven capability in real environment, the method divides the each work piece in batches at the each work procedure, and the designed two-stage differential evolution algorithm solves the problems of batching dividing and dispatching optimizing, so as to effectively reduce the free time of a machine, shorten a production period, and be completely suitable for complex environment change in the process of machining and real-time treatment.

The invention discloses an equipment preventive maintenance and flexible job shop scheduling integrated optimization method. The method is characterized by specifically comprising: first of all, according to an operation sequence, an equipment maintenance period, and a constraint condition of uninterrupted production process of each operation and non-conflict production process and equipment maintenance process of a flexible job shop scheduling problem, establishing an integrated optimization model of a flexible job shop scheduling and equipment maintenance plan, which takes cost and efficiency into consideration; secondary, optimizing multiple targets by use of a hybrid multi-objective chemical-reaction optimization method, the multiple targets comprising maximum completion time, total production cost and total equipment preventive maintenance cost; and finally, obtaining an optimization solving result, such that a flexible job shop scheduling plan can be obtained. The method can realize the goals of reducing the maximum completion time, the production cost and the equipment maintenance cost and can obtain an optimal flexible job shop scheduling scheme.

The invention discloses a real-time job shop scheduling control method in a complicated production environment. The method comprises the following steps: S101, a job shop production environment multi-agent model is initialized; S102, scheduling triggering events are registered; S103, after any event in the step S102 is triggered, a plurality of workpiece agents are scheduled sequentially according to the real-time job shop state; and S104, as for each workpiece agent, after the scheduling is completed, if a cache task execution condition is met, the cache task is executed, or otherwise, the cache task execution condition is waited to be met. Thus, real-time and dynamic multi-workpiece scheduling in the complicated production environment can be effectively realized; and when production disturbance factors such as equipment fault and emergency orders are handled, the system operation efficiency can be effectively enhanced.

The invention discloses a batch scheduling method for flexible job shops based on genetic algorithms. The steps of the method are: (1) Determine the operating parameters, including population size M, crossover probability P _C , the mutation probability P _M , the number of iterations T; (2) Initial population generation, using segmented coding method to generate batch codes and process codes; (3) Individual fitness calculation, taking the reciprocal of the individual’s total completion time as its fitness value; (4) Select Operation, using the roulette selection operator; (5) crossover operation, setting crossover execution criteria, performing crossover on batch codes or process codes according to the criteria, and repairing after crossover; (6) mutation operation, using multiple Point mutation, using reverse sequence mutation for the process code; (7) Termination discrimination, judging whether the number of generations meets the termination condition, stop if it is satisfied, and output the optimal scheduling plan, otherwise go to (3). The invention can optimize the production operation of the flexible workshop, effectively shorten the production cycle, has strong applicability and is easy to popularize.

The invention discloses a flexible job shop scheduling system based on a Petri network and an improved genetic algorithm. The flexible job shop scheduling system is a system for minimizing completion time and power consumption according to peak-valley electricity price and indirect energy consumption, and comprises a job time selection module and a machine task assigning module, wherein the job time selection module is used for obtaining a migration activation time sequence FS and a migration processing sequence TS' by establishing an energy time Petri network model and a time selection simulation algorithm TSSA; the machine task assigning module is used for simulating by combination of improved genetic algorithm and the Petri network, finding out an optimal migration processing sequence TS, and obtaining a satisfactory solution of flexible job shop scheduling TI-FJSP. By adopting the flexible job shop scheduling system disclosed by the invention, making and implementation of a production plan can be effectively optimized, and a production mode with the lowest cost is provided for a company according to the peak-valley electricity price, so that the production cost of the company can be lowered, the utilization rate of energy can be increased, energy allocation can be optimized, resources can be saved, the environment can be protected, the economic benefits of the company can be optimized, and the industrial competitiveness of the company can be improved.

The invention provides a method and a system for realizing the real-time scheduling of a job shop. The method for realizing the real-time scheduling of the job shop comprises the following steps: A, establishing a data model based on biological behaviors according to input related production data of the job shop; B, utilizing the related production data of the job shop to calculating a dynamic scheduling parameter of the data model based on the biological behaviors; C, generating a scheduling command according to the data model which is based on the biological behaviors and carries the dynamic scheduling parameter, sending the generated scheduling command to a job shop subsystem and recalculating the dynamic scheduling parameter by disturbance information when the disturbance information from the job shop subsystem is received; and repeatedly carrying out the step C till the scheduling of the job shop is completed. Because only the dynamic scheduling parameter is calculated during disturbance, the reaction speed of the system to disturbance situation is increased, the requirement of the real-time scheduling is met and the production efficiency of enterprises is improved.

The invention discloses a workshop logistics distribution path optimization method based on a genetic algorithm. The workshop logistics distribution path optimization method is used for effectively planning multi-target node logistics distribution paths with priorities in discrete workshops. And on the basis of the layout diagram and the adjacency matrix of the job shop, an algorithm is applied tooptimize the logistics distribution path of the shop, and the objective function is optimized. In traditional multi-target path planning, path planning is divided into a plurality of single target nodes and a path planning problem of a single starting node, but the path planning problem generally can only obtain local optimum rather than global optimum. And a multi-target node path optimization model is established, and a proposed cross operator and a proposed mutation operator are applied from the perspective of global optimization, so that the solving speed is increased, and the solving precision is improved. By the adoption of the method, the path distance of logistics distribution in the workshops can be effectively reduced, the logistics distribution operation efficiency in the workshops can be improved, and conditions are created for improving the production efficiency in the workshops and improving the enterprise income.

The invention provides an operation shop bottleneck recognition method based on a cluster analysis concept and a multiple attribute decision making theory. The method comprises the following steps of 1, utilizing dispatching optimization scheme as input of bottleneck recognition, determining feature attributes of a bottleneck recognition device and calculating the feature attribute values of the device according to the dispatching optimization result; 2, acquiring clustering clusters of the device under different distances and a parent-child relationship dendritic structure chart thereof on the basis of the similarity of a characteristic attribute excavating machine of the device by utilizing a hierarchical clustering method; 3, determining cluster centers of two sub-clusters of a final clustering cluster, comparing the attribute values of the cluster centers on the basis of a TOPSIS method and determining bottleneck clusters containing few device members; and 4, sequentially comparing sub-clusters of the bottleneck clusters and gradually obtaining main bottleneck clusters of different orders. According to the embodiment of the invention, the method provided by the invention can be used for solving the multi-bottleneck recognition problem which cannot be solved by the existing method.

The invention provides a critical path-combined hybrid neighborhood search algorithm for job-shop scheduling. The algorithm comprises the contents of generating an initial solution by adopting a priority scheduling rule; combining a critical path, a key block and a tabu list and generating a new solution by adopting multiple neighborhood structures; carrying out infeasible estimation on the new solution; and mining a solution with a deeper range in a search space by adopting an improved critical path. A critical path-combined hybrid heuristic neighborhood search algorithm is provided, balancing of the advantages of various heuristic algorithms is achieved, and the problem of complicated shop scheduling combination optimization of an actual job shop is better solved.

The invention provides a flexible job shop scheduling method and system. The method comprises steps that S1, the initial population S is generated based on basic parameters of a flexible job shop scheduling problem FJSP, and the initial population S is taken as a parent population P; S2, the parent population P is selected, crossed and mutated to obtain a temporary progeny population T; S3, basedon the temporary progeny population T, the parent population P is subjected to niche pre-selection operation to obtain a progeny population C; S4, a fitness value of each individual in the progeny population C is calculated, and the individual with the highest fitness value in the progeny population C is taken as the optimal solution of the FJSP; and S5, based on the optimal solution, a job shop corresponding to the FJSP is scheduled. The method is advantaged in that the solution search space can be made to maintain population diversity, the obtained solution can be guaranteed to converge to the global optimum, and thereby the job shop scheduling effect can be improved.

The invention discloses a method for solving flexible job-shop scheduling based on a hybrid genetic algorithm. The method is specifically implemented according to the following steps of 1, defining aflexible job-shop scheduling coding mode as a double-layer coding mode; 2, defining a fitness function, and taking the shortest time for solving and finishing machining as an optimization target; 3, initializing parameters and populations in a flexible workshop scheduling problem by adopting a genetic algorithm and a whale swarm algorithm, and randomly generating an initial population; 4, solvingflexible job shop scheduling through a genetic algorithm; 5, solving flexible job shop scheduling through a whale swarm algorithm; and 6, realizing iterative optimization of the whale swarm algorithmon the genetic algorithm through coding recombination, and outputting an optimal scheduling scheme. According to the method, the search depth of the algorithm is increased, and solving precision and solving stability are enhanced.

The invention discloses a double-resource die job shop scheduling optimization method based on an AMAS-GA nested algorithm. On the basis of comprehensively analyzing energy consumption, completion time and equipment and personnel load conditions of a workshop, a double-resource job shop multi-target scheduling problem model is established, wherein the load balance condition of equipment and personnel is measured by calculating the standard deviation of the accumulated load of the equipment and personnel, and the energy consumption of the shop considers the energy consumption of the equipment in standby and processing states; secondly, an AMMS-GA nested algorithm is designed to carry out scheduling model optimization solution, and procedure sorting is carried out by adopting a genetic algorithm by an inner layer according to a resource selection result as a constraint; and finally, a scheduling scheme result is fed back to an outer layer algorithm to influence selection of ants on resources. The method can be used for workshop scheduling and production scheduling, the workshop production efficiency is improved, energy consumption is reduced, green and energy-saving production is promoted, and meanwhile equipment and personnel load balance in production can be met.

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.

The invention discloses a multi-target flexible job shop scheduling method based on an improved niche genetic algorithm. Constructing a production scheduling sequence according to the process data ofall the workpieces in the multi-target flexible job shop, taking the production scheduling sequence as an individual, and generating a primary population; calculating a total objective function valueof the individual, and calculating a fitness value of the individual by using an improved niche method; selecting an individual set in a roulette mode according to the fitness value; implementing crossover operation and mutation operation of the genetic algorithm; forming a new population by the obtained individuals and the individuals with the highest fitness value in the generation population; repeating the steps until a termination condition is met, outputting an optimal individual in the last generation population, and arranging processing treatment by adopting a scheduling sequence of theoptimal individual, so as to realize multi-target flexible job shop scheduling. The improved ecological niche genetic algorithm is adopted to solve the scheduling problem in the production process, ahigh-quality scheduling result can be stably obtained, workshop resource allocation is optimized, and therefore the production efficiency of a workshop is improved.

A semiconductor manufacturing system in a clean room is composed of a combination of a flow shop section and a job shop section. The flow shop section is composed of a quasi flow shop section and a quasi job shop section. In the quasi flow shop section, manufacturing apparatuses are arranged respectively so that a difference between processing ability of the manufacturing apparatuses is taken into consideration and a balance in productivity is achieved. In the quasi job shop section, manufacturing apparatuses are arranged respectively so that the balance in productivity is not achieved due to low or high processing ability of the manufacturing apparatuses, and are provided so as to be shared by the quasi flow shop section. Accordingly, a difference between the processing ability of the manufacturing apparatuses can be reduced and the cycle time can be significantly reduced.

The invention discloses a job-shop scheduling method based on an improved genetic algorithm. The method comprises the operation steps of (1) determining operation parameters, including a population scale, a crossover probability, a variation probability and the number of iterations; (2) generating an improved initial population, and combining individuals generated by adopting an active method withindividuals generated randomly in a certain proportion to form an initial population; (3) performing fitness calculation, and taking a reciprocal of the total completion time of a scheduling scheme corresponding to the individuals as a fitness value; (4) performing selection operation by adopting a roulette selection operator; (5) performing crossover operation by selecting and using a POX crossover operator; (6) selecting and using an inverse variation operator as a variation operator; and (7) performing stop judgment, judging whether a stop condition is met or not, and if yes, stopping theprocess and outputting an optimal scheduling scheme, otherwise, going to the step (3). According to the method, the convergence speed of solving can be increased; the solving performance is good; andfor the production scheduling problem of job-shop, the method has high application values.

The invention provides a method for solving a job shop process bottleneck problem based on a cuckoo search algorithm. Bottleneck resources are judged by using the TOC principle, and the processing scheduling of shop bottleneck process is optimized by using an improved cuckoo search algorithm. According to the method provided by the invention, the work scheduling of the bottleneck process is optimized targetedly, thereby avoiding a lot of unnecessary optimization processes, accelerating the execution speed of the algorithm and meanwhile improving the solution accuracy of the algorithm; bird nest groups are classified by using an improved K_means algorithm, and then optimized scheduling is carried out the clusters by using the improved cuckoo search algorithm, thereby reducing the calculation amount of the algorithm on one hand, and effectively improving the solution accuracy of the algorithm on the other hand; and the difference of bird nests is expressed by safety and flight time consumption, the safety is expressed by random number, and the flight time consumption is expressed by geographic positions, thereby being simple and effective, applicable to the actual conditions and easy to understand.

The invention discloses a job shop real-time scheduling method based on PCA-XGBoost-IRF. The method comprises the steps of 1, constructing a standard data sample; 2, pre-processing the sample data, performing abnormal value processing, class imbalance processing and normalization processing on the sample data, and segmenting a data set to meet the input requirements for decision model construction; 3, carrying out feature engineering processing on a training set, wherein the feature engineering processing comprises feature extraction, feature importance calculation and feature selection; 4, carrying out decision model construction based on an improved random forest, including random forest model construction, improvement of an RF model to obtain an IRF model, and optimization of hyper-parameters of the IRF model based on grid search; 5, performing PCA-XGBoost-IRF decision model training based on the optimal parameters; and 6, realizing the real-time selection and decision-making of a dynamic job shop scheduling rule by using a decision-making model based on PCA-XGBoost-IRF. According to the present invention, the real-time scheduling method which is more reliable and higher in robustness and generalization is provided for the intelligent scheduling research based on data driving.