| Popis: |
Supply chain design problems can be analyzed as cooperative linear production games. The maximal total payoff and the optimal coalition of a “market responsive” supply network can be obtained from the solution of the mixed-variables Linear Programming problem. Then, using duality theory, the “Owen set” can be constructed in order to allocate the payoff among the members of the optimal coalition. However, it is shown that for a classical aggregate planning model, such an allocation scheme may be unfair and its stability critical. The main reason for this defect is in the poor representation of capacitated resources through bounds on workloads. It is shown that a better payoff allocation mechanism can be computed by introducing some clearing functions in the model. |
