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

Scheduling method based on bottleneck procedure

A bottleneck process and product technology, applied in data processing applications, forecasting, instruments, etc., can solve the problem of manual production scheduling not being able to optimize production scheduling.

Active Publication Date: 2014-10-01
GOERTEK INC
View PDF2 Cites 9 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] In view of the above problems, the purpose of the present invention is to provide a production scheduling method based on the bottleneck process to solve the problem that manual production scheduling cannot optimize production scheduling

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
  • Scheduling method based on bottleneck procedure
  • Scheduling method based on bottleneck procedure
  • Scheduling method based on bottleneck procedure

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0048] Use the linear programming algorithm to establish a mathematical model for the long-term planning stage, figure 2 Shows the mathematical model established for the long-term planning phase using the linear programming algorithm according to an embodiment of the present invention, such as figure 2 As shown, the first part is the output of the bottleneck process, in figure 2 Including four production lines are A01, A05, A07, A08, production line A01 assembles two types of parts A and C, production line A05 assembles four types of parts B, W, C, T, production line A07 assembles A , B, W, C, D five types of parts, production line A08 assembles A, T two types of parts, the following four types of A, B, C, D parts are used as examples to illustrate, other types of parts the same way.

[0049] figure 2 The second part is the demand quantity of the product order, which is the quantity of each type of parts in the product order that needs to be assembled within a preset ti...

Embodiment 2

[0068] Since the orders of one month or one week will not change greatly, it can be used as the basis for accurate and all-process production scheduling, and the linear programming algorithm is used to establish a mathematical model for the short-term production scheduling stage. image 3 It shows the establishment of a mathematical model of the short-term production scheduling stage using a linear programming algorithm according to an embodiment of the present invention, such as image 3 As shown, the first part is the output of the bottleneck process of the daily product order, in image 3 Including four production lines are A01, A05, A07, A08, production line A01 assembles two types of parts A and C, production line A05 assembles four types of parts B, W, C, T, production line A07 assembles A , B, W, C, D five types of parts, production line A08 assembles A, T two types of parts, the following four types of A, B, C, D parts are used as examples to illustrate, other types of...

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 scheduling method based on a bottleneck procedure. The scheduling method includes the long-term programming stage and the short-term scheduling stage. The long-term programming stage includes the steps of establishing a mathematical model according to a linear programming algorithm with yield maximization of product orders during a first preset time period serving as the scheduling target and the current capacity serving as the resource, solving the scheduling amount of the bottleneck procedure of the product orders during the preset time period, and adding production lines if the product orders can not be completed according to the solved scheduling amount of the bottleneck procedure. The short-term scheduling stage includes the steps of establishing a mathematical model according to a linear programming algorithm with yield maximization of product orders during a second preset time period serving as the scheduling target and the current capacity and the current completion number serving as the resource, solving the scheduling amount of the bottleneck procedure of product orders in each day, and conducting scheduling on the product orders in each day according to the solved scheduling amount of the bottleneck procedure of the product orders in each day. By means of the scheduling method based on the bottleneck procedure, scheduling can be rapidly and accurately conducted on the product orders, and the manufacturing cycle of electronic products is shortened.

Description

technical field [0001] The present invention relates to the technical field of production scheduling for electronic product manufacturing, and more specifically, relates to a production scheduling method based on a bottleneck process. Background technique [0002] The production and assembly of electronic products with manual assembly as the bottleneck process is usually scheduled manually, and different companies have different assembly scales. For large production scales, the total number of assembly variables ranges from hundreds of thousands to millions. For the calculation of assembly variables of this scale, the production scheduler needs to get the calculation result within a few minutes, because the situation on site is ever-changing, and the calculation time is more than half an hour, it is not practical, and the manual production scheduling of the production scheduler often consumes It is impossible to obtain the calculation structure in a short time. [0003] For...

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/06G06Q50/04
CPCY02P90/30
Inventor 尹兆兵张广平宋永国
Owner GOERTEK INC
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