Multi-jobshop scheduling method and apparatus

A job scheduling and workshop technology, applied in the computer field, can solve problems such as poor convergence ability, low feasibility, easy to fall into local optimum, etc.

Active Publication Date: 2017-06-20
SHENZHEN UNIV
View PDF4 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] The purpose of the present invention is to provide a method and device for multi-workshop job scheduling, aiming to solve the problems of poo

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
  • Multi-jobshop scheduling method and apparatus
  • Multi-jobshop scheduling method and apparatus
  • Multi-jobshop scheduling method and apparatus

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0028] figure 1 The implementation process of the multi-shop job scheduling method provided by Embodiment 1 of the present invention is shown. For the convenience of description, only the parts related to the embodiment of the present invention are shown, and the details are as follows:

[0029] In step S101, when a request for multi-job scheduling is received, a mathematical model of multi-job scheduling is established according to job parameters of multi-job scheduling.

[0030] In the embodiment of the present invention, when a request for multi-shop job scheduling is received, the job parameters of the multi-shop job are received for establishing a mathematical model of the multi-shop job scheduling. As an example, the operation parameters of a multi-workshop operation may include the number N of workpieces to be processed, and the number of processes n that each workpiece needs to go through. j , the number M of machines that can be used for processing, and the processin...

Embodiment 2

[0041] figure 2 The implementation flow of the multi-shop job scheduling method provided by the second embodiment of the present invention is shown. For the convenience of description, only the parts related to the embodiment of the present invention are shown, and the details are as follows:

[0042] In step S201, when a request for multi-job scheduling is received, a mathematical model of multi-job scheduling is established according to the job parameters of the multi-job scheduling.

[0043] In step S202, the crowding distance of the current non-dominated individuals in the current population is calculated, and according to the crowding distance of the current non-dominated individuals, individuals among the current non-dominated individuals whose crowding distance exceeds a preset value are selected to form the current active population.

[0044] In the embodiment of the present invention, the crowding distance of the current non-dominated individuals in the current popul...

Embodiment 3

[0060] image 3 The structure of the multi-shop job scheduling device provided by the third embodiment of the present invention is shown. For the convenience of description, only the parts related to the embodiment of the present invention are shown, including:

[0061] The model building module 31 is configured to establish a mathematical model of multi-shop job scheduling according to the job parameters of multi-shop job scheduling when receiving a request for multi-shop job scheduling.

[0062] In the embodiment of the present invention, when a request for multi-shop job scheduling is received, the model building module receives job parameters of the multi-shop job for establishing a mathematical model of the multi-shop job scheduling. As an example, the operation parameters of a multi-workshop operation may include the number N of workpieces to be processed, and the number of processes n that each workpiece needs to go through. j , the number M of machines that can be use...

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 is suitable for the technical field of a computer, and provides a multi-jobshop scheduling method and apparatus. The multi-jobshop scheduling method includes the steps: when receiving a request of multi-jobshop scheduling, establishing a mathematical model of multi-jobshop scheduling, and using a preset dynamic population strategy and a dual-mode difference evolution operator to perform evolution on the individuals in the current population of the mathematical model; and when the current evolution algebra of the current population does not satisfy a preset population evolution termination condition, setting the non-dominated individuals in the evolved current population as the current population of the next generation of mathematical model, repeatedly executing the step of evolving the individuals in the current population of the mathematical model until the current evolution algebra satisfies the population evolution termination condition, and then setting the non-dominated individuals in the evolved current population as the solution of a parameter to be solved in the mathematical model so as to obtain the solution of multi-jobshop scheduling, thus improving the convergence capability and robustness during the multi-jobshop scheduling process.

Description

technical field [0001] The invention belongs to the technical field of computers, and in particular relates to a multi-workshop job scheduling method and device. Background technique [0002] Multi-shop job scheduling is a typical non-deterministic polynomial (NP) problem. Mathematical programming methods such as integer programming method, mixed integer programming method and dynamic programming method can be used for multi-shop job scheduling, but the computational complexity of these mathematical programming methods is relatively high, which limits the application of these methods. In integer programming, the enumeration method and the Laplace relaxation method are the two most widely used methods. The main disadvantage of the enumeration method is: due to the existence of integer constraints, it takes a lot of time for larger scheduling problems, and the Laplace relaxation method The integer constraint is deleted and the corresponding cost is added. Although it can solv...

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
IPC IPC(8): G06Q10/04G06Q10/06G06N3/12
CPCG06N3/12G06Q10/04G06Q10/0631
Inventor 林秋镇王娜陈剑勇
Owner SHENZHEN UNIV
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