Optimal operating policy for a bottleneck with random rework

Optimal operating policy for a bottleneck with random rework

0.00 Avg rating0 Votes
Article ID: iaor1996451
Country: United States
Volume: 41
Issue: 4
Start Page Number: 620
End Page Number: 636
Publication Date: Apr 1995
Journal: Management Science
Authors: ,
Keywords: scheduling, decision: applications, markov processes
Abstract:

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 tupe 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, the authors first formulate the problem as a semi-Markov decision process. Then they 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, the authors develop a simple procedure to compute the critical value that specifies the optimal threshold policy. Moreover, they evaluate the impact of batch sizes, yield, and switch-over time on the optimal threshold policy.

Reviews

Required fields are marked *. Your email address will not be published.