CN118313602A - An optimization method for placing orders on a multi-variety production line considering priority processing of urgent parts - Google Patents
An optimization method for placing orders on a multi-variety production line considering priority processing of urgent parts Download PDFInfo
- Publication number
- CN118313602A CN118313602A CN202410425205.8A CN202410425205A CN118313602A CN 118313602 A CN118313602 A CN 118313602A CN 202410425205 A CN202410425205 A CN 202410425205A CN 118313602 A CN118313602 A CN 118313602A
- Authority
- CN
- China
- Prior art keywords
- product
- type
- workstation
- period
- time
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06315—Needs-based resource requirements planning or analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06316—Sequencing of tasks or work
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0201—Market modelling; Market analysis; Collecting market data
- G06Q30/0206—Price or cost determination based on market factors
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/04—Manufacturing
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Theoretical Computer Science (AREA)
- Marketing (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Game Theory and Decision Science (AREA)
- Tourism & Hospitality (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Educational Administration (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Data Mining & Analysis (AREA)
- Health & Medical Sciences (AREA)
- Manufacturing & Machinery (AREA)
- Primary Health Care (AREA)
- General Health & Medical Sciences (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Multi-Process Working Machines And Systems (AREA)
- General Factory Administration (AREA)
Abstract
Description
技术领域Technical Field
本发明涉及多品种生产线技术领域,尤其涉及一种考虑紧急件优先加工的多品种生产线订单投放优化方法。The present invention relates to the technical field of multi-variety production lines, and in particular to a method for optimizing order placement of multi-variety production lines by taking into account priority processing of urgent parts.
背景技术Background technique
为适应产品多样化的生产加工需求,即为了能够使得生产线系统能够实现多种类型产品在生产线上进行混合生产加工,多品种生产线应运而生。In order to adapt to the diversified production and processing needs of products, that is, to enable the production line system to realize mixed production and processing of various types of products on the production line, multi-variety production lines came into being.
对于多瓶中生产线系统而言,其设置有多个工作站,每一个工作站至少包含一个生产加工设备,不同类型的产品根据其工艺路径不同而选择不同工作站或者不同设备进行加工。For a multi-bottle production line system, it is provided with multiple workstations, each of which includes at least one production and processing equipment. Different types of products are processed at different workstations or with different equipment according to their different process paths.
对于多品种生产线而言,当部分工作站有紧急件到达,因此这些工作站上加工的产品存在优先级区分,紧急件具有高优先级,产线中原本生产的产品具有低优先级。For multi-variety production lines, when urgent parts arrive at some workstations, the products processed at these workstations are prioritized. Urgent parts have high priority, and the products originally produced in the production line have low priority.
在考虑紧急件优先加工的情况,如何对多品种生产线订单投放进行优化就显得尤为重要。Considering the priority processing of urgent parts, it is particularly important to optimize the order placement of multi-variety production lines.
发明内容Summary of the invention
本发明的目的在于提供一种考虑紧急件优先加工的多品种生产线订单投放优化方法,该考虑紧急件优先加工的多品种生产线订单投放优化方法能够在考虑有紧急件到达工作站的情况下计算最小化在制品成本、库存成本与延期交付成本之和,并通过遍历不同到达率λ下所对应的最小化在制品成本、库存成本与延期交付成本之和来选择最优解,以找到多品种生产线订单投放问题的最优投放方案。The purpose of the present invention is to provide a method for optimizing the placement of orders for a multi-variety production line taking into account the priority processing of urgent parts. The method for optimizing the placement of orders for a multi-variety production line taking into account the priority processing of urgent parts can calculate the minimized sum of work-in-process cost, inventory cost and delayed delivery cost under the consideration of the arrival of urgent parts at the workstation, and select the optimal solution by traversing the minimized sum of work-in-process cost, inventory cost and delayed delivery cost corresponding to different arrival rates λ, so as to find the optimal placement plan for the multi-variety production line order placement problem.
为达到上述目的,本发明通过以下技术方案来实现。To achieve the above object, the present invention is implemented through the following technical solutions.
一种考虑紧急件优先加工的多品种生产线订单投放优化方法,包括有以下步骤,具体的:A multi-variety production line order placement optimization method considering priority processing of urgent parts includes the following steps, specifically:
步骤S1、计算特定到达率λ下工作站m加工类型k的产品的利用率ρk,m,p:Step S1: Calculate the utilization rate ρ k,m,p of products of type k processed at workstation m under a specific arrival rate λ:
λ0,m(k,p)表示周期p内类型k的产品在工作站m上的原材料到达率,λn,m(k,p)表示周期p内类型k的产品在工作站m上的半成品重入到达率,μm表示工作站m的服务率;λ 0,m (k,p) represents the raw material arrival rate of product type k at workstation m in period p, λ n,m (k,p) represents the semi-finished product re-entry arrival rate of product type k at workstation m in period p, and μ m represents the service rate of workstation m;
Mk,l表示类型k的产品的第l道工序对应的工作站,在周期p内类型k的产品对应的原材料到达工作站m的到达率λ0,m(k,p)=xk,p·[Mk,1=m];M k,l represents the workstation corresponding to the lth process of product type k, and the arrival rate of raw materials corresponding to product type k at workstation m in period p is λ 0,m (k,p) = x k,p ·[M k,1 = m];
在周期p内类型k的产品对应的半成品到达工作站m的到达率 The arrival rate of semi-finished products corresponding to product type k at workstation m in period p
其中,k表示产品类型,p表示计划周期,m表示工作站类型,K表示多品种生产线所加工的产品类型数量,Lk标识产品类型k的工序数量,l表示工序编号,l∈{1,2,…,Lk};xk,p表示在计划周期p内产品类型k的原材料投放数量,xk,p为决策变量;Where k represents the product type, p represents the planning period, m represents the workstation type, K represents the number of product types processed by the multi-variety production line, L k represents the number of processes for product type k, l represents the process number, l∈{1,2,…,L k }; x k,p represents the amount of raw materials put into product type k in the planning period p, and x k,p is a decision variable;
步骤S2、由于多产品生产线中的排队系统的到达过程与服务时间服从一般分布,考虑紧急件优先加工规则并使用GI/G/1的排队模型对每个工作站进行建模,并求得在排队系统上的等待时间的期望为E(W);Step S2: Since the arrival process and service time of the queuing system in the multi-product production line follow a general distribution, the priority processing rule of urgent parts is considered and the GI/G/1 queuing model is used to model each workstation, and the expectation of the waiting time in the queuing system is obtained as E(W);
步骤S3、计算特定到达率λ下周期p内类型k的产品在工作站m上的总等待时间Zk,m,p:Step S3: Calculate the total waiting time Z k,m,p of products of type k at workstation m within period p under a specific arrival rate λ:
周期p内类型k的产品在工作站m上的总等待时间Zk,m,p包含以下三部分:从该产品到达到工作站m出现至少一个空闲资源的时间τk,m,p、等待队列中排在该产品之前的所有紧急件的加工时间σk,m,p、该产品在等待过程中新到达的紧急件的加工时间δk,m,p;The total waiting time Z k,m,p of a product of type k at workstation m in period p consists of the following three parts: the time τ k,m,p from the arrival of the product to the appearance of at least one idle resource at workstation m, the processing time σ k,m,p of all urgent parts in the waiting queue before the product, and the processing time δ k,m,p of the newly arrived urgent parts of the product during the waiting process;
Zk,m,p=τk,m,p+σk,m,p+δk,m,p;Z k,m,p =τ k,m,p +σ k,m,p +δ k,m,p ;
σk,m,p=Tm·E(W)·λout,m,p;σ k,m,p =T m ·E(W)·λ out,m,p ;
δk,m,p=Tm·Zk,m,p·λout,m,p;δ k,m,p =T m ·Z k,m,p ·λ out,m,p ;
其中,μm=1/Tm,λout,m,p表示周期p内需工作站m加工的紧急件的到达率,表示产品到达工作站m的到达间隔时间服从的一般分布对应的平方变异系数,工作站m的服务时间服从的一般分布对应的平方变异系数;Where, μ m = 1/T m , λ out,m,p represents the arrival rate of urgent parts to be processed at workstation m within period p, The squared coefficient of variation corresponding to the general distribution of the arrival interval of the product at workstation m is represented by: The squared coefficient of variation corresponding to the general distribution of the service time of workstation m;
步骤S4、计算特定到达率λ下在周期p投放到第l道工序的类型为k的产品直到完成该工序所需的时间f(k,p,l)、以及类型k的产品的总加工周期时间F(k,p,Lk):Step S4, calculate the time f(k,p,l) required for a product of type k to be put into the lth process in cycle p until the process is completed, and the total processing cycle time F(k,p, Lk ) of the product of type k under a specific arrival rate λ:
类型k的产品的工序l由工作站m加工,记为Mk,l=m;对于类型k的产品的任一工序l∈{1,…,Lk},产品在对应工作站Mk,l上的逗留时间由加工时间和等待时间组成,故 Process l of type k product is processed by workstation m, denoted as M k,l = m; for any process l∈{1,…,L k } of type k product, the product stay time at the corresponding workstation M k,l is given by the processing time and waiting time Composition, therefore
其中,加工时间为已知;Among them, processing time is known;
步骤S5、基于在周期p投放到第l道工序的类型为k的产品直到完成该工序所需的时间f(k,p,l)、以及类型k的产品的总加工周期时间F(k,p,Lk),计算特定到达率λ下在计划周期p内产品类型k的产出数量yk,p;Step S5, based on the time f(k,p,l) required for the product of type k to be put into the lth process in period p until the process is completed, and the total processing cycle time F(k,p,L k ) of the product of type k, calculate the output quantity y k,p of the product type k in the planned period p under the specific arrival rate λ;
步骤S6、计算特定到达率λ下在计划周期p结束时系统内产品类型k的在制品量wk,p、在计划周期p结束时系统内产品类型k的库存量hk,p、在计划周期p结束时系统内产品类型k的延迟交付数量bk,p:Step S6: Calculate the work-in-progress quantity wk ,p of product type k in the system at the end of planning period p, the inventory quantity hk ,p of product type k in the system at the end of planning period p, and the delayed delivery quantity bk ,p of product type k in the system at the end of planning period p under a specific arrival rate λ:
其中,Dk,p表示计划周期p内的产品类型k的需求,于多品种生产线中Dk,p为已知;Where D k,p represents the demand for product type k in planning period p. In a multi-variety production line, D k,p is known.
步骤S7、计算特定到达率λ下最小化在制品成本、库存成本与延期交付成本之和,最小化在制品成本、库存成本与延期交付成本之和为目标函数,该目标函数表示为:Step S7: Calculate the sum of the work-in-process cost, inventory cost and delayed delivery cost minimized under a specific arrival rate λ. Minimizing the sum of the work-in-process cost, inventory cost and delayed delivery cost is the objective function, which is expressed as:
其中,Wk表示产品类型k所对应的单位在制品成本,Hk表示产品类型k所对应的单位库存成本,Bk表示产品类型k所对应的单位延期交付成本;Among them, W k represents the unit work-in-process cost corresponding to product type k, H k represents the unit inventory cost corresponding to product type k, and B k represents the unit delayed delivery cost corresponding to product type k;
步骤S8、遍历不同到达率λ下所对应的最小化在制品成本、库存成本与延期交付成本之和,通过对比总成本结果并选择最优解。Step S8: traverse the minimum sum of work-in-process cost, inventory cost and delayed delivery cost corresponding to different arrival rates λ, compare the total cost results and select the optimal solution.
其中,在该多品种生产线中,产品工艺路径、可加工设备及加工时间已知且确定。Among them, in this multi-variety production line, the product process path, processable equipment and processing time are known and determined.
其中,在该多品种生产线中,每个工作站内至少包含一个设备,按先到先服务规则进行加工,一个设备同时只能加工一个产品。Among them, in this multi-variety production line, each workstation contains at least one device, and processing is carried out on a first-come, first-served basis. One device can only process one product at a time.
本发明的有益效果为:本发明所述的一种考虑紧急件优先加工的多品种生产线订单投放优化方法,其包括有以下步骤:步骤S1、计算特定到达率λ下工作站m加工类型k的产品的利用率ρk,m,p;步骤S2、考虑紧急件优先加工规则,由于多产品生产线中的排队系统的到达过程与服务时间服从一般分布,即使用GI/G/1的排队模型对每个工作站进行建模,并求得在排队系统上的等待时间的期望为E(W);步骤S3、计算特定到达率λ下周期p内类型k的产品在工作站m上的总等待时间Zk,m,p;步骤S4、计算特定到达率λ下在周期p投放到第l道工序的类型为k的产品直到完成该工序所需的时间f(k,p,l)、以及类型k的产品的总加工周期时间F(k,p,Lk);步骤S5、基于在周期p投放到第l道工序的类型为k的产品直到完成该工序所需的时间f(k,p,l)、以及类型k的产品的总加工周期时间F(k,p,Lk),计算特定到达率λ下在计划周期p内产品类型k的产出数量yk,p;步骤S6、计算特定到达率λ下在计划周期p结束时系统内产品类型k的在制品量wk,p、在计划周期p结束时系统内产品类型k的库存量hk,p、在计划周期p结束时系统内产品类型k的延迟交付数量bk,p:步骤S7、计算特定到达率λ下最小化在制品成本、库存成本与延期交付成本之和;步骤S8、遍历不同到达率λ下所对应的最小化在制品成本、库存成本与延期交付成本之和,通过对比总成本结果并选择最优解。通过上述步骤,本发明能够在考虑有紧急件到达工作站的情况下计算最小化在制品成本、库存成本与延期交付成本之和,并通过遍历不同到达率λ下所对应的最小化在制品成本、库存成本与延期交付成本之和来选择最优解,以找到多品种生产线订单投放问题的最优投放方案。The beneficial effects of the present invention are as follows: the method for optimizing the order placement of a multi-variety production line considering the priority processing of urgent parts described in the present invention comprises the following steps: step S1, calculating the utilization rate ρ k,m,p of the product of type k processed by workstation m under a specific arrival rate λ; step S2, considering the priority processing rule of urgent parts, since the arrival process and service time of the queuing system in the multi-product production line obey the general distribution, that is, using the GI/G/1 queuing model to model each workstation, and obtaining the expectation of the waiting time on the queuing system as E(W); step S3, calculating the total waiting time Z k,m,p of the product of type k on workstation m in period p under the specific arrival rate λ; step S4, calculating the time f(k,p,l) required for the product of type k to be placed in the lth process in period p under the specific arrival rate λ until the process is completed, and the total processing cycle time F(k,p,L k) of the product of type k ); step S5, based on the time f(k,p,l) required for the product of type k to be put into the lth process in cycle p and the total processing cycle time F(k,p, Lk ) of the product of type k, calculate the output quantity yk ,p of product type k in the planning cycle p under a specific arrival rate λ; step S6, calculate the work-in-process quantity wk,p of product type k in the system at the end of the planning cycle p, the inventory quantity hk ,p of product type k in the system at the end of the planning cycle p, and the delayed delivery quantity bk , p of product type k in the system at the end of the planning cycle p under a specific arrival rate λ: step S7, calculate the minimum sum of work-in-process cost, inventory cost and delayed delivery cost under a specific arrival rate λ; step S8, traverse the minimum sum of work-in-process cost, inventory cost and delayed delivery cost corresponding to different arrival rates λ, and select the optimal solution by comparing the total cost results. Through the above steps, the present invention can calculate the minimized sum of work-in-process cost, inventory cost and delayed delivery cost while considering the arrival of urgent parts at the workstation, and select the optimal solution by traversing the minimized sum of work-in-process cost, inventory cost and delayed delivery cost corresponding to different arrival rates λ, so as to find the optimal delivery plan for the multi-variety production line order delivery problem.
附图说明BRIEF DESCRIPTION OF THE DRAWINGS
下面利用附图来对本发明进行进一步的说明,但是附图中的实施例不构成对本发明的任何限制。The present invention is further described below with the aid of the accompanying drawings. However, the embodiments in the accompanying drawings do not constitute any limitation to the present invention.
图1为多品种生产线的生产订单投放示意图。Figure 1 is a schematic diagram of the production order placement for a multi-variety production line.
图2为类型为k的产品的第l道工序的投放与产出关系示意图。Figure 2 is a schematic diagram of the relationship between input and output of the lth process for products of type k.
图3为第p周期产品的投放与产出关系示意图。Figure 3 is a schematic diagram of the relationship between the release and output of products in the pth cycle.
具体实施方式Detailed ways
下面结合具体的实施方式来对本发明进行说明。The present invention is described below in conjunction with specific implementation methods.
一种考虑紧急件优先加工的多品种生产线订单投放优化方法,在该多品种生产线中,产品工艺路径、可加工设备及加工时间已知且确定,且每个工作站内至少包含一个设备,按先到先服务规则进行加工,一个设备同时只能加工一个产品;该多品种生产线的生产订单投放过程如图1所示;An optimization method for placing orders on a multi-variety production line considering priority processing of urgent parts. In the multi-variety production line, the product process path, processable equipment and processing time are known and determined, and each workstation contains at least one equipment, which is processed according to the first-come-first-served rule. One equipment can only process one product at a time. The production order placement process of the multi-variety production line is shown in Figure 1.
具体的,该考虑紧急件优先加工的多品种生产线订单投放优化方法包括有以下步骤,具体的:Specifically, the multi-variety production line order placement optimization method considering the priority processing of urgent parts includes the following steps, specifically:
步骤S1、计算特定到达率λ下工作站m加工类型k的产品的利用率ρk,m,p:Step S1: Calculate the utilization rate ρ k,m,p of products of type k processed at workstation m under a specific arrival rate λ:
λ0,m(k,p)表示周期p内类型k的产品在工作站m上的原材料到达率,λn,m(k,p)表示周期p内类型k的产品在工作站m上的半成品重入到达率,μm表示工作站m的服务率;λ 0,m (k,p) represents the raw material arrival rate of product type k at workstation m in period p, λ n,m (k,p) represents the semi-finished product re-entry arrival rate of product type k at workstation m in period p, and μ m represents the service rate of workstation m;
Mk,l表示类型k的产品的第l道工序对应的工作站,在周期p内类型k的产品对应的原材料到达工作站m的到达率λ0,m(k,p)=xk,p·[Mk,1=m];M k,l represents the workstation corresponding to the lth process of product type k, and the arrival rate of raw materials corresponding to product type k at workstation m in period p is λ 0,m (k,p) = x k,p ·[M k,1 = m];
在周期p内类型k的产品对应的半成品到达工作站m的到达率 The arrival rate of semi-finished products corresponding to product type k at workstation m in period p
其中,k表示产品类型,p表示计划周期,m表示工作站类型,K表示多品种生产线所加工的产品类型数量,Lk标识产品类型k的工序数量,l表示工序编号,l∈{1,2,…,Lk};xk,p表示在计划周期p内产品类型k的原材料投放数量,xk,p为决策变量;Where k represents the product type, p represents the planning period, m represents the workstation type, K represents the number of product types processed by the multi-variety production line, L k represents the number of processes for product type k, l represents the process number, l∈{1,2,…,L k }; x k,p represents the amount of raw materials put into product type k in the planning period p, and x k,p is a decision variable;
步骤S2、由于多产品生产线中的排队系统的到达过程与服务时间服从一般分布,考虑紧急件优先加工规则并使用GI/G/1的排队模型对每个工作站进行建模,并求得在排队系统上的等待时间的期望为E(W);Step S2: Since the arrival process and service time of the queuing system in the multi-product production line follow a general distribution, the priority processing rule of urgent parts is considered and the GI/G/1 queuing model is used to model each workstation, and the expectation of the waiting time in the queuing system is obtained as E(W);
步骤S3、计算特定到达率λ下周期p内类型k的产品在工作站m上的总等待时间Zk,m,p:Step S3: Calculate the total waiting time Z k,m,p of products of type k at workstation m within period p under a specific arrival rate λ:
周期p内类型k的产品在工作站m上的总等待时间Zk,m,p包含以下三部分:从该产品到达到工作站m出现至少一个空闲资源的时间τk,m,p、等待队列中排在该产品之前的所有紧急件的加工时间σk,m,p、该产品在等待过程中新到达的紧急件的加工时间δk,m,p;The total waiting time Z k,m,p of a product of type k at workstation m in period p consists of the following three parts: the time τ k,m,p from the arrival of the product to the appearance of at least one idle resource at workstation m, the processing time σ k,m,p of all urgent parts in the waiting queue before the product, and the processing time δ k,m,p of the newly arrived urgent parts of the product during the waiting process;
Zk,m,p=τk,m,p+σk,m,p+δk,m,p;Z k,m,p =τ k,m,p +σ k,m,p +δ k,m,p ;
σk,m,p=Tm·E(W)·λout,m,p;σ k,m,p =T m ·E(W)·λ out,m,p ;
δk,m,p=Tm·Zk,m,p·λout,m,p;δ k,m,p =T m ·Z k,m,p ·λ out,m,p ;
其中,μm=1/Tm,λout,m,p表示周期p内需工作站m加工的紧急件的到达率,表示产品到达工作站m的到达间隔时间服从的一般分布对应的平方变异系数,工作站m的服务时间服从的一般分布对应的平方变异系数;Where, μ m = 1/T m , λ out,m,p represents the arrival rate of urgent parts to be processed at workstation m within period p, The squared coefficient of variation corresponding to the general distribution of the arrival interval of the product at workstation m is represented by: The squared coefficient of variation corresponding to the general distribution of the service time of workstation m;
步骤S4、计算特定到达率λ下在周期p投放到第l道工序的类型为k的产品直到完成该工序所需的时间f(k,p,l)、以及类型k的产品的总加工周期时间F(k,p,Lk):Step S4: Calculate the time f(k,p,l) required for a product of type k to be put into the lth process in cycle p until the process is completed, and the total processing cycle time F(k,p, Lk ) of the product of type k under a specific arrival rate λ:
类型k的产品的工序l由工作站m加工,记为Mk,l=m;对于类型k的产品的任一工序l∈{1,…,Lk},产品在对应工作站Mk,l上的逗留时间由加工时间和等待时间组成,故 Process l of type k product is processed by workstation m, denoted as M k,l = m; for any process l∈{1,…,L k } of type k product, the product stay time at the corresponding workstation M k,l is given by the processing time and waiting time Composition, therefore
其中,加工时间为已知;Among them, processing time is known;
步骤S5、基于在周期p投放到第l道工序的类型为k的产品直到完成该工序所需的时间f(k,p,l)、以及类型k的产品的总加工周期时间F(k,p,Lk),计算特定到达率λ下在计划周期p内产品类型k的产出数量yk,p;Step S5, based on the time f(k,p,l) required for the product of type k to be put into the lth process in period p until the process is completed, and the total processing cycle time F(k,p,L k ) of the product of type k, calculate the output quantity y k,p of the product type k in the planned period p under the specific arrival rate λ;
步骤S6、计算特定到达率λ下在计划周期p结束时系统内产品类型k的在制品量wk,p、在计划周期p结束时系统内产品类型k的库存量hk,p、在计划周期[结束时系统内产品类型k的延迟交付数量bk,p:Step S6: Calculate the WIP quantity wk,p of product type k in the system at the end of planning period p, the inventory quantity hk ,p of product type k in the system at the end of planning period p, and the delayed delivery quantity bk ,p of product type k in the system at the end of planning period [ under a specific arrival rate λ:
其中,Dk,[表示计划周期[内的产品类型k的需求,于多品种生产线中Dk,p为已知;Where D k,[ represents the demand for product type k within the planning period [, and D k,p is known in a multi-variety production line;
步骤S7、计算特定到达率λ下最小化在制品成本、库存成本与延期交付成本之和,最小化在制品成本、库存成本与延期交付成本之和为目标函数,该目标函数表示为:Step S7: Calculate the sum of the work-in-process cost, inventory cost and delayed delivery cost minimized under a specific arrival rate λ. Minimizing the sum of the work-in-process cost, inventory cost and delayed delivery cost is the objective function, which is expressed as:
其中,Wk表示产品类型k所对应的单位在制品成本,Hk表示产品类型k所对应的单位库存成本,Bk表示产品类型k所对应的单位延期交付成本;Among them, W k represents the unit work-in-process cost corresponding to product type k, H k represents the unit inventory cost corresponding to product type k, and B k represents the unit delayed delivery cost corresponding to product type k;
步骤S8、遍历不同到达率λ下所对应的最小化在制品成本、库存成本与延期交付成本之和,通过对比总成本结果并选择最优解。Step S8: traverse the minimum sum of work-in-process cost, inventory cost and delayed delivery cost corresponding to different arrival rates λ, compare the total cost results and select the optimal solution.
通过上述步骤,本发明的考虑紧急件优先加工的多品种生产线订单投放优化方法能够在考虑有紧急件到达工作站的情况下计算最小化在制品成本、库存成本与延期交付成本之和,并通过遍历不同到达率λ下所对应的最小化在制品成本、库存成本与延期交付成本之和来选择最优解,以找到多品种生产线订单投放问题的最优投放方案。Through the above steps, the multi-variety production line order placement optimization method considering the priority processing of urgent parts of the present invention can calculate the minimized sum of work-in-process cost, inventory cost and delayed delivery cost when considering the arrival of urgent parts at the workstation, and select the optimal solution by traversing the minimized sum of work-in-process cost, inventory cost and delayed delivery cost corresponding to different arrival rates λ, so as to find the optimal placement plan for the multi-variety production line order placement problem.
以上内容仅为本发明的较佳实施例,对于本领域的普通技术人员,依据本发明的思想,在具体实施方式及应用范围上均会有改变之处,本说明书内容不应理解为对本发明的限制。The above contents are only preferred embodiments of the present invention. For ordinary technicians in this field, according to the concept of the present invention, there will be changes in the specific implementation methods and application scopes. The content of this specification should not be understood as limiting the present invention.
Claims (3)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202410425205.8A CN118313602A (en) | 2024-04-10 | 2024-04-10 | An optimization method for placing orders on a multi-variety production line considering priority processing of urgent parts |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202410425205.8A CN118313602A (en) | 2024-04-10 | 2024-04-10 | An optimization method for placing orders on a multi-variety production line considering priority processing of urgent parts |
Publications (1)
Publication Number | Publication Date |
---|---|
CN118313602A true CN118313602A (en) | 2024-07-09 |
Family
ID=91733100
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202410425205.8A Pending CN118313602A (en) | 2024-04-10 | 2024-04-10 | An optimization method for placing orders on a multi-variety production line considering priority processing of urgent parts |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN118313602A (en) |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1230267A (en) * | 1996-08-15 | 1999-09-29 | 伊利诺伊大学董事会 | Scheduling system and scheduling method for re-entrant line processing |
US20050234579A1 (en) * | 2004-01-23 | 2005-10-20 | Jakob Asmundsson | Tractable nonlinear capability models for production planning |
CN114707748A (en) * | 2022-04-20 | 2022-07-05 | 江苏大学 | An intelligent production scheduling method for mixed abortion lines based on herd immunity-genetic algorithm |
-
2024
- 2024-04-10 CN CN202410425205.8A patent/CN118313602A/en active Pending
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1230267A (en) * | 1996-08-15 | 1999-09-29 | 伊利诺伊大学董事会 | Scheduling system and scheduling method for re-entrant line processing |
US20050234579A1 (en) * | 2004-01-23 | 2005-10-20 | Jakob Asmundsson | Tractable nonlinear capability models for production planning |
CN114707748A (en) * | 2022-04-20 | 2022-07-05 | 江苏大学 | An intelligent production scheduling method for mixed abortion lines based on herd immunity-genetic algorithm |
Non-Patent Citations (2)
Title |
---|
XIAOHUI YAN: "Supply Chain Scheduling Using Double Deep Time-Series Differential Neural Network", 5 TH INTERNATIONAL WORKSHOP ON ADVANCES IN ENERGY SCIENCE AND ENVIRONMENT ENGINEERING, 12 May 2021 (2021-05-12) * |
刘焰峰: "基于负荷与卡片的 Job-shop生产控制系统研究", 中国硕士学位论文全文数据库 (信息科技辑), 15 July 2012 (2012-07-15) * |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN103439886B (en) | A kind of semiconductor production line self-adaptation dynamic scheduler | |
CN111191846B (en) | A cylinder product scheduling optimization device for complex customization needs of customers | |
Sarin et al. | A survey of dispatching rules for operational control in wafer fabrication | |
US20080195241A1 (en) | Method and system for wafer lot order | |
CN105302078A (en) | System and method for controlling furnace machine platform operation in semiconductor device manufacture technology | |
CN111522303A (en) | Planned scheduling method and equipment | |
Singh et al. | Experimental investigation for performance assessment of scheduling policies in semiconductor wafer fabrication—a simulation approach | |
CN113031542A (en) | Semiconductor production line dynamic scheduling method based on load balancing | |
CN118313602A (en) | An optimization method for placing orders on a multi-variety production line considering priority processing of urgent parts | |
Wang et al. | A lot dispatching strategy integrating WIP management and wafer start control | |
US6784003B2 (en) | Quick turn around time system and method of use | |
Park et al. | Fab simulation with recipe arrangement of tools | |
US20050203655A1 (en) | Scheduling system and method for avoiding low equipment utilization | |
Chincholkar et al. | Simultaneous optimisation of control factors in automated storage and retrieval systems and FMS using stochastic coloured Petri nets and the Taguchi method | |
CN115755798A (en) | A complete product intelligent manufacturing system based on cloud chain | |
TWI448861B (en) | Shorten the handling time of handling time | |
CN102478841B (en) | Method and device for balancing capacity of machine table | |
TWI663557B (en) | Manufacture schedule variation minimizing system | |
Arima et al. | Optimal production and capacity planning for Make-to-order type semiconductor production systems | |
TW200412518A (en) | Front end dispatching method and system for long batch processing equipment in semiconductor manufacturing | |
Shr et al. | Load Balancing Among Photolithography Machines in the Semiconductor Manufacturing System. | |
Chen et al. | Decentralized dispatching for blocking avoidance in automate material handling systems | |
CN107544452B (en) | Centralized Scheduling Method for CNC Machine Tools in Processing Workshops in Case of Emergency Adding Orders | |
CN105913147B (en) | A solution to product mix optimization problem based on residual capacity redistribution | |
Rezaie et al. | A novel release policy for hybrid make-to-stock/make-to-order semiconductor manufacturing systems |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination |