|
English
|
正體中文
|
简体中文
|
Total items :0
|
|
Visitors :
51512449
Online Users :
1327
Project Commissioned by the Ministry of Education
Project Executed by National Taiwan University Library
|
|
|
|
Taiwan Academic Institutional Repository >
Browse by Author
|
"chung k j"
Showing items 31-40 of 42 (5 Page(s) Totally)
<< < 1 2 3 4 5 > >>
View [10|25|50] records per page
| 國立臺灣科技大學 |
2012 |
The correct process of arguments of the solution procedure on the inventory model for deteriorating items with trapezoidal type demand rate in supply chain management
|
Chung, K.-J. |
| 國立臺灣科技大學 |
2012 |
The integrated inventory model with the transportation cost and two-level trade credit in supply chain management
|
Chung, K.-J. |
| 國立臺灣科技大學 |
2012 |
The complete solution procedure for the EOQ and EPQ inventory models with linear and fixed backorder costs
|
Chung, K.-J.; Cardenas-Barron, L.E. |
| 國立臺灣科技大學 |
2012 |
Lot-sizing decisions for deteriorating items with two warehouses under an order-size-dependent trade credit
|
Liao, J.-J.; Huang, K.-N.; Chung, K.-J. |
| 國立臺灣科技大學 |
2011 |
A two-warehouse inventory model under trade credit in the supply chain management
|
Chung, K.J.;Chen, Y.C.;Lin, S.D. |
| 實踐大學 |
2009 |
A simple cost minimization procedure for the (Q, r) inventory system with a specified fixed cost per stockout occasion
|
Chung, K.J.;Ting, P.S.;Hou, K.L. |
| 實踐大學 |
2009 |
An accurate and reliable solution algorithm for the (Q, r) inventory system with a fixed shortage cost
|
Ting, P.S.;Hou, K.L.;Chung, K.J. |
| 國立臺灣科技大學 |
2006 |
The optimal ordering policy in a DCF analysis for deteriorating items when trade credit depends on the order quantity
|
Chung, K.-J.;Liao, J.-J. |
| 國立臺灣科技大學 |
2006 |
Retailer's optimal cycle times in the EOQ model with imperfect quality and a permissible credit period
|
Chung, K.-J.;Huang, Y.-F. |
| 實踐大學 |
1998 |
Economic ordering policy for deteriorating items with a linearly increasing demand
|
Chung, K.J.;Ting, P.S. |
Showing items 31-40 of 42 (5 Page(s) Totally)
<< < 1 2 3 4 5 > >>
View [10|25|50] records per page
|
