A Nonpolynomial Optimal Algorithm for Sequencing Inspectors in a Repeat Inspection System with Rework
Joint Authors
Source
Mathematical Problems in Engineering
Issue
Vol. 2015, Issue 2015 (31 Dec. 2015), pp.1-9, 9 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2015-09-03
Country of Publication
Egypt
No. of Pages
9
Main Subjects
Abstract EN
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 ) .
American Psychological Association (APA)
Yang, Moon Hee& Cho, Jae Hyung. 2015. A Nonpolynomial Optimal Algorithm for Sequencing Inspectors in a Repeat Inspection System with Rework. Mathematical Problems in Engineering،Vol. 2015, no. 2015, pp.1-9.
https://search.emarefa.net/detail/BIM-1074244
Modern Language Association (MLA)
Yang, Moon Hee& Cho, Jae Hyung. A Nonpolynomial Optimal Algorithm for Sequencing Inspectors in a Repeat Inspection System with Rework. Mathematical Problems in Engineering No. 2015 (2015), pp.1-9.
https://search.emarefa.net/detail/BIM-1074244
American Medical Association (AMA)
Yang, Moon Hee& Cho, Jae Hyung. A Nonpolynomial Optimal Algorithm for Sequencing Inspectors in a Repeat Inspection System with Rework. Mathematical Problems in Engineering. 2015. Vol. 2015, no. 2015, pp.1-9.
https://search.emarefa.net/detail/BIM-1074244
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1074244