本研究有鑑於以往學者所構建零工式排程之數學模式,因整備時間之繁雜性及基於問題簡化的前題下,而未將之納入模式中考量,或直接將整備時間併入製程時間中計算,遂本研究擬將整備時間納入零工式排程問題中,分別探討獨立整備時間與相依整備時間兩者之異同,並以先後關係圖的觀念,以數理規劃方法,分別構建上述兩者之數學模式,並將所構建之數學模式以電腦軟體Lingo求解,以求得問題之最佳解.其次並對所構建之數學模式進行比較與分析,最後並結合多目標的方法,同時考量最小化平均流程時間,最小化工件延遲時間及最小化機器閒置時間等三個排程績效指標,以求得符合各目標下之一滿意的妥協解,期能使整個模式更具實用性,且能在實際操作中,有效提升製造系統與管理決策者之整體績效與效益,冀能以此研究探討之終極目標,得收學術與實務兩者並兼之雙效.

When dealing with job shop scheduling problems, the most common assumptionis that the time required to setup the facility(usually a machine)for the nexttask is independent of the task that was the immediate predecessor on the facility. Under this assumption, the setup time is either combined with or preceedes the processing time, and is solved either as a problem with no setup time or as a problem with sequence independent setup time. However, in many realistic problems, the setup time depends on the type of job recently completed as well as on the job to be processd. Moreover, the decision makers always concern morethan one performance measure when evaluate the constructed schedule. Therefore, in this research, Considering the job shop scheduling problemwith three kind of setup styles, which are no setup time, independent setup time, and dependent setup time, first, the addressed problem will be describedby the disjunctive graph representation, and then solved by the integer programming technique. Second, the performance of the schedule with certain setup style will be compared. Finally, the problem will take three performance measures which are mean flow time, mean job tardiness, and mean machine idle into account simultaneously