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

Three-stage flexible flow workshop scheduling method based on ST heuristic algorithm

A flexible flow shop and heuristic algorithm technology, applied in computing, manufacturing computing systems, comprehensive factory control, etc., can solve problems such as few researches on scheduling problems, and no research on flexible flow shop scheduling problems.

Inactive Publication Date: 2015-03-04
GUANGDONG UNIV OF TECH
View PDF0 Cites 7 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] Through the above analysis, it is found that most of the research on the FFS problem is limited to the two-stage flexible flow shop scheduling problem, and there are relatively few studies on the three-stage or multi-stage flexible flow shop scheduling problem, let alone found Research on the Three-Stage Flexible Flow Shop Scheduling Problem with Group Constraints

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
  • Three-stage flexible flow workshop scheduling method based on ST heuristic algorithm
  • Three-stage flexible flow workshop scheduling method based on ST heuristic algorithm
  • Three-stage flexible flow workshop scheduling method based on ST heuristic algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0051] Although the present invention has been described with reference to specific embodiments, those skilled in the art will be able to make obvious modifications and modifications to the present invention after reading the above description without departing from the intent and essence of the present invention. The present invention intends to include such modifications and modifications within the scope of the claims.

[0052] The invention proposes a three-stage flexible flow shop scheduling problem considering that the arrival time of the workpiece belt has medium group constraints, and each stage is composed of non-equal parallel machines. If some existing algorithms are used to solve the problem of the present invention, the solution effect may not be very good or even some algorithms are not suitable for solving this type of problem. Therefore, the main work of the present invention is to propose a rule-based heuristic scheduling algorithm to solve this type of proble...

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 a three-stage flexible flow workshop scheduling method based on an ST heuristic algorithm. The three-stage flexible flow workshop scheduling based on the ST heuristic algorithm comprises the following steps: step one, proposing a type of problem of the three-stage flexible flow workshop scheduling with groups of constraints and arrival of batches of workpieces in consideration, and describing the type of problem by a three-element group of Graham as a formula which is shown in the specification; step two, building an optimization model of the three-stage flexible flow workshop scheduling problem; step three, proposing an ST-idea-based heuristic algorithm; step four, designing a simulation experiment and carrying out simulation scheduling of the ST heuristic algorithm. The invention discloses a set of complete solution algorithm in order to solve the flexible flow workshop scheduling problem with groups of constraints; the three-stage flexible flow workshop scheduling problem with the groups of constraints is solved.

Description

technical field [0001] The invention relates to the field of flexible flow shop scheduling, in particular to a three-stage flexible flow shop scheduling method based on an ST heuristic algorithm. Background technique [0002] Flexible flow shop (FFS) scheduling problem is ubiquitous in offline manufacturing systems, and its research has important theoretical significance and engineering practical value. The classic flexible flow shop scheduling can be described as: there are s type processors, jth type has sj equivalent parallel machines, each workpiece has s processes, and each process needs to be processed on a processor in each type of equal parallel machines, And the processing sequence of each workpiece is the same. There have been many research results on the classic flexible flow shop scheduling problem. However, the classic flexible flow shop scheduling problem greatly simplifies the actual scheduling environment, for example, all workpieces arrive at zero time; ma...

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): G06F19/00G05B19/418G06Q50/04
CPCY02P90/02Y02P90/30
Inventor 杨海东黎展涛刘国胜张沙清郭建华
Owner GUANGDONG UNIV OF 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