A Nonpolynomial Optimal Algorithm for Sequencing Inspectors in a Repeat Inspection System with Rework

Assuming that two types of inspection errors are nonidentical and that only the items rejected by an inspector are reworked and sent to the next inspection cycle, we formulate a combinatorial optimization problem for simultaneously determining both the minimum frequency of inspection-rework cycles a...

Full description

Saved in:
Bibliographic Details
Published in:Mathematical problems in engineering Vol. 2015; no. 2015; pp. 1 - 9
Main Authors: Yang, Moon Hee, Cho, Jae Hyung
Format: Journal Article
Language:English
Published: Cairo, Egypt Hindawi Publishing Corporation 01.01.2015
John Wiley & Sons, Inc
Subjects:
Algorithms
Combinatorial analysis
Complexity
Errors
Inspection
Inspection frequency
Inspections
Mathematical models
Mathematical problems
Optimization
Quality
Sequences
Sequencing
Sequential scheduling
ISSN:1024-123X, 1563-5147
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Assuming that two types of inspection errors are nonidentical and that only the items rejected by an inspector are reworked and sent to the next inspection cycle, we formulate a combinatorial optimization problem for simultaneously determining both the minimum frequency of inspection-rework cycles and the optimal sequence of inspectors selected from a set of available inspectors, in order to meet the constraints of the outgoing quality level. Based on the inherent properties from our mathematical model, we provide a nonpolynomial optimal algorithm with a time complexity of O ( 2 m ) .
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1024-123X
1563-5147
DOI:10.1155/2015/601029