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

Discrete Applied Mathematics

Volumn 156, Issue 4, 2008, Pages 412-419

  Penn, Michal ^a   Raviv, Tal ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Polynomial algorithm; Quality control; Serial production line

Indexed keywords

APPROXIMATION ALGORITHMS; COST BENEFIT ANALYSIS; DYNAMIC PROGRAMMING; LEARNING SYSTEMS; PROBLEM SOLVING; QUALITY CONTROL;

AUXILIARY PROBLEMS; POLYNOMIAL ALGORITHMS; SERIAL PRODUCTION LINES;

POLYNOMIAL APPROXIMATION;

EID: 38149108947     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2007.08.005     Document Type: Article

References (7)

1. Kogan K., and Raz T. Optimal allocation of inspection effort over a finite planning horizon. IIE Trans. 34 (2002) 515-527
2. Lindsay G.F., and Bishop A.B. Allocation of screening inspection effort: a dynamic programming approach. Management Sci. 10 (1965) 342-352
3. Penn M., and Raviv T. Optimizing the quality control station configuration. Nav. Res. Log. 54 (2007) 301-314
4. Raz T. A survey of models for allocating inspections effort in multistage production system. J. Quality Technol. 18 (1986) 239-247
5. Raz T., and Kaspi M. Location and sequencing of imperfect operations in serial multi-stage production system. Internat. J. Production Res. 29 (1991) 1654-1659
6. M. Sniedovich, Dynamic Programming, Marcel Dekker, New York, 1992.
7. Yum B.J., and McDowell E.D. Optimal inspection policies in a serial production system including scarp, rework and repair: an MILP approach. Internat. J. Production Res. 25 (1987) 1451-1464