A Cut-to-Order Strategy for One-Dimensional Cable Cutting and a Case Study_

:::

詳目顯示

第 1 筆 / 總合 1 筆

/1頁

來源文獻資料
外文摘要
引文資料

題名：	A Cut-to-Order Strategy for One-Dimensional Cable Cutting and a Case Study
書刊名：	工業工程學刊
作者：	金昊淼／王正肖／簡禎富
作者(外文)：	Jin, Haomiao／Wang, Zhengxiao／Chien, Chen-fu
出版日期：	2012
卷期：	29:8
頁次：	頁572-586
主題關鍵詞：	一維切割；接單式切割策略；綠色製造；客製化電纜；大量客製化；One-dimensional cutting；Cut-to-order strategy；Green manufacturing；Customized cable；Mass customization
原始連結：	連回原系統網址
相關次數：	被引用次數:期刊(0) 博士論文(0) 專書(0) 專書論文(0) 排除自我引用:0 共同引用:0 點閱:173

Low-entry barrier for accessing the cable market leads to the intensive competition among hundreds of homogeneous cable manufacturers in China. Mass customization is an effective way to differentiate companies in a highly competitive market. Focused on the real needs of a leading cable manufacturer in China for operating a new e-business to sell customized cables, this study aims to propose a cut-toorder strategy that enables customized cables by utilizing risk pooling effects for customer satisfaction and green manufacturing. A two-stage approach was developed to implement the cut-to-order strategy, in which the inventory replenishment decision and cutting operations are determined, respectively. A case study was conducted to estimate the validity of the proposed approach and the results have shown its practical viability.

以文找文

期刊論文
1.	Ahmed, S.、Tawarmalani, M.、Sahinidis, N. V.(2004)。A finite branch-and-bound algorithm for two-stage stochastic integer programs。Mathematical Programming，100，355-377。
2.	Balinski, M. L.(1965)。Integer programming: methods, uses, computation。Management Science，12(3)，253-313。
3.	Baum, S.、Trotter, L.E. Jr.(1981)。Integer rounding for polymatroid and branching optimization problems。SIAM Journal on Algebraic and Discrete Methods，2，416-425。
4.	Beasley, J. E.(1985)。Algorithms for unconstrained twodimensional guillotine cutting。Journal of the Operational Research Society，36(4)，297-306。
5.	Belov, G.、Scheithauer, G.(2002)。A cutting plane algorithm for the one-dimensional cutting stock problem with multiple lengths。European Journal of Operational Research，141，274-294。
6.	Birge, J. R.、Louveaux, R. V.(1988)。A multicut algorithm for two-stage stochastic linear programs。European Journal of Operational Research，34，384-392。
7.	Cheng, C. H.、Feiring, B. R.、Cheng, T. C. E.(1994)。The cutting stock problem: a survey。International Journal of Production Economics，36(3)，291-305。
8.	Chien, C.-F.、Lee, C. Y.、Huang, Y. C.、Wu, W. T.(2009)。An efficient computational procedure for determining the container loading pattern。Computers and Industrial Engineering，56(3)，965-978。
9.	Chien, C.-F.、Tseng, F. P.、Chen, C. H.(2008)。An evolutionary approach to rehabilitation patient scheduling: a case study。European Journal of Operational Research，189(3)，1234-1253。
10.	Chien, C.-F.、Wu, W.(1998)。A recursive computational procedure for container loading。Computers and Industrial Engineering，35(1)，319-322。
11.	Dyckhoff, H.(1981)。A new linear programming approach to the cutting stock problem,ââOperations。Operations Research，29，1092-1104。
12.	Geoffrion, M.(1969)。An improved implicit enumeration approach for integer programming。Operations Research，17，437-454。
13.	Gilmore, P. C.、Gomory, R. E.(1966)。The theory andcomputation of knapsack functions。Operations Research，14，1045-1074。
14.	Gramani, M. C. N.、França, P.M.、Arenales, M.N.(2009)。A Lagrangian relaxation approach to a coupled lot-sizing and cutting stock problem。International Journal of Production Economics，119(2)，219-227。
15.	Hifi, M.、Ouafi, R.(1997)。Best-first search and dynamic programming methods for cutting problems: the cases of one of more stock plates。Computers and Industrial Engineering，32(1)，187-205。
16.	Hifi, M.、Zissimopoulos, V.(1996)。A recursive exact algorithm for weighted two-dimensional cutting。European Journal of Operational Research，91，553-564。
17.	Higle, J. L.、Lowe, W.W.、Odio, R.(1994)。Conditional stochastic decomposition: an algorithm interface for optimization and simulation。Operations Research，42，311-322。
18.	Higle, J. L.、Sen, S.(1991)。Stochastic decomposition: an algorithm for two-stage linear programs with recourse。Mathematics of Operations Research，16，650-669。
19.	Holthaus, O.(2003)。On the best number of different standard lengths to stock for one-dimensional assortment problems。International Journal of Production Economics，83(3)，233-246。
20.	Marcotte, O.(1985)。The cutting stock problem and integer rounding。Mathematical Programming，33，82-92。
21.	Poldi, K. C.、Arenales, M. N.(2009)。Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths。Computer and Operations Research，36，2074-2081。
22.	Scheithauer, G.、Terno, J.(1995)。The modified integer round-up property of the one-dimensional cutting stock problem。European Journal of Operational Research，84，562-571。
23.	Schultz, R.(1995)。On the structure and stability in stochastic programs with random technology matrix and complete integer recourse。Mathematical Programming，70，73-89。
24.	Van Slyke, R.、Wets, R. J.-B.(1969)。L-shaped linear programs with applications to optimal control and stochastic programming。SIAM Journal on Applied Mathematics，17，638-663。
25.	Wascher, G.、Gau, T.(1996)。Heuristics for the integer one-dimensional cutting stock problem: a computational study。OR Spectrum，18，131-144。
26.	余菁蓉、張瑞玫、俞旭昇、許和鈞(20090300)。A Linear Multiple Objective Programming for Assortment and Packing Problems。工業工程學刊，26(2)，77-86。延伸查詢
27.	Wu, J.-Z.、Chien, C.-F.、Gen, M.(2012)。Coordinating strategic outsourcing decisions for semiconductor assembly using a bi-objective genetic algorithm。International Journal of Production Research，50(1)，235-260。
28.	Gilmore, P. C.、Gomory, R. E.(1963)。A linear programming approach to the cutting stock problem - part II。Operations Research，11(6)，863-888。
29.	Chien, C.-F.、Deng, J. F.(2004)。A Container Packing Support System for Determining and Visualizing Container Packing Patterns。Decision Support Systems，37(1)，23-34。
30.	Chien, C. F.、Hsu, S. C.、Deng, J. F.(2001)。A Cutting Algorithm for Optimizing the Wafer Exposure Pattern。IEEE Transactions on Semiconductor Manufacturing，14(2)，157-162。
31.	Gilmore, P. C.、Gomory, R. E.(1961)。A Linear Programming Approach to the Cutting Stock Problem (Part 1)。Operation Research，9(6)，849-859。
32.	Suliman, S. M. A.(2001)。Pattern Generating Procedure for the Cutting Stock Problem。International Journal of Production Economics，74，293-301。
33.	Da Silveira, G.、Borenstein, D.、Fogliatto, F. S.(2001)。Mass Customization: Literature Review and Research Directions。International Journal of Production Economics，72(1)，1-13。
34.	Eppen, G.(1979)。Effects of Centralization on Expected Costs in a Multi-location Newsboy Problem。Management Science，25(5)，498-501。

推文
推薦
引用網址
引用嵌入語法
轉寄

top

:::

相關期刊
相關論文
相關專書
相關著作
熱門點閱

1.	A Linear Multiple Objective Programming for Assortment and Packing Problems

無相關博士論文

無相關書籍

無相關著作

1.	The Genetic Algorithm with Rough Set Theory Incorporated into the Patent Composition
2.	Solving the Economic Lot and Inspection Scheduling Problem Using the Extended Basic Period Approach Under Power-of-Two Policy
3.	Estimation on the Lower Confidence Limit of the Breaking Strength Percentiles Under Progressive Type-II Censoring
4.	The Effect of ESP Materials on College Athlete Students’ English Learning Motivation
5.	彈性專業化作為產業轉型途徑：以臺灣遊艇製造業為例
6.	以傳統產業的角度探討客製化程度與產品之成本、產量、回應速度之關係模式
7.	The Analysis of Customer Service Choices and Promotion Preferences Using Hierarchical Clustering
8.	The Application of Goal Programming to the Scheduling Problem of the Professional Baseball League
9.	大量客製化能力與敏捷性之研究：前置因素與對企業競爭優勢之影響
10.	新產品開發之組織間控制機制設計與開發績效關係之實證研究
11.	影響顧客關係管理效益之因素探討
12.	產品客製化之製造整合研究--以臺灣筆記型電腦業CTO模式為例
13.	Exploring the Practice of SMEs' Patent Management in Taiwan: A Case Study of IC Design Companies
14.	Supporting Customer-Company Interaction in Product Customization Using a Web-Based Collaborative VR Environment
15.	應用價值鏈與要徑法分析臺灣精密機械產業供應鏈網路體系

QR Code

臺灣人文及社會科學引文索引資料庫系統

詳目顯示

臺灣人文及社會科學引文索引資料庫