Job-shop resource scheduling via simulating random operations

We are concerned with a problem of scheduling a flexible manufacturing cell with random time operations. A job-shop production section comprises a set of n jobs (orders) and a set of m machines (processors). Each order consists of a chain of operations, each of which needs to be executed during an uninterrupted period on a given processor. Each operation is carried out under random disturbances. For each order, its due date and the probability of meeting the deadline on time are pregiven. Orders are of different importance and a priority index has to be set for each order by the management, i.e. by practitioners who are responsible for the job-shop. Certain operations need additional resources to be delivered beforehand (equipment, experimental stations, etc.) to process these operations.