Solving a multistage partial inspection problem using genetic algorithms

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...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of production research Vol. 40; no. 8; pp. 1923 - 1940
Main Authors Heredia-Langner, A., Montgomery, D. C., Carlyle, W. M.
Format Journal Article
LanguageEnglish
Published Taylor & Francis Group 01.01.2002
Online AccessGet full text
ISSN0020-7543
1366-588X
DOI10.1080/00207540210123337

Cover

More Information
Summary: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.
ISSN:0020-7543
1366-588X
DOI:10.1080/00207540210123337