| 期刊論文| 1. | Sciomachen, A.、Tanfani, E.(2007)。A 3D-BPP approach for optimising stowage plans and terminal productivity。European Journal of Operational Research，183(3)，1433-1446。   | | 2. | Mckendall, A. R.、Shang, J.、Kuppusamy, S.(2006)。Simulated annealing heuristics for the dynamic facility layout problem。Computers and Operations Research，33(8)，2431-2444。 | | 3. | Erel, E.、Ghosh, J. B.、Simon, J. T.(2003)。New heuristic for the dynamic layout problem。Journal of the Operational Research Society，54(12)，1275-1282。 | | 4. | Balakrishnan, J.、Cheng, C. H.、Conway, D. G.、Lau, C. M.(2003)。A hybrid genetic algorithm for the dynamic plant layout problem。International Journal of Production Economics，86(2)，107-120。 | | 5. | Mckendall, A. R.、Shang, J.(2006)。Hybrid ant systems for the dynamic facility layout problem。Computers and Operations Research，33(3)，790-803。 | | 6. | Pisinger, D.(2002)。Heuristics for the container loading problem。European Journal of Operational Research，141(2)，382-392。 | | 7. | Bortfeldt, A.、Gehring, H.、Mack, D.(2003)。A parallel tabu search algorithm for solving the container loading problem。Parallel Computing，29(5)，641-662。 | | 8. | Qu, Weishuang、Sanders, Jerry L.(1987)。A Nesting Algorithm for Irregular Parts and Factors Affecting Trim Losses。International Journal of Operation Research，25(3)，381-397。 | | 9. | Francis, E. H.、Chong T. Y.、Lee, F. C.(2002)。Pattern Nesting on Irregular-Shaped Stock Using Genetic Algorithms。Engineering Applications of Artificial Intelligence，15(6)，551-558。 | | 10. | Bennell, J. A.、Dowsland, W. B.、Dowsland, W. B.(2001)。The irregular cutting-stock problem-A new procedure for deriving the no-fit polygon。Computer and Operations Research，28，271-287。 | | 11. | Birgin, E. G.、Martinez, J. M.、Ronconi, D. P.(2005)。Optimizing the packing of cylinders into a rectangular container: A nonlinear approach。European Journal of Operational Research，160(1)，19-33。 | | 12. | Bischoff, E. E.(2006)。Thiee-dimensional packing of items with limited load bearing strength。European Journal of Operational Research，168(3)，952-966。 | | 13. | Betmell, J. A.、Oliveira, J. F.(2008)。The geometry of nesting problems: A tutorial。European Journal of Operational Research，184，397-415。 | | 14. | Gomes, A. M.、Oliveira, J. F.(2006)。Solving irregular strip packing problems by hybrid simulated annealing and linear programming。European Journal of Operational Research，171，811-829。 | | 15. | Johnson, D. S.、Demers, A.、Ullman, J. D.、Garey, F. M. R.、Graham, R. L.(1974)。Worst-case performance bounds for simple one-dimensional packing algorithms。SIAM Journal on Computing，3(4)，299-325。 | | 16. | Johnson, D. S.(1974)。Fast algorithms for bin packing。Journal of Computer Systems Science，8(3)，272-314。 | | 17. | Kelley, J. E. Jr.(1960)。The cutting-plane method for solving convex programs。Journal of the Society for Industrial and Applied，8(4)，703-712。 | | 18. | Bortfeldt, A.、Mack, D.(2007)。A heuristic for the three-dimensional strip packing proolem。European Journal of Operational Research，183(3)，1267-1279。 | | 19. | Ho, Z. P.、Wang, C. F.(2000)。Applying object-oriented technique to food and beverage scheduling problem。Food Science and Technology Conference on Taiwan，181，1-10。 | | 20. | Bmsco, M. J.(2004)。Optimal solution methods for the miniimm-backtracking row layout problem。IIE Transactions，36(2)，181-189。 | | 21. | Kure, Y.、Yang, F. L.、Jhou, M. J.(2010)。The principles of HACCP in food preparation and their applications。Quality Journal of Taiwan，46(1)，16-21。 | | 22. | Gehring, H.、Bortfeldt, A.(1997)。A genetic algorithm for solving the container loading problem。International Transactions in Operational Research，4(5/6)，401-418。 | | 23. | Gilmore, P. C.、Gomory, R. E.(1965)。Multistage cutting stock problems of two and more dimensions。Operations Research，13，94-120。 | | 24. | Gomes, A. M.、Oliveira, J. R.(2002)。A 2-exchange heuristic for nesting problems。European Journal of Operational Research，141，359-370。 | | 25. | Kure, Y.、Jhou, M. J.、Yang, F. L.(2010)。The great assistance of back-office layout in food and beverage industry toward the implementation of HACCP system。Quality Journal of Taiwan，46(1)，22-25。 | | 26. | Lee, Y.、Hsu, N. Y.(2007)。An optimization model for the container pre-marshalling problem。Computers and Operations Research，34(11)，3295-3313。 | | 27. | Lewis, J. E.、Ragade, R. K.、Kumar, A.、Biles, W. E.(2005)。A distributed chromosome genetic algorithm for bin-packing。Robotics and Computer-Integrated Manufacturing，21(4)，486-495。 | | 28. | Melachrinoudis, E.、Messac, A.(2005)。Consolidating a warehouse network: A physical programming approach。International Journal of Production Economics，97(1)，1-17。 | | 29. | Pisinger, D.(1999)。A tree-seaxch heuristic for the container loading problem。Ricerca Operativa，28，31-48。 | | 30. | Sleator, D.(1980)。Time optimal algorithm for packing in two dimensions。Information Processing Letters，10(1)，37-40。 | | 31. | Cheng, S. K.、Raos, K. P.(2000)。Large-scale nesting oi irregular patterns using compact neighborhood algorithm。Journal of Materials Processing Technology，103，135-140。 | | 32. | Chow, W. W.(1979)。Nesting of a single shape on a strip。International Journal of Production Research，17(4)，305-321。 | | 33. | Costa, M. T.、Gomes, A. M.、Oliveira, J. F.(2007)。Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet。European Journal of Operational Research。 | | 34. | Dantzig, G. B.(1957)。Discrete-variable extremum problems。Operations Research，5(2)，266-277。 | | 35. | Terwiesch, C.、Loch, C. H.(2004)。Collaborative prototyping and the pricing of custom-designed products。Management Science，50(2)，145-159。 | | 36. | Dikili, A. C.、Takinacl, A. C.、Pek, N. A.(2008)。A new heuristic approach to one-dimensional stock-cutting problems with multiple stock lengths in ship production。Ocean Engineering，35，637-645。 | | 37. | Dunker, T.、Radons, G.、Westkamper, E.(2005)。Comoming evolutionary computation and dynamic programming for solving a dynamic facility layout problem。European Journal of Operational Research，165(1)，55-69。 | | 38. | Egeblad, J.、Nielsen, B. K.、Odgaard, A.(2007)。Fast neighborhood search for two- and three-dimensional nesting problems。European Journal of Operational Research，183，1249-1266。 | | 39. | Eley, M.(2002)。Solving container loading problems by block arrangement。European Journal of Operational Research，141(2)，393-409。 | 會議論文| 1. | Ho, Z. P.、Pemg, C.、Chiou, W. C.(2003)。The analysis and design of computer aided employee skill evaluation system。Tai-Ping City, Taichung County, Republic of China。4(3)，1-5。 | | 2. | Ikonen, I. T.、Biles, W. E.、Kumar, A.、Ragade, F. R. K.、Wissel, J. C.(1997)。A genetic algorithm for packing three-dimensional non-convex objects having cavities and holes。MI. -United States of America。 | | 3. | Johnson, D. S.(1973)。Approximation algorithms for combinatorial problems38-49。 | 學位論文| 1. | Johnson, D. S.(1973)。Near-optimal bin packing algorithms(博士論文)。Massachusetts Institute of Technology。 | 圖書| 1. | Heesch, H.、Kienzle, O.(1963)。Flachenschluss。 | | 2. | Berkovitz, L.(2001)。Convexity and Optimization。 | | 3. | Martello, S.、Toth, P.(1990)。Knapsack vroblems: Algorithms and computer implementations。 | | 4. | Yang, H. H.、Lin, C. L.(2007)。On genetic algorithms for shoe making nesting- A Taiwan case。Expert Systems with Applications。 | | 5. | Bortfeldt, A.、Gehxing, H.(1997)。Applying tabu search to container loading problems。Operations Research Proceeding。 | | 6. | Lee, W. C.、Ma, H.、Cheng, B. W.(2008)。A heuristic for nesting problems of irregular shapes。Computer-Aided Design。 | |