Distributed workshop scheduling optimization method and system with orders and robot carrying
A technology for workshop scheduling and optimization methods, applied in manufacturing computing systems, design optimization/simulation, instruments, etc., can solve the problems of less application of algorithms and no effective solutions for distributed flow scheduling of orders, etc., to achieve enhanced search capabilities , Minimize the maximum completion time, improve the effect of factory throughput
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0034] In the technical solutions disclosed in one or more embodiments, such as figure 1 As shown, the distributed workshop scheduling optimization method with orders and robot handling includes the following steps:
[0035] Step 1. Determine the problem description of the distributed flow workshop with order and robot constraints, take minimizing the maximum completion time as the control goal, and establish a problem model according to the problem description;
[0036] Step 2. Use the improved iterative greedy algorithm (IIG) to solve the problem model of distributed flow shop optimization with constraints and robot constraints, and use the simulated annealing (SA) algorithm to jump out of the local optimal solution during the solving process to obtain the optimal solution plan.
[0037] The above steps are described in detail below:
[0038] 1. Problem description of distributed flow shop with order and robot constraints.
[0039] The Distributed Permutation-Flow Schedul...
Embodiment 2
[0126] This embodiment provides a distributed workshop scheduling optimization system with orders and robot handling, including:
[0127] Model building module: configured to determine the problem description of the distributed flow workshop with order and robot constraints, with the control goal of minimizing the maximum completion time, and building a problem model according to the problem description;
[0128] Solving module: configured to use the improved iterative greedy algorithm to solve the problem model of distributed flow shop optimization with constraints and robot constraints, and use the simulated annealing algorithm to jump out of the local optimal solution during the solving process to obtain the optimal solution .
Embodiment 3
[0130]This embodiment provides an electronic device, including a memory, a processor, and computer instructions stored in the memory and executed on the processor. When the computer instructions are executed by the processor, the steps described in the method in Embodiment 1 are completed.
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


