{"title":"管理库存系统与双重交付模式和最低订单数量","authors":"Yiran Li, Chaolin Yang","doi":"10.1002/nav.22113","DOIUrl":null,"url":null,"abstract":"We consider an infinite‐horizon periodic‐review inventory system with dual delivery modes, each with a minimum order quantity (MOQ). The expedited mode provides a shorter lead time than the regular mode but has a higher unit ordering cost. As the optimal ordering policy for a system with dual delivery modes and MOQ requirements is unknown and expected to be very complicated, we propose a class of simple policies called single‐index (M,S)$$ \\left(M,S\\right) $$ policies, and we provide an exact procedure to compute the expected long‐run average total cost. Specifically, we first analyze the steady‐state distribution of the inventory position. Then we develop a recursive procedure to determine the steady‐state distribution of the inventory level. In addition, for a special case where ordering from the regular mode follows a base‐stock policy, we apply normal approximation to simplify the exact calculation of the cost. We also study a more complicated class of policies called dual‐index (M,S)$$ \\left(M,S\\right) $$ policies. In numerical studies, we first compare the average cost of the single‐index (M,S)$$ \\left(M,S\\right) $$ policy with that of a modified single‐index policy without MOQ consideration and the (M,S)$$ \\left(M,S\\right) $$ policy for the single‐mode system respectively to investigate the value of the single‐index (M,S)$$ \\left(M,S\\right) $$ policy. In addition, we find that the simpler single‐index (M,S)$$ \\left(M,S\\right) $$ policy performs close to the dual‐index (M,S)$$ \\left(M,S\\right) $$ policy and the optimal policy computed via dynamic programming. Finally, to assess the effectiveness of the normal approximation in the special case, we numerically compare the cost and policy parameters of the exact calculation with those of the normal approximation. The results illustrate that normal approximation not only improves the calculation speed, but also has near‐optimal solutions.","PeriodicalId":19120,"journal":{"name":"Naval Research Logistics (NRL)","volume":"64 5 1","pages":"617 - 636"},"PeriodicalIF":0.0000,"publicationDate":"2023-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Managing inventory systems with dual delivery modes and minimum order quantities\",\"authors\":\"Yiran Li, Chaolin Yang\",\"doi\":\"10.1002/nav.22113\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider an infinite‐horizon periodic‐review inventory system with dual delivery modes, each with a minimum order quantity (MOQ). The expedited mode provides a shorter lead time than the regular mode but has a higher unit ordering cost. As the optimal ordering policy for a system with dual delivery modes and MOQ requirements is unknown and expected to be very complicated, we propose a class of simple policies called single‐index (M,S)$$ \\\\left(M,S\\\\right) $$ policies, and we provide an exact procedure to compute the expected long‐run average total cost. Specifically, we first analyze the steady‐state distribution of the inventory position. Then we develop a recursive procedure to determine the steady‐state distribution of the inventory level. In addition, for a special case where ordering from the regular mode follows a base‐stock policy, we apply normal approximation to simplify the exact calculation of the cost. We also study a more complicated class of policies called dual‐index (M,S)$$ \\\\left(M,S\\\\right) $$ policies. In numerical studies, we first compare the average cost of the single‐index (M,S)$$ \\\\left(M,S\\\\right) $$ policy with that of a modified single‐index policy without MOQ consideration and the (M,S)$$ \\\\left(M,S\\\\right) $$ policy for the single‐mode system respectively to investigate the value of the single‐index (M,S)$$ \\\\left(M,S\\\\right) $$ policy. In addition, we find that the simpler single‐index (M,S)$$ \\\\left(M,S\\\\right) $$ policy performs close to the dual‐index (M,S)$$ \\\\left(M,S\\\\right) $$ policy and the optimal policy computed via dynamic programming. Finally, to assess the effectiveness of the normal approximation in the special case, we numerically compare the cost and policy parameters of the exact calculation with those of the normal approximation. The results illustrate that normal approximation not only improves the calculation speed, but also has near‐optimal solutions.\",\"PeriodicalId\":19120,\"journal\":{\"name\":\"Naval Research Logistics (NRL)\",\"volume\":\"64 5 1\",\"pages\":\"617 - 636\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-04-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Naval Research Logistics (NRL)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/nav.22113\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Naval Research Logistics (NRL)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/nav.22113","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Managing inventory systems with dual delivery modes and minimum order quantities
We consider an infinite‐horizon periodic‐review inventory system with dual delivery modes, each with a minimum order quantity (MOQ). The expedited mode provides a shorter lead time than the regular mode but has a higher unit ordering cost. As the optimal ordering policy for a system with dual delivery modes and MOQ requirements is unknown and expected to be very complicated, we propose a class of simple policies called single‐index (M,S)$$ \left(M,S\right) $$ policies, and we provide an exact procedure to compute the expected long‐run average total cost. Specifically, we first analyze the steady‐state distribution of the inventory position. Then we develop a recursive procedure to determine the steady‐state distribution of the inventory level. In addition, for a special case where ordering from the regular mode follows a base‐stock policy, we apply normal approximation to simplify the exact calculation of the cost. We also study a more complicated class of policies called dual‐index (M,S)$$ \left(M,S\right) $$ policies. In numerical studies, we first compare the average cost of the single‐index (M,S)$$ \left(M,S\right) $$ policy with that of a modified single‐index policy without MOQ consideration and the (M,S)$$ \left(M,S\right) $$ policy for the single‐mode system respectively to investigate the value of the single‐index (M,S)$$ \left(M,S\right) $$ policy. In addition, we find that the simpler single‐index (M,S)$$ \left(M,S\right) $$ policy performs close to the dual‐index (M,S)$$ \left(M,S\right) $$ policy and the optimal policy computed via dynamic programming. Finally, to assess the effectiveness of the normal approximation in the special case, we numerically compare the cost and policy parameters of the exact calculation with those of the normal approximation. The results illustrate that normal approximation not only improves the calculation speed, but also has near‐optimal solutions.