Solving a multistage partial inspection problem using genetic algorithms

Solving a multistage partial inspection problem using genetic algorithms

0.00 Avg rating0 Votes
Article ID: iaor200346
Country: United Kingdom
Volume: 40
Issue: 8
Start Page Number: 1923
End Page Number: 1940
Publication Date: Jan 2002
Journal: International Journal of Production Research
Authors: , ,
Keywords: programming: dynamic
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.

Reviews

Required fields are marked *. Your email address will not be published.