A Nonpolynomial Optimal Algorithm for Sequencing Inspectors in a Repeat Inspection System with Rework. (3rd September 2015)

• Record Type: Journal Article
• Authors: Yang, Moon Hee; Cho, Jae Hyung
• Other Names: Chicano Francisco Academic Editor.
• Is Part Of: Mathematical problems in engineering. Volume 2015(2015)
• Publication Date: 2015-09-03
• Subjects: Engineering mathematics -- Periodicals; 510.2462
• DOI: 10.1155/2015/601029
• Languages: English
• ISSNs: 1024-123X

Abstract

Abstract : 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 ofO ( 2 m ) .