Cyclic ordering policies from capacitated suppliers under limited cycle time

عنوان Cyclic ordering policies from capacitated suppliers under limited cycle time
نویسنده Ekici, Ali, Özener, Okan Örsan, Duran, S.
تاریخ انتشار: 2019-02
محل انتشار - Elsevier
موضوع Capacitated suppliers, Cyclic ordering policy, Limited cycle time, Iterative heuristic algorithms
نوع دوره ای
زبان انگلیسی
دیجیتال بله
نسخه خطی خیر
کتابخانه: دانشگاه اوزیغین
شناسه دارایی کتابخانه 0360-8352
شماره ثبت 8f95bb48-ccdd-403f-bcbb-74d159146f89
محل کتابخانه Industrial Engineering
تاریخ 2019-02
متن نمونه In this paper, we study the ordering policy of a manufacturer/retailer which procures a single item from multiple capacitated suppliers and satisfies an exogenous deterministic and constant demand. Manufacturer's objective is to minimize total periodic ordering cost which has three components: (i) fixed ordering cost, (ii) variable purchasing cost, and (iii) inventory holding cost. We are interested in developing a cyclic ordering policy for the manufacturer where the orders are repeated with a certain frequency and the cycle length/time is limited by the manufacturer. We analyze two cases: (i) each supplier receives at most one order from the manufacturer in a cycle, and (ii) suppliers may receive multiple orders from the manufacturer in a cycle. We propose a novel iterative-natured heuristic framework to develop cyclic ordering policies. Computational experiments on randomly generated instances show that the proposed heuristic framework provides better results compared to other methods in the literature, especially in the presence of a restrictive cycle time limitation.
DOI 10.1016/j.cie.2018.12.048
Cilt 128
مشاهده در منبع دانشگاه اوزیغین دانشگاه اوزیغین - موتور جستجوی نسخه های خطی عثمانی
دانشگاه اوزیغین - موتور جستجوی نسخه های خطی عثمانی دانشگاه اوزیغین

Cyclic ordering policies from capacitated suppliers under limited cycle time

نویسنده Ekici, Ali, Özener, Okan Örsan, Duran, S.
تاریخ انتشار 2019-02
محل انتشار - Elsevier
موضوع Capacitated suppliers, Cyclic ordering policy, Limited cycle time, Iterative heuristic algorithms
نوع دوره ای
زبان انگلیسی
دیجیتال بله
نسخه خطی خیر
کتابخانه دانشگاه اوزیغین
شناسه دارایی کتابخانه 0360-8352
شماره ثبت 8f95bb48-ccdd-403f-bcbb-74d159146f89
محل کتابخانه Industrial Engineering
تاریخ 2019-02
متن نمونه In this paper, we study the ordering policy of a manufacturer/retailer which procures a single item from multiple capacitated suppliers and satisfies an exogenous deterministic and constant demand. Manufacturer's objective is to minimize total periodic ordering cost which has three components: (i) fixed ordering cost, (ii) variable purchasing cost, and (iii) inventory holding cost. We are interested in developing a cyclic ordering policy for the manufacturer where the orders are repeated with a certain frequency and the cycle length/time is limited by the manufacturer. We analyze two cases: (i) each supplier receives at most one order from the manufacturer in a cycle, and (ii) suppliers may receive multiple orders from the manufacturer in a cycle. We propose a novel iterative-natured heuristic framework to develop cyclic ordering policies. Computational experiments on randomly generated instances show that the proposed heuristic framework provides better results compared to other methods in the literature, especially in the presence of a restrictive cycle time limitation.
DOI 10.1016/j.cie.2018.12.048
Cilt 128
دانشگاه اوزیغین - موتور جستجوی نسخه های خطی عثمانی
دانشگاه اوزیغین شما در حال هدایت مجدد هستید...

لطفاً صبر کنید