In this paper, we address the scheduling problem with positionaldependent processing times in a disruptive environment, in which there is a possibility that some of the machines become unavailable for a certain period of time with a certain probability due to a disruption at a particular time. By positional-dependent processing times, we mean that the actual processing time of a job depends on its processing position on a machine. Since some machines may be unavailable for a certain period of

more »

... me, both non-resumable and resumable cases are considered. The objective is to minimize the expected total completion time. For various cases, we provide the complexity results and present efficient pseudo-polynomial time algorithms for the corresponding problems.