Workpiece scheduling method and device based on an ant colony algorithm

A scheduling method and technology of ant colony algorithm, which are applied in the field of workpiece scheduling method and device based on ant colony algorithm, can solve problems such as batch-processing scheduling problems, etc.

Active Publication Date: 2019-06-11
ANHUI UNIVERSITY
View PDF8 Cites 7 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] However, the existing ant colony optimization algorithm cannot deal with batch scheduling problems containing rejection conditions

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Workpiece scheduling method and device based on an ant colony algorithm
  • Workpiece scheduling method and device based on an ant colony algorithm
  • Workpiece scheduling method and device based on an ant colony algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0040] figure 1 A schematic flow diagram of an ant colony algorithm-based workpiece scheduling method provided by an embodiment of the present invention, as shown in figure 1 As shown, the method includes:

[0041] S101: In the current iteration, for the ants corresponding to the set of workpieces to be scheduled, according to the first initial pheromone matrix for the completion time and the second initial pheromone matrix for the rejection cost, create the artifacts corresponding to the ants Scheduling plan, and after the job scheduling plan of each ant is created, globally update the pheromone matrix corresponding to the completion time and the globally updated pheromone matrix corresponding to the rejection cost.

[0042] The technical problem to be solved in the embodiment of the present invention can be expressed as:

[0043] P m |p-batch,w j ,p,s j ,S i |(C max ,RC), where, P m is m parallel machines, and the processing machine is composed of parallel machines; ...

Embodiment 2

[0139] A kind of workpiece scheduling method based on ant colony algorithm according to claim 1, is characterized in that, described method also comprises:

[0140] According to the difference in weight and size between the first workpiece to be scheduled in the batch with the later processing start time and the second workpiece to be scheduled in the batch with the earlier processing start time, the first workpiece to be scheduled and the second workpiece to be scheduled are compared 2. The positions of the workpieces to be dispatched are exchanged.

[0141]Specifically, the weight of the first workpiece to be scheduled in the batch whose processing start time is later is the same as the weight of the second workpiece to be scheduled in the batch whose processing start time is earlier, and the size of the first workpiece to be scheduled is smaller than that of the second job to be scheduled The size of the workpiece, and the capacity of the batch whose processing start time i...

Embodiment 3

[0154] According to the weight difference between the first job to be scheduled in the batch with the later processing start time and the second job to be scheduled in the batch with the earlier processing start time, the first job to be scheduled and the second job to be scheduled are Change the position.

[0155] Specifically, the weight of the first workpiece to be scheduled in the batch whose processing start time is later may be greater than the weight of the second workpiece to be scheduled in the batch whose processing start time is earlier, and the processing start of the second workpiece to be scheduled is scheduled When the capacity of the batch at the later time does not exceed the capacity of the machine corresponding to the batch, and the capacity of the batch with the first processing start time scheduled for the first workpiece to be scheduled does not exceed the capacity of the machine corresponding to the batch, the A job to be scheduled is swapped with a seco...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a workpiece scheduling method and device based on an ant colony algorithm, and the method comprises the steps: 1), creating a workpiece scheduling scheme corresponding to antsfor the ants corresponding to a to-be-scheduled workpiece set in the current iteration; 2) judging whether the number of iterations corresponding to the current iteration reaches the maximum number ofiterations or not; 3) if yes, updating the non-dominated solution set to obtain a target non-dominated solution set, and taking a solution in the target non-dominated solution set as a target scheduling method; (4) if not, judging whether to carry out detection or not;, taking the globally updated pheromone matrix for the completion time as a first initial pheromone matrix of the next iteration;taking the globally updated pheromone matrix for the rejection cost as a second initial pheromone matrix of the next iteration, and returning to execute the step 1) until the number of iterations corresponding to the current iteration reaches the maximum number of iterations. By applying the method and the device, the batch processing scheduling problem containing the rejection condition can be processed.

Description

technical field [0001] The present invention relates to a workpiece scheduling method and device, more specifically to a workpiece scheduling method and device based on an ant colony algorithm. Background technique [0002] In daily production activities, the batch scheduling problem plays a very important role. As a typical combinatorial optimization problem, the batch scheduling problem has a wide range of application backgrounds, such as port cargo handling, logistics and transportation, and communication fields. The inspiration for studying the batch scheduling problem comes from the calcination stage of the semiconductor chip manufacturing process. In order to ensure the service life of the chip, the high temperature resistance of the semiconductor chip must be tested first. Since the number of furnaces used for high temperature testing is relatively small and the high temperature testing time is relatively long, Therefore, the manufacturer gave up the one-to-one quali...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06Q10/06G06N3/00
CPCY02P90/30
Inventor 贾兆红李亚杰
Owner ANHUI UNIVERSITY
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

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap