Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/100764
DC Field | Value | Language |
---|---|---|
dc.contributor | 企管系 | |
dc.creator | 唐揆 | zh_TW |
dc.creator | Park, J.S.;Peters, M.H.;Tang, Kwei | |
dc.date | 1991-08 | |
dc.date.accessioned | 2016-08-25T07:53:06Z | - |
dc.date.available | 2016-08-25T07:53:06Z | - |
dc.date.issued | 2016-08-25T07:53:06Z | - |
dc.identifier.uri | http://nccur.lib.nccu.edu.tw/handle/140.119/100764 | - |
dc.description.abstract | Under sequential screening, a production lot is inspected item by item, and the decision is made after inspecting each item whether to inspect another item or to reject the remainder of the lot. Thus, uninspected items are never accepted. This screening process is a special case of the sequential sampling considered in Wortham and Wilson (1971). The process is formulated as an optimal stopping problem using a Bayesian approach. Based on an analysis of the structural properties of the optimal policy, a backward-recursive optimal algorithm that is more efficient than the existing algorithm for optimal sequential sampling is developed. The optimal policy will call for an early termination of the screening process on a lot with a high defective rate. | |
dc.format.extent | 224908 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.relation | Management Science, 37(8), 1058-1061 | |
dc.subject | Mathematical models;Inspections;Dynamic programming;Bayesian analysis;Algorithms | |
dc.title | Optimal Inspection Policy in Sequential Screening | |
dc.type | article | |
item.fulltext | With Fulltext | - |
item.cerifentitytype | Publications | - |
item.grantfulltext | restricted | - |
item.openairetype | article | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
Appears in Collections: | 期刊論文 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
1058-1061.pdf | 219.64 kB | Adobe PDF2 | View/Open |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.