Fair transfer price and inventory holding policies in two-enterprise supply chains

A key issue in supply chain optimisation involving multiple enterprises is the determination of policies that optimise the performance of the supply chain as a whole while ensuring adequate rewards for each participant. In this paper, we present a mathematical programming formulation for fair, optim...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European journal of operational research Ročník 143; číslo 3; s. 582 - 599
Hlavní autoři: Gjerdrum, Jonatan, Shah, Nilay, Papageorgiou, Lazaros G.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 16.12.2002
Elsevier
Elsevier Sequoia S.A
Edice:European Journal of Operational Research
Témata:
Branch-and-bound optimisation
Business process reengineering
Buyers
Game theory
Inventory
Linear programming
Mathematical programming
Multi-enterprise supply chain modelling
Optimization
Profits
Suppliers
Supply chains
Transfer pricing
Branch-and-bound optimisation
Game theory
Transfer pricing
Multi-enterprise supply chain modelling
ISSN:0377-2217, 1872-6860
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A key issue in supply chain optimisation involving multiple enterprises is the determination of policies that optimise the performance of the supply chain as a whole while ensuring adequate rewards for each participant. In this paper, we present a mathematical programming formulation for fair, optimised profit distribution between echelons in a general multi-enterprise supply chain. The proposed formulation is based on an approach applying the Nash bargaining solution for finding optimal multi-partner profit levels subject to given minimum echelon profit requirements. The overall problem is first formulated as a mixed integer non-linear programming (MINLP) model. A spatial and binary variable branch-and-bound algorithm is then applied to the above problem based on exact and approximate linearisations of the bilinear terms involved in the model, while at each node of the search tree, a mixed integer linear programming (MILP) problem is solved. The solution comprises inter-firm transfer prices, production and inventory levels, flows of products between echelons, and sales profiles. The applicability of the proposed approach is demonstrated by a number of illustrative examples based on industrial processes.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/S0377-2217(01)00349-6