Stochastic Single Server Scheduling Problem

This study considers a single server scheduling problem in which one server serves the setup operations of m parallel machines. Since the server can only serve one machine at a time, the others must wait for the server to become free if multiple setups occur simultaneously. The server's service time is stochastic and varies depending on its resource use level. Two-stage stochastic programming was used to solve the problem. Randomly generated test problems were used to demonstrate the performance of the proposed mathematical model. Experimental results have concretely shown the contribution of stochastic consideration of the problem.