Solving a multistage partial inspection problem using genetic algorithms

A. Heredia-Langner, Douglas Montgomery, W. M. Carlyle

Research output: Contribution to journalArticle

21 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)1923-1940
Number of pages18
JournalInternational Journal of Production Research
Volume40
Issue number8
DOIs
StatePublished - May 20 2002

ASJC Scopus subject areas

  • Strategy and Management
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'Solving a multistage partial inspection problem using genetic algorithms'. Together they form a unique fingerprint.

  • Cite this