生產系統中檢驗站設置之研究

A Study on The Allocation of Inspection Stations in Production Systems

王朝正(Chaur-Cheng Wang)

指導教授 ： 鄭春生

元智大學/工程學院/工業工程與管理學系/碩士(1994年)

摘要

應用品質管制方法以避免銷售不合格品給顧客是一個必要的工作，適當的
檢驗對於生產系統而言非常重要。本研究考慮一般性的檢驗站設置問題，
包含串連式與並連式生產系統。其中串連式生產系統可以視為並連式生產
系統的特例。我們允許生產的加工順序可以未知、每一檢驗站設置時可以
從多種檢驗設備中選擇。在本研究中，檢驗站設置問題是在限制檢驗站站
數與輸出不合格品率的條件下，求出加工順序與檢驗站的設置位置，使得
總製造成本最低。總製造成本包括固定及變動的加工成本、檢驗成本、物
料搬運成本、內部失敗成本及外部失敗成本。在以前的研究多以動態規劃
法、0-1 整數規劃法或是非線性規劃法求解檢驗站設置問題。然而上述方
法在求解問題規模稍微大時就會因需要大量的計算時間而變得不可行。本
研究使用模擬退火演算法求解檢驗站設置問題，此演算法可以在有效的計
算時間內求得一最佳解或近似最佳解。

關鍵字

檢驗站位置 ； 模擬退火

並列摘要

In a production system, it is necessary to apply quality
control methods to prevent the nonconforming products from
reaching the customers. Appropriate inspection is a
significant component of production systems. Determination of
appropriate inspection allocations becomes an interesting
research topic. In this research, we formulate a general
inspection problem, both for a serial and a nonserial
manufacturing system. Serial production systems may be viewed
as a special case of nonserial production systems. We
extended the treatment of the inspection allocation problem to
address the following conditions: (1) the order of production
operations does not have to be known in advance (2) there are
several inspection facilities available to each inspection
point. Traditionally, dynamic programming, 0-1 integer
programming or non-linear programming techniques are used to
solve inspection allocation problem. However, a problem
using these techniques is that the computation time becomes
prohibitively large when the number of potential inspection
stations are twenty or more. In the current research,
inspection allocation models are formulated with the
objective of determining the number and location of
inspection stations which will minimize the expected total
cost per unit produced. The total cost includes fixed
and variable processing cost, inspection cost, material
handling cost, internal failure costs (repair,
replacement, scrap, and rework) and external failure
costs. In this research, we apply the simulated annealing
algorithm to solve the inspection allocation problem. A
comparison shows that the simulated annealing algorithm is a
promising approach to solve inspection allocation problem.

並列關鍵字

Inspection Allocation ； Simulated Annealing