Minimizing the Expected Weighted Number of Tardy Jobs in the Stochastic Two-Machine Flow Shop

摘要

This paper is concerned with a stochastic scheduling problem involving a two-machine flow shop. The objective is to find a job sequence which minimizes the expected weighted number of tardy jobs. For the two-machine flow shop, two sufficient optimality conditions are developed when the due dates are identically distributed random variables and a job has the same processing time distribution on both machines. An example is given to illustrate the results.