IC 封裝(Integrated circuit packaging) 是半導體製程之後段製程，主要目的為保護IC 晶片、提供散熱以及IC 晶片上元件之連結。烘烤作業則是IC 封裝製程之後段程序，接續在封膠(molding) 程序之後，其目的為藉由烘烤將IC 上封膠完全固化以及除去IC 晶片內部水氣，確保IC 功能正常。而在烘烤作業後之作業程序多為IC 外觀調整之程序，如剪切、成形以及打印，最後經過檢驗後IC封裝製程即完成。
烘烤程序需在固定溫度下持續烘烤才能使IC 中之水氣去除以及使膠體固化。若在烘烤過程開啟烤箱會使外部環境之空氣進入烤箱，導致烤箱內部溫度降低以及溼度提昇。使烘烤作業時間拉長或者沒辦法完全去除水氣、固化膠體。然而等待烤箱內IC 烘烤後取出再放入新的IC 則會使烤箱利用率不佳。
在實務上面對這個問題，是額外增加烘烤一段時間以降低頻繁開啟烤箱所造成的影響。舉例來說，若有一批物品需要完整接受烘烤八小時( 即不考慮烤箱開啟烤箱時降低烘烤的效果) 才能除去元件內部的水氣，在實務是以烘烤八個半小時甚至是九個小時來消弭頻繁開啟烤箱所造成的影響。然而這個方法並未真正解決造成烘烤不完全的原因，且這些額外烘烤時間會造成烤箱利用率降低，並非為治本的方法。
本論文即是以IC 封裝烘烤作業為研究對象，建構問題模式，並設計一演算法決定每個庫存物品的儲位以及放入與取出時間，探討如何擺放IC 以及何時擺放、取出可使烤箱開啟次數降低。

IC packaging is ¯nal stage in semiconductor device fabrication. Its main purpose is to protect IC chip and interconnect of devices. Oven operation is back-end process
of IC packaging. Oven operation makes sure normal unctions of IC chip by solidifying an encapsulant and evaporating.
Oven operation can reach the goal by baking at constant temperature and constant time. If the oven is opened during baking, the temperature of the oven will drop
and the humidity int the oven will raise. However, the oven utilization is low if putting incoming lots in the oven after baking end of lots in the oven.
This problem is solved in practice by adding extra baking time to reduce the influence of opening the oven. For example, if the baking time of the lot is 8 hours, it
will be baked 8.5 hours or 9 hours actually. This action does not settle the real reason of causing incomplete baking and extra baking time also causes lower oven utilization.
This thesis focuses on oven operation in IC packaging. Construct the problem model and then propose an algorithm to solve this problem. Decide the oven location,
start-baking time and end-baking time for each lot.

Al-Sultan, K. S. and Al-Fawzan, M. A. A tabu search approach to the uncapacitated
facility location problem. Annals of Operations Research, 86, 91-103, 1999.
Berman, O., Drezner, Z. and Wesolowsky, G. O. Location of facilities on a network
with groups of demand points. IIE Transactions, 33(8), 637-648, 2001.
Caron, F., Marchet, G. and Perego, A. Routing policies and coi-based storage policies
in picker-to-part systems. International Journal of Production Research, 36(3),
713-732, 1998.
de Koster, M. B. M., van der Poort, E. S. and Wolters, M. E±cient orderbatching
methods in warehouses. International Journal of Production Research, 37(7),
1479-1504, 1999.
de Koster, R., Le-Duc, T. and Roodbergen, K. J. Design and control of warehouse
order picking: A literature review. European Journal of Operational Research,
182(2), 481-501, 2007.
Fernandez, E. and Puerto, J. Multiobjective solution of the uncapacitated plant loca-
tion problem. European Journal of Operational Research, 145(3), 509-529, 2003.
Francis, R. L., McGinnis, L. F. and White, J. A. Facility Layout and Location: An
Analytical Approach. Prentice Hall, 1992.
Frazelle, E. H. World-class Warehousing and Material Handling. McGraw-Hill, 2001.
Gademann, N. and van de Velde, S. Order batching to minimize total travel time in a
parallel-aisle warehouse. IIE Transactions, 37(1), 63-75, 2005.
Goetschalckx, M. and Ratli, H. D. Shared storage policies based on the duration stay
of unit loads. Management Science, 36(9), 1120-1132, 1990.
Gu, J. X., Goetschalckx, M. and McGinnis, L. F. Research on warehouse operation: A
comprehensive review. European Journal of Operational Research, 177(1), 1-21,
2007.
Hausman, W. H., Schwarz, L. B. and Graves, S. C. Optimal storage assignment in
automatic warehousing systems. Management Science, 22(6), 629-638, 1976.
Hu, Y. H., Huang, S. Y., Chen, C. Y., Hsu, W. J., Toh, A. C., Loh, C. K. and Song,
T. C. Travel time analysis of a new automated storage and retrieval system.
Computers & Operations Research, 32(6), 1515-1544, 2005.
Jane, C. C. and Laih, Y. W. A clustering algorithm for item assignment in a syn-
chronized zone order picking system. European Journal of Operational Research,
166(2), 489-496, 2005.
Jarvis, J. M. and McDowell, E. D. Optimal product layout in an order picking ware-
house. IIE Transactions, 23(1), 93-102, 1991.
Jewkes, E., Lee, C. and Vickson, R. Product location, allocation and server home base
location for an order picking line with multiple servers. Computers & Operations
Research, 31(4), 623-636, 2004.
Kim, K. H. and Park, K. T. Dynamic space allocation for temporary storage. Inter-
national Journal of Systems Science, 34(1), 11-20, 2003a.
Kim, K. H. and Park, K. T. A note on a dynamic space-allocation method for outbound
containers. European Journal of Operational Research, 148(1), 92-101, 2003b.
Kulturel, S., Ozdemirel, N. E., Sepil, C. and Bozkurt, Z. Experimental investigation of
shared storage assignment policies in automated storage/retrieval systems. IIE
Transactions, 31(8), 739-749, 1999.
Larson, T. N., March, H. and Kusiak, A. A heuristic approach to warehouse layout
with class-based storage. IIE Transactions, 29(4), 337-348, 1997.
Le-Duc, T. and Koster, R. de. Travel time estimation and order batching in a 2-block
warehouse. European Journal of Operational Research, 176(1), 374-388, 2007.
Lee, M. K. and Elsayed, E. A. Optimization of warehouse storage capacity under a
dedicated storage policy. International Journal of Production Research, 43(9),
1785-1805, 2005.
Lin, T. Y., Njoman, B., Crouthamel, D., Chua, K. H., Teo, S. Y. and Ma, Y. Y.
The impact of moisture in mold compound preforms on the warpage of PBGA
packages. Microelectronics Reliability, 44(4), 603-609, 2004.
Lwo, B. J. and Lin, C. S. Measurement of moisture-induced packaging stress with
piezoresistive sensors. IEEE Transactions on Advanced Packaging, 30(3), 393-
401, 2007.
McKendall, A. R. and Jaramillo, J. R. A tabu search heuristic for the dynamic space
allocation problem. Computers & Operations Research, 33(3), 768-789, 2005.
Meller, R. D. and Klote, J. E. A throughput model for carousel/vlm pods. IIE
Transactions, 36(8), 725-741, 2004.
Montulet, P., Langevin, A. and Riopel, D. Minimizing the peak load: an alternate
objective for dedicated storage policies. International Journal of Production Re-
search, 36(5), 1369-1385, 1998.
Moon, G. and Kim, G. P. Eects of relocation to as/rs storage location policy with
production quantity variation. Computers & Industrial Engineering, 40(1-2),
1-13, 2001.
Oliveira, J. A. Scheduling the truckload operations in automatic warehouses. European
Journal of Operational Research, 179(3), 723-735, 2007.
Park, B. C. and Lee, M. K. Closest open location rule under stochastic demand.
International Journal of Production Research, 45(7), 1695-1705, 2007.
Petersen, C. G. An evaluation of order picking routing policies. International Journal
of Operations & Production Management, 17(11), 1098-1111, 1997.
Petersen, C. G. Considerations in order picking zone con¯guration. International
Journal of Operations & Production Management, 22(7-8), 793-805, 2002.
Petersen, C. G. and Aase, G. A comparison of picking, storage, and routing policies
in manual order picking. International Journal of Production Economics, 92(1),
11-19, 2004.
Petersen, C. G. and Schmenner, R. W. An evaluation of routing and volume-based
storage policies in an order picking operation. Decision Sciences, 30(2), 481-501,
1999.
Salzano, L. J., Wilkinson, C. and Sandborn, P. A. Environmental quali¯cation test-
ing and failure analysis of embedded resistors. IEEE Transactions on Advanced
Packaging, 28(3), 503-520, 2005.
van den Berg, J. P. and Gademann, A. Optimal routing in an automated stor-
age/retrieval system with dedicated storage. IIE Transactions, 31(5), 407-415,
1999.
van den Berg, J. P., Sharp, G. P., Gademann, A. and Pochet, Y. Forward-reserve
allocation in a warehouse with unit-load replenishments. European Journal of
Operational Research, 111(1), 98-113, 1998.
5