完整後設資料紀錄
DC 欄位語言
dc.contributor.authorYao, Ming-Jongen_US
dc.contributor.authorChiou, Chuang-Chunen_US
dc.date.accessioned2014-12-08T15:08:52Z-
dc.date.available2014-12-08T15:08:52Z-
dc.date.issued2009-09-01en_US
dc.identifier.issn0453-4514en_US
dc.identifier.urihttp://hdl.handle.net/11536/6758-
dc.description.abstractIn this paper, we propose a new cooperative scenario for supply chains using common replenishment epochs based on the mathematical model presented in Viswanathan and Piplani's [25] paper. In order to solve an optimal solution for the cooperative scenario, we first conduct a theoretical analysis on the optimal cost function of the mathematical model. Then, we propose an efficient search algorithm by utilizing our theoretical results on the cooperative scenario. Also, we introduce a saving-sharing mechanism that could motivate the buyers to cooperate with the vendor. Importantly, the proposed saving-sharing mechanism assists the supply chain system to create a multi-win situation among the vendor and the buyers. Using the 48 sets of data in Viswanathan and Piplani's [25] paper, we demonstrate that the proposed cooperative scenario could attain significant improvement on the costs for both the vendor and the buyers in comparison to the Stackelberg-game scenario.en_US
dc.language.isoen_USen_US
dc.subjectOptimizationen_US
dc.subjectbusiness policyen_US
dc.subjectcost modelsen_US
dc.subjectinventory controlen_US
dc.subjectoperations managementen_US
dc.subjectsearch procedureen_US
dc.titleA NEW COOPERATIVE SCENARIO FOR SUPPLY CHAINS USING COMMON REPLENISHMENT EPOCHSen_US
dc.typeArticleen_US
dc.identifier.journalJOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPANen_US
dc.citation.volume52en_US
dc.citation.issue3en_US
dc.citation.spage263en_US
dc.citation.epage282en_US
dc.contributor.department運輸與物流管理系 註:原交通所+運管所zh_TW
dc.contributor.departmentDepartment of Transportation and Logistics Managementen_US
dc.identifier.wosnumberWOS:000272478700003-
dc.citation.woscount1-
顯示於類別:期刊論文