Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

An Optimal Scheduling Method for Multi-type Cable Processing

A technology for optimizing scheduling and cables, applied in data processing applications, instruments, artificial life, etc., can solve problems such as finding accurate solutions, and achieve the effect of improving the quality of speed and solution and increasing the diversity of individuals

Active Publication Date: 2022-02-08
KUNMING UNIV OF SCI & TECH
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The pipeline problem is a typical NP-hard problem, that is, its exact solution cannot be found in polynomial time

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
  • An Optimal Scheduling Method for Multi-type Cable Processing
  • An Optimal Scheduling Method for Multi-type Cable Processing
  • An Optimal Scheduling Method for Multi-type Cable Processing

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0049] Embodiment 1: as Figure 1-2 As shown, an optimal scheduling method for multi-type cable processing, the scheduling model and optimization objective are determined by determining the cable processing sequence, and the optimization objective is optimized using the cuckoo algorithm; the scheduling model is based on the maximum completion time and carbon emissions. OK, the optimization objective is the maximum completion time C max and carbon emissions TCE:

[0050]

[0051]

[0052]

[0053]

[0054] C max =C(j n ,m) (5)

[0055]

[0056] Where: n∈Z + , represents the scale of the problem, understood as the type of cable; m represents the number of machines; s represents the processing speed of the machine, j i Indicates the workpiece at the i-th position in the workpiece sorting, Indicates the standard processing time of the workpiece at position i on machine k; Indicates the processing speed of the workpiece at the i-th position on the machine k;...

Embodiment 2

[0069] Embodiment 2: as Figure 1-2 As shown, an optimal scheduling method for multi-type cable processing. A factory received a batch of processing orders for 10 different specifications of cables with the same length. The processing of each cable includes monofilament drawing, monofilament annealing, and conductor stranding. , insulation extrusion and cabling are 5 steps, these 5 steps correspond to processing on 5 different machines, so the scale of the problem can be expressed as 10_5. The processing parameters of the five steps of each cable are shown in Table 1. The data in Table 1 represent the time required for each cable in each processing step, that is, in the formula The data in Table 2 represent the speed of each machine when processing different cables, that is, in the formula There are 3 processing speeds for 5 machines this time. The data in Table 3 represent the energy consumption of each machine at different speeds, that is, PP in the formula k,v .

[00...

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 relates to an optimal scheduling method for multi-type cable processing, and belongs to the technical field of intelligent optimal scheduling of production workshops. The scheduling model is determined by determining the processing sequence of various cables, and the multi-objective optimization of the model is carried out by using the cuckoo algorithm. The scheduling model is a replacement assembly line workshop scheduling model. Using the cuckoo algorithm to obtain the optimal production sequence of multiple types of cables, while optimizing the maximum completion time and carbon emissions of cable production, this is a green dual-objective pipeline scheduling problem. The invention adopts the improved cuckoo algorithm to solve the dispatching model, and its objective function is: maximum completion time and carbon emission. Using the cuckoo algorithm to update iterations, optimize the modeling of the problem, and solve the cuckoo algorithm, the excellent solution for the production and processing of multiple types of cables can be obtained in a relatively short period of time.

Description

technical field [0001] The invention relates to an optimal scheduling method for multi-type cable processing, and belongs to the technical field of intelligent optimal scheduling of production workshops. Background technique [0002] The manufacture of wire and cable is completely different from the production of most electromechanical products. Electromechanical products are usually assembled from parts into parts, and multiple parts are assembled into a single product, and the products are measured by the number of units or pieces. Wire and cable are based on length as the basic unit of measurement. All wires and cables start from conductor processing, and then add insulation, shielding, cabling, sheathing, etc. layer by layer on the periphery of the conductor to make wire and cable products. The more complex the product structure, the more layers are superimposed. The production steps of the preformed cable are divided into: monofilament drawing, monofilament annealing...

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 Patents(China)
IPC IPC(8): G06Q50/04G06Q10/06G06N3/00
CPCG06N3/006G06Q10/0631G06Q50/04Y02P90/30
Inventor 钟祾充钱斌
Owner KUNMING UNIV OF SCI & TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com