SCHEDULING OF AN UNRELIABLE MANUFACTURING SYSTEM WITH NONRESUMABLE SETUPS

This paper considers the scheduling of a manufacturing system with non resumable setup changes. The system considered involves an unreliable machine that can produce two part types. The switchover from one part type to the other incurs a given constant setup time. The setups are n onresumable, i.e. after a machine repair completion, a setup decision has to be made. The parts have specified constant processing time and constant demand rate. We give a continuous dynamic programming formula tion of the problem, which is solved numerically. The optimal setup sw itching policies are shown to be hedging corridors. Two heuristics, fo r the determination of the hedging levels, are provided. We show, thro ugh simulation, that the two heuristics exhibit good performance. (C) 1997 Elsevier Science Ltd.