Hybrid heuristic shifting bottleneck procedure for solving parallel-machine job-shop scheduling

A hybrid heuristic, job shop technology, applied in computing, instrumentation, data processing applications, etc., can solve problems such as inexact solutions, increased search time, infeasible solutions, etc., to reduce computing time, accelerate significantly, and avoid searching Unstable results

Inactive Publication Date: 2017-05-03
SICHUAN YONGLIAN INFORMATION TECH CO LTD
View PDF0 Cites 13 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0008] The purpose of the present invention is then to overcome existing in the prior art: transfer bottleneck algorithm may cause infeasible solution; Search space will produce approximate solution, rather than exact solution; Along with the enlargement of problem scale, the problem that search time improves significantly

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
  • Hybrid heuristic shifting bottleneck procedure for solving parallel-machine job-shop scheduling
  • Hybrid heuristic shifting bottleneck procedure for solving parallel-machine job-shop scheduling
  • Hybrid heuristic shifting bottleneck procedure for solving parallel-machine job-shop scheduling

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0021] In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be described in detail below in conjunction with the accompanying drawings.

[0022] 1. JSP scheduling problem

[0023] JSP is a machine scheduling and optimization problem. Features of JSP: a finite set of N workpieces and M machines; each workpiece contains a process chain; each machine can process at most one process at a time; each process needs to be processed uninterruptedly on a given machine for a period of time; the goal is Find the scheduling scheme with the shortest total processing time.

[0024] The Disjunctive Graph (DG) model can be used to represent JSP, and an example of graph G={V, C∪D} is represented as figure 2 shown. Description of the DG model: there are n workpieces and m machines of the same type in the DG model; nodes are marked from 1 to N, and N represents the total number of processes in DG; arc (i, j) links node i a...

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 provides a hybrid heuristic shifting bottleneck procedure for solving parallel-machine job-shop scheduling. According to the procedure, a hybrid shifting bottleneck procedure is provided by combining a shifting bottleneck procedure and a heuristic tabu search method, and a GPU is further utilized to achieve a parallel tabu search algorithm. The hybrid shifting bottleneck procedure comprises the following solving processes of (1) decomposing a PDG of a parallel-machine job shop into a series of single-machine scheduling (SMS) sub-problems and parallel-machine scheduling (PMS) sub-problems; (2) solving each SMS sub-problem and PMS sub-problem; (3) determining and scheduling bottleneck machines; and (4) carrying out reordering and optimization on the current PDG during each iteration and rescheduling the scheduled bottleneck machines. According to the hybrid procedure, an unstable search result is avoided, an optimal solution can be found out and the calculation time of finding the optimal solution is shortened.

Description

[0001] Field [0002] The present invention relates to the field of computer-executed manufacturing systems, specifically to solve job shop problems through algorithms [0003] Combinatorial optimization problems for scheduling. Background technique [0004] Scheduling refers to assigning limited resources to tasks to optimize an objective function. In the field of scheduling, the Job-Shop Scheduling Problem (JSP) is considered to be one of the most difficult combinatorial optimization problems, and it is an important research topic in the fields of complex equipment manufacturing systems and flexible manufacturing systems. Addressing this issue is important because even a small improvement in efficiency can have significant financial payoffs. [0005] JSP is an NP-hard problem. The high complexity of JSP makes it difficult to find the optimal solution in a reasonable time in most cases. Many heuristic algorithms have been proposed to solve JSP, including algorithms based ...

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/06
CPCG06Q10/06316
Inventor 黄超杰胡成华
Owner SICHUAN YONGLIAN INFORMATION TECH CO LTD
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