A polynomial time algorithm for solving a quality control station configuration problem

Authors:
Michal Penn;Tal Raviv
Affiliations:
Faculty of Industrial Engineering and Management, Technion - Israel Institute of Technology, Haifa 31905, Israel;Faculty of Industrial Engineering and Management, Technion - Israel Institute of Technology, Haifa 31905, Israel
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 1
Cited 2

Dynamic Programming

Dynamic Programming

Survey: Allocation of quality control stations in multistage manufacturing systems

Computers and Industrial Engineering
An efficient algorithm for maximizing the expected profit from a serial production line with inspection stations and rework

OR Spectrum

Quantified Score

Hi-index	0.04

Visualization

Abstract

We study unreliable serial production lines with known failure probabilities for each operation. Such a production line consists of a series of stations; existing machines and optional quality control stations (QCS). Our aim is to simultaneously decide where and if to install the QCSs along the line and to determine the production rate, so as to maximize the steady state expected net profit per time unit from the system. We use dynamic programming to solve the cost minimization auxiliary problem where the aim is to minimize the time unit production cost for a given production rate. Using the above developed O(N^2) dynamic programming algorithm as a subroutine, where N stands for the number of machines in the line, we present an O(N^4) algorithm to solve the Profit Maximization QCS Configuration Problem.