Dynamically scheduling and maintaining a flexible server

AbstractDeciding how to jointly schedule jobs and perform preventive maintenance is a fundamental problem in flexible manufacturing systems, particularly those arising in semiconductor manufacturing. At the same time, past work in this area shows that, even when there is only one station and one type of job, identifying policies that minimize the amount of work‐in‐process (WIP) is a difficult problem. In this paper, we study a single‐station version of this problem with an arbitrary number of job classes, with the objective of minimizing average maintenance costs plus the weighted average amount of WIP. We identify conditions under which it suffices to schedule jobs according to both a server‐state‐dependent version of the cμ‐rule, and a static cμ‐rule where the average service rates are used. One of these conditions states that the ratio between the service rates should remain constant as the server deteriorates. When this assumption does not hold, scheduling with the cμ‐rule can in fact lead to an unstable system; we illustrate this using a simple example. On the other hand, we also present numerical evidence that cμ‐based scheduling performs well compared to other scheduling rules, and relative to a policy based on solving a Markov decision process.

Dynamically scheduling and maintaining a flexible server Journal Articles