以工作為導向的啟發式排程系統發展

Abstract

以工作為導向的啟發式排程系統可有效地解決實際工業生產排程之問題。 其排程程序是每次只考量一個工作的排程規劃，必定排完一個工作之所有 作業時間表後，才會去排下一個工作。此外，系統能滿足個別工作之不同 排程需求。為擴展系統適用性，目前發展許多程序，例如：混合排程法、 最小處理時間法則、作業分割程序與部份排程法等，但在實作上，卻沒有 深入探討，如何使用這些排程方法，以排出不錯的初始排程計畫。因此， 本研究首先探討以工作為導向的啟發式排程系統之理論與方法，其次，結 合上述排程程序之優點，發展一套演算法，以滿足不同工作之需求，並產 生有效可行的排程結果。 Job Oriented Heuristic (JOH) scheduling system, reported by N.A. J. Hastings, provides feasible schedules for industrial production and which is computationally efficient for large scale problem. The system uses job oriented heuristics in which all the operations of one job are scheduled before the next job is considered. It allows individual jobs to have different objectives within the same scheduling run. In particular, procedures have been developed to extend the applicability of the JOH scheduling. These include hybrid scheduling; minimun in process time scheduling; operation splitting technique and partial scheduling. However, how to use these procedures to provide initially feasible schedules is noteworthy. Through the research of the JOH scheduling theory and methodology, a JOH scheduling algorithm is developed to meet particular objectives of individul jobs under forward or backward scheduling.