Jobs with known processing times and due dates have to be processed on a machine which is subject to a single breakdown. The moment of breakdown and the repair time are independent random variables. Two cases are distinguished with reference to the processing time preempted by the breakdown (no other preemptions are allowed): (i) resumption without time losses and (ii) restart from the beginning. Under certain compatible conditions, we find the policies which minimize stochastically the number of tardy jobs. Copyright

Additional Metadata
Persistent URL dx.doi.org/10.1002/1520-6750(199104)38:2<261::AID-NAV3220380210>3.0.CO;2-I, hdl.handle.net/1765/93575
Journal Naval Research Logistics: an international journal
Citation
Adiri, I, Frostig, E, & Rinnooy Kan, A.H.G. (1991). Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs. Naval Research Logistics: an international journal, 38(2), 261–271. doi:10.1002/1520-6750(199104)38:2<261::AID-NAV3220380210>3.0.CO;2-I