Throughput Maximization Using S-Graph

Majozi and Friedler (2006) have recently extended the S-graph framework so that problems that involve economic performance indicators can be tackled. Specifically, 

8 Using S-Graph to Address Exogenous Uncertainty in Processes Scheduling 

The optimization strategy they propose can be understood as comprised of two components a feasibility test and an optimality search algorithm. 

Bearing in mind that a node (Pj) in the search space corresponds to a discrete combination of batches of products, the feasibility test of a node basically consists in (i) finding the minimum makespan schedule graph for the specific combination of batches of products and (ii) a comparison between the minimum makespan obtained and the fixed time horizon. Clearly, the schedule graph is feasible if the minimum makespan obtained is less or equal than the time horizon length. 

---