May 20, 2002
Journal Article

Solving a multistage partial inspection problem using genetic algorithms

Abstract

Traditionally, the multistage inspection problem has been formulated as consisting of a decision schedule where some manufacturing stages receive full inspection and the rest none. Dynamic programming and heuristic methods (like local search) are the most commonly used solution techniques. A highly constrained multistage inspection problem is presented where all stages must receive partial rectifying inspection and it is solved using a real-valued genetic algorithm. This solution technique can handle multiple objectives and quality constraints effectively.

Revised: September 25, 2002 | Published: May 20, 2002

Citation

Heredia-Langner A., D.C. Montgomery, and W.M. Carlyle. 2002. Solving a multistage partial inspection problem using genetic algorithms. International Journal of Production Research 40, no. 8:1923-1940. PNNL-SA-36982.