Global supply chain planning for pharmaceuticals

Large instances of the model are not solvable in realistic time scales, so two decomposition algorithms were developed. In the first method, the supply chain is decomposed into independent primary and secondary subproblems, and each of them is optimised separately. The second algorithm is a temporal decomposition, where the main problem is separated into several independent subproblems, one per each time period. These algorithms enable the solution of large instances of the problem in reasonable time with good quality results.