An approach to solve a hierarchical stochastic sequential ordering problem

In this paper, we study a stochastic sequential ordering problem, where a set of jobs must be scheduled on a single machine. The jobs have stochastic processing times and verify certain precedence relations. For each job, there also exists a time window characterized by the release time and the due date. The jobs must be processed into the time-windows. For all the sequences of jobs that verify the precedence relations and the release times, the feasibility probability of a sequence it is defined as the probability that the sequence heeds the due dates. The problem consists of finding a sequence of jobs with the minimum expected makespan among the sequences with maximum feasibility probability. We prove that this problem is NP-hard and we propose an algorithm to find an approximate solution for this problem. The algorithm does not depend on the distribution types of the random input data considered. This procedure looks first for sequences of jobs with a high probability of being feasible. Next, the algorithm selects, among the sequences which have an acceptable feasibility probability level, that sequence with minimum expected makespan. Computational experiences are also reported, and the results show us that the proposed algorithm finds good solutions with short CPU times.