這個研究討論的彈性零工式排程問題有許多限制。我們的研究與一般的彈性零工式排程問題的不同之處在於考慮了機器預防性維護和操作並行分批。在處理完工序後，機器上會產生堆積物。如果堆積物累積達到上限，機器就需要進行預防性維護，以清潔和保養機器。我們提出了一種解決這個雙目標排程問題的演算法。該演算法的初始族群可以通過隨機生成個體或部分利用可排程操作（）來形成，並且考慮了新型操作限制，稱為機器預防性維護。我們提出了新的鄰域結構，用於處理堆積物和機器預防性維護。同時，我們提出了新的高效搜索策略，以找到更好的解決方案。目標是最小化兩個標準，即最小化總遲延和完成時間。;The flexible job shop scheduling problem discussed in this study has many restrictions. The difference between our research and the general flexible job shop scheduling problem is that the machine preventive maintenance and operation parallel batching has been considered. After processed operations, deposits will be generated on the machine. If the accumulation of deposits reaches the upper limit, the machine needs to do the preventive maintenance to clean and maintain the machine. We propose an algorithm for solving this bi-objective scheduling problem. The initial population of this algorithm is formed by either randomly generating individuals or partially generating them by utilizing schedulable operations (omega), and considered the new type operation constraint called machine preventive maintenance. The new neighborhood structure for deposits and machine preventive maintenance is proposed. The new and efficient search strategy is proposed to find a better solution. The objective is the minimization of two criteria, minimize the total tardiness and the makespan.
