Repeat Inspection Planning Using Dynamic Programming
In this paper we propose a dynamic programming approach to the problem of determination of the inspection sequence of multi-characteristic critical components, and the number of repeat inspection for each characteristic. The model presented here considers the case of several classification of a prod...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Format: | article |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/1944/1/repeat_inspection_planning_using_dynamic_elshafei_isi_000234583900003.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1864513400876302336 |
|---|---|
| author | Duffuaa, S. O. |
| author2 | Elshafei, M. Khan, M. unknown |
| author2_role | author author author |
| author_facet | Duffuaa, S. O. Elshafei, M. Khan, M. unknown |
| author_role | author |
| dc.creator.none.fl_str_mv | Duffuaa, S. O. Elshafei, M. Khan, M. unknown |
| dc.date.*.fl_str_mv | 2020 |
| dc.format.none.fl_str_mv | application/pdf |
| dc.identifier.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/1944/1/repeat_inspection_planning_using_dynamic_elshafei_isi_000234583900003.pdf Repeat Inspection Planning Using Dynamic Programming. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 44. pp. 257-270. |
| dc.language.none.fl_str_mv | en |
| dc.publisher.none.fl_str_mv | TAYLOR FRANCIS LTD |
| dc.relation.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/1944/ http://isi.kfupm.edu.sa/journals/pdf/R/repeat_inspection_planning_using_dynamic_elshafei_isi_000234583900003.pdf |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Systems |
| dc.title.none.fl_str_mv | Repeat Inspection Planning Using Dynamic Programming |
| dc.type.none.fl_str_mv | Article PeerReviewed info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/article |
| description | In this paper we propose a dynamic programming approach to the problem of determination of the inspection sequence of multi-characteristic critical components, and the number of repeat inspection for each characteristic. The model presented here considers the case of several classification of a product by an inspector. An inspector could classify a product as non-defective, to be reworked, or to be scrapped, with respect to a certain characteristic. The model accounts as well for possible misclassification by the inspector. The dynamic programming algorithm searches for a solution that minimizes the total cost of inspection per accepted component. The total cost includes the cost of false rejection of good items, the cost due to false acceptance of an item which is either reworkable or to be scrapped, the cost of inspection, and the cost of rework. |
| eu_rights_str_mv | openAccess |
| format | article |
| id | KFUPM_e5a18971e00e9b936a40c148f03c22ef |
| identifier_str_mv | Repeat Inspection Planning Using Dynamic Programming. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 44. pp. 257-270. |
| language_invalid_str_mv | en |
| network_acronym_str | KFUPM |
| network_name_str | King Fahd University of Petroleum and Minerals |
| oai_identifier_str | oai::1944 |
| publishDate | 2020 |
| publisher.none.fl_str_mv | TAYLOR FRANCIS LTD |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | Repeat Inspection Planning Using Dynamic ProgrammingDuffuaa, S. O.Elshafei, M.Khan, M.unknownSystemsIn this paper we propose a dynamic programming approach to the problem of determination of the inspection sequence of multi-characteristic critical components, and the number of repeat inspection for each characteristic. The model presented here considers the case of several classification of a product by an inspector. An inspector could classify a product as non-defective, to be reworked, or to be scrapped, with respect to a certain characteristic. The model accounts as well for possible misclassification by the inspector. The dynamic programming algorithm searches for a solution that minimizes the total cost of inspection per accepted component. The total cost includes the cost of false rejection of good items, the cost due to false acceptance of an item which is either reworkable or to be scrapped, the cost of inspection, and the cost of rework.TAYLOR FRANCIS LTDArticlePeerReviewedinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttps://eprints.kfupm.edu.sa/id/eprint/1944/1/repeat_inspection_planning_using_dynamic_elshafei_isi_000234583900003.pdf Repeat Inspection Planning Using Dynamic Programming. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 44. pp. 257-270. enhttps://eprints.kfupm.edu.sa/id/eprint/1944/http://isi.kfupm.edu.sa/journals/pdf/R/repeat_inspection_planning_using_dynamic_elshafei_isi_000234583900003.pdf2020info:eu-repo/semantics/openAccessoai::19442019-11-01T13:29:46Z |
| spellingShingle | Repeat Inspection Planning Using Dynamic Programming Duffuaa, S. O. Systems |
| status_str | publishedVersion |
| title | Repeat Inspection Planning Using Dynamic Programming |
| title_full | Repeat Inspection Planning Using Dynamic Programming |
| title_fullStr | Repeat Inspection Planning Using Dynamic Programming |
| title_full_unstemmed | Repeat Inspection Planning Using Dynamic Programming |
| title_short | Repeat Inspection Planning Using Dynamic Programming |
| title_sort | Repeat Inspection Planning Using Dynamic Programming |
| topic | Systems |
| url | https://eprints.kfupm.edu.sa/id/eprint/1944/1/repeat_inspection_planning_using_dynamic_elshafei_isi_000234583900003.pdf |