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

Moon Hee Yang and Jae Hyung Cho

Mathematical Problems in Engineering, 2015, vol. 2015, 1-9

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 of .

Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2015/601029.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2015/601029.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:601029

DOI: 10.1155/2015/601029

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().