空間排程問題對於高科技設備製造商的工作效率來說是一個重要的議題，現存解決空間排程問題的方法總是會造成訂單延遲或過早被完成，這為製造商帶來巨大的財務上的懲罰。 本研究針對此問題發展出ㄧ新的空間配置演算法，命名為「擬似三維空間配置演算法」，並與西北演算法和最大接觸法，運用不同的派工法則，比較各項績效指標的表現。本研究目的為對空間排程問題，找到一個排程計畫來減少總懲罰(提早與延遲懲罰)。 根據隨機集區實驗與因子實驗結果分析，本研究證明擬似三維概念空間配置法相較於以前的空間配置演算法可更有效降低提早與延遲訂單的懲罰成本。它在其它一些績效指標也比其他演算法有更好的表現 (提早訂單數、提早總天數)，且它在其餘績效指標的表現也不輸給其他演算法(製距、延遲工作數、總延遲天數、空間利用率)。雖然此演算法並沒有在所有的績效指標都有突出的表現，但它對於整個問題有更完整的思考性。在研究最後，針對不同績效指標建議採用的派工法則和空間配置演算法也在實驗中被獲得。 A space scheduling problem is an important issue of work efficiency for high-tech equipment manufacturers. The existing approaches to solve a space scheduling problem always cause orders (jobs) to be completed too late or too early. It brings huge financial penalties to manufacturers. In this study, the purpose of this research is to find a schedule to r total penalties (early and tardy penalties) for a space scheduling problem. A new space allocation algorithm, namely, Quasi-Three-Dimensional Space Allocation Algorithm (QTDSA) was developed. We compared its performance for different performance indicators with those of the Northwest Algorithm (NWA) and Longest Contact Edge Algorithm (LCEA) by different dispatching rules. In addition, randomized block designs and factorial designs were employed for statistical analysis. The results demonstrated that the QTDSA is more effective than the other space allocation algorithms in reducing total penalties. It also has better performances for some other performance indicators (i.e. number of early jobs and total earliness) than the other algorithms. The performance of the QTDSA and the other algorithms are about the same for the other performance indicators (makespan, number of tardy jobs, total tardiness and space utilization). In the final part of the research, suggested dispatching rules and suggested space allocation algorithms for each performance indicator were also provided.
