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

A Batch Scheduling Method Based on Product Family Sorting to Realize Minimum Total Completion Time

A technology of completion time and product family, which is applied in the field of batch scheduling based on product family sorting to achieve the goal of minimum total completion time, can solve problems that affect the time complexity of batch scheduling algorithms, increase the scale of scheduling problems, and increase the difficulty of solving problems, etc. Achieve the effects of reducing time complexity, realizing convenience, and meeting production needs

Inactive Publication Date: 2015-11-11
ANHUI POLYTECHNIC UNIV
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, as the number of workpieces in the buffer in front of the batch machine continues to increase, the number of batches also increases accordingly, resulting in an increase in the scale of the scheduling problem with the goal of minimum total completion time, and an increase in the difficulty of solving the problem. The time complexity of the batch scheduling algorithm and the accuracy of the solution are affected by the longer solution time

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
  • A Batch Scheduling Method Based on Product Family Sorting to Realize Minimum Total Completion Time

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0018] Below in conjunction with accompanying drawing and embodiment the patent of the present invention is described further:

[0019] The batch scheduling method for realizing the minimum total completion time based on product family sorting provided by the present invention first takes different product families in the buffer in front of the re-entrant batch processor as the research objects, and then takes the workpieces in the product family with the highest priority as the research objects. The research object requires that the multi-product families processed on the batch processing equipment cannot be mixed into batches, and the products have different arrival times. Whenever the reentrant batch processing machine under study is idle and available, implement the minimum total completion time based on product family sorting The batch scheduling method of , completes the entire real-time scheduling specified by the rolling time-domain strategy.

[0020] refer to figure ...

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

Disclosed is a batch scheduling method achieving minimum total completion time based on product family sorting used for a reenterable production line. An objective function is a minimum total completion time of a scheduling batch, different product families of a buffering device in front of a reenterable batch processor are used as researching objects through model resolving, then workpieces of the product family with the highest priority are used as researching objects, the batch scheduling method achieving the minimum total completion time based on the product family sorting is implemented step by step by utilizing a product family weighting shortest processing time prior rule, a maximum reenterable time prior rule, a first-come first-service rule and a full batch rule, and implementation of all scheduling periodical tasks is achieved under a rolling time domain strategy. The batch scheduling method achieving the minimum total completion time based on the product family sorting does not need to implement group batch and batch sorting of workpieces of different product families under a regular situation, greatly lowers time complexity of an algorithm, can achieve real-time optimized scheduling of a reenterable batch processor by using an accurate algorithm, meet product requirement of achieving minimum total completion time of an semiconductor industry as a purpose, and is simple in concept, convenient to achieve, and capable of facilitating popularization usage of reenterable industries like semiconductors and the like.

Description

technical field [0001] The invention relates to batch machine scheduling of reentrant production lines, in particular to a batch scheduling method for reentrant production lines based on product family sorting to achieve minimum total completion time. Background technique [0002] The re-entrant production line (re-entrant) is a concept proposed by Professor Kumar of the United States in the late 1980s and early 1990s for the production characteristics of semiconductor chips, film and other industries, and listed it as different from assembly line ( The third type of reentrant production line for Flow-shop) and out-of-sequence jobs (Job-shop). The so-called re-entry means that when unfinished products are processed along the production line, they may be processed on the same worktable several times, and the state of the workpiece is different during each processing. Each product state is called a product family ( family) (Note: The concept of product family is different fro...

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 Patents(China)
IPC IPC(8): G06Q10/06
Inventor 贾文友刘莉赵雪松贾昊瑞刘涛
Owner ANHUI POLYTECHNIC UNIV
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