Hyper-heuristic algorithm based ZDT flow shop job scheduling method

A zero-idle pipeline and heuristic algorithm technology, applied in computing, instruments, data processing applications, etc., can solve problems such as low quality scheduling solutions, difficulty in obtaining optimal solutions, and inability to guarantee a single meta-heuristic algorithm. The effect of avoiding uncertainty and improving efficiency

Inactive Publication Date: 2016-07-27
ZHEJIANG UNIV OF FINANCE & ECONOMICS
View PDF3 Cites 17 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] (2) Heuristic algorithms, such as NEH method, Johnson heuristic rules, KK method, etc. The implementation of this type of algorithm is relatively simple, but the quality of the scheduling solution obtained is not high, and it is often difficult to obtain the optimal solution;
In fact,

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
  • Hyper-heuristic algorithm based ZDT flow shop job scheduling method
  • Hyper-heuristic algorithm based ZDT flow shop job scheduling method
  • Hyper-heuristic algorithm based ZDT flow shop job scheduling method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0036] In order to better understand the technical solutions and features of the present invention, the implementation of the present invention will be further described below in conjunction with the accompanying drawings.

[0037] First, it is necessary to set the objective function fit( ) of the job scheduling optimization problem in a zero-idle flow shop. Since the optimization objectives under different scheduling indicators are different, this embodiment takes the common minimum completion time (Makespan) as an example to illustrate . Given scheduling solution π={J 1 ,J 2 ,...,J n}, where J 1 ,J 2 ,...,J n For n workpieces to be operated, they need to pass through m machines in the zero-idle assembly line in sequence, that is, no idle time is allowed between adjacent workpieces processed on the machine. Set workpiece J i (i=1,2,…,n) on machine j (j=1,2,…,m) the processing time, start time and completion time are respectively P i,j , S i,j and C i,j . figure 1 T...

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 hyper-heuristic algorithm based ZDT (Zero Dead Time) flow shop job scheduling method. According to the invention, an objective function of a ZDT flow shop job scheduling problem is set firstly and a corresponding scheduling optimization model is established. On the above basis, a hyper-heuristic algorithm frame is combined, a harmony search algorithm applied widely is adopted as an HLH (High Level Heuristic) strategy of the hyper-heuristic algorithm, and a simple heuristic rule is designed aiming at the characteristics of the ZDT flow shop job scheduling problem for constructing an LLH (Low Level Heuristic) method set, so that the optimization solution of the ZDT flow shop job scheduling problem is realized. According to the invention, good global optimization performance of a meta-heuristic algorithm is remained and uncertainty caused by algorithm parameter adjustment depending on artificial experience in the meta-heuristic algorithm is avoided, so that the algorithm design efficiency is improved effectively and the method is significant to the improvement of flow shop job scheduling efficiency.

Description

technical field [0001] The invention belongs to the technical field of workshop job scheduling, and in particular relates to a zero-idle flow workshop job scheduling method based on a super-heuristic algorithm. Background technique [0002] As an important branch of production scheduling, Flow-shop Scheduling Problem (FSP) is an NP-hard complex combinatorial optimization problem in essence. The zero-idle flow shop job scheduling problem is a further extension of FSP, which requires that the machine does not idle during the production process, that is, no idle time is allowed between adjacent workpieces processed on the machine. For example, in the manufacturing process of glass fiber, the heating furnace needs to maintain a constant high temperature of 2800℉ in a production cycle. Due to the large amount of thermal inertia in the furnace, it takes several days to stop and start, and it takes a lot of time to use the equipment. Therefore, once it is running, it is not expect...

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/06G06Q50/02
CPCG06Q10/06311G06Q50/02
Inventor 林剑张帅黄朝耿
Owner ZHEJIANG UNIV OF FINANCE & ECONOMICS
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