Optimal Operating Policy for a Bottleneck with Random Rework
This paper presents a model of a bottleneck facility that performs two distinct types of operations: "regular" and "rework." Each job is subjected to a test after completing the regular operation at the bottleneck. If the job passes the test, then it continues its process downstream. Otherwise, the job will cycle back to the bottleneck stage for rework operation. Upon the completion of a batch of regular jobs, the decision maker observes the amount of rework and decides on whether to switch over to process the reworks or continue to process another batch of regular jobs. It is assumed that both switch-over time and cost are incurred when the facility switches from performing one type of operation to a different type. The goal of the analysis is to characterize the optimal operating policy for the bottleneck so that the average operating cost is minimized. In order to characterize the optimal operating policy, we first formulate the problem as a semi-Markov decision process. Then we show that there exists an optimal "threshold" operating policy that can be described as follows: upon completion of a batch of regular jobs, switch over to process the reworks only if the number of reworks exceeds a critical value. In addition, we develop a simple procedure to compute the critical value that specifies the optimal threshold policy. Moreover, we evaluate the impact of batch sizes, yield, and switch-over time on the optimal threshold policy.
Volume (Year): 41 (1995)
Issue (Month): 4 (April)
|Contact details of provider:|| Postal: |
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:41:y:1995:i:4:p:620-636. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.