| Summary: | 碩士 === 國立臺灣大學 === 工業工程學研究所 === 101 === To expand production-line capacity and increase factory output, a manufacturing company usually purchases new machines which possess higher production speed and manufacturing capacity than the original ones. It is also very often to distribute production to several machines in semiconductor industry since one order cannot be produced by one single machine. The above situations result in more complex scheduling problems. A compromised resolution is therefore needed. To that end, this research was carried out. Special attention was paid to a semiconductor company’s local assembly plant. In particular, the setup-time caused by changeover and the downtimes of machine used in die-mounting process were paid attention to. A mathematical programming model considering constraints of setup-time, machine quantity and volume of orders was constructed in which the objective function was selected to be the minimized completion time. Various possible conditions including different setup-times and unfinished production of orders were taken into consideration. LINGO was adopted to seek for the best solution. The result indicates that the completion time could be decreased by 21.6% when the advantage of production speed of the machine was taken. If uncertainties were considered, the near actual completion time and the longest completion time could be obtained for use in assessing the production cycle time.
|
|---|
