A New Revenue Sharing Mechanism forCoordinating Multi-echelon Supply Chains
AbstractOne of the key issues in Supply Chain Management is to prevent sub-optimization caused by the distribution of decision power over the various entities. Over the last decade, various contract mechanisms such as Revenue Sharing (RS) have been used to overcome such difficulties. Typically, a contract mechanism is negotiated between two supply chain entities. In this paper a new type of RS contract mechanism for multi-echelon supply chains is introduced. Instead of multiple pairwise RS contracts between adjacent entities, the so-called spanning RS contract mechanism between the most downstream entity and all upstream entities is proposed. The new RS contract is applied in a setting of a linear supply chain facing stochastic demand in which each entity can set its own wholesale price, except for the most downstream entity that faces the market price but can decide the order size. It is argued that from an implementation perspective the spanning contract mechanism is superior to the pairwise contracts. Furthermore, it is shown that in the setting studied, the spanning RS mechanism can maximize the supply chain profits (coordination) and provide opportunities for all entities to improve their profits (win-win). Also, two special cases of distributing the additional profits are shown and a numerical example is provided.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Nyenrode Business Universiteit in its series Nyenrode Research Papers Series with number NRI09-01.
Date of creation: 2009
Date of revision:
Contact details of provider:
Web page: http://www.library.nyenrode.nl
Supply chain management; Multi-echelon; Revenue Sharing; Coordination; Win-win;
This paper has been announced in the following NEP Reports:
- NEP-ALL-2009-07-03 (All new papers)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ronald Piebes).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.