本論文探討ㄧ個雙流線型工廠的問題，此問題為兩座工廠皆為多階段流線型的生產 系統，兩廠間同ㄧ站有相同加工製程機台，可允許跨廠支援加工，並考慮工件族整備時 間以及有交期的限制下，建立一個穩健的生產排程。我們必須兼顧考慮減少整備時間以 及交期限制的情況下合併相同工件族的工件，在求得近似最佳績效之下能夠決定各工件 的跨廠加工途程及各機台工件加工順序。
本研究提出了群組演算法，同時考慮合併相同工件族之工件以減少整備時間，以及 各工件有不同的交期限制，無法將相同工件族之工件全部強制合併，否則則容易造成交 期晚的工件為了節省整備時間而排序在前面生產；交期早的工件則排序在後面生產，造 成績效變差。基於以上理由，發展出群組演算法，並證實群組演算法(GA-EDD-Group) 有良好的績效。尤其在整備時間大以及工件族個數大，但工件族個數又不能太極端(過 大)的情境之下，群組演算法會有很好的績效。
群組演算法的是以 EDD 排序為基礎合併相同工件族工件，合併績效好則選擇合 併，反之則不合併，所以群組演算法退而至少比僅以 EDD 排序好，進而可能合併到最 後可形成家族式派工的排序，不但節省大量的整備時間而且還考慮了交期的限制。故不 論任何的資料設定(Data Set)，群組演算法都有一定的績效，意即在實務上，群組演算法 會有一定的穩健度，如此通用性之大，則是本研究的貢獻。
然而，本研究還有一些延伸的空間。本研究之各工件的工件族假設為不會隨著站別 不同而改變，未來研究則可以考慮會隨著站別而改變各工件之工件族。而針對 Family 數很大的時候，EDD-Group 的改善率呈下降的狀態，此種情況與 Job 數、Family 數以及 Due date 之間有著很大的相依性，可做當大到何種程度時才會開始呈現下降的分析。另 外，可以利用其他巨集演算法(Meta-heuristic)配合群組演算法，求解此雙流線型工廠的
排程與本研究之基因演算法的績效，做求解品質及效率的比較。
參考文獻
英文部份：
Allahverdi A., Ng C. T., Cheng T. C. E. and Kovalyov M. Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Poerational Research 187:
985-1032.
Bonfill A, Espuna A, Puigjaner L. (2008). Decision support framework for coordinated production and transport scheduling in SCM. Comouters & Chemical Engineering 32:
1206-1224.
Eom D.H., Shin H.J., Kwun I.H., Shim J.K. and Kim S.S. (2002). Scheduling jobs on parallel machines with sequence-dependent family set-up times. International Journal of Advanced Manufacturing Technology19: 926-932
Guinet A. (2001). Multi-site planning: A transshipment problem. International Journal of Production Economics 74: 21-32.
Gnoni M.G.., Iavagnilio R., Mossa G., Mummolo G., Di Leva A. (2003). Production planning of a multi-site manufacturing system by hybrid modelling: A case study from the automotive industry. International Journal of Production Economics 85: 251-262.
Graham, R. L., Lawler, E. L., Lenstra, J. K. and Kan, R. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5: 287–326.
Holland, J. H. (1975). Adaptation in Neural and Artificial Systems. Ann Arbor, MI: Univ.
Michigan Press.
Jolai F. (2005). Minimizing number of tardy jobs on a batch processing machine with incompatible job families. European Journal of Operational Research 162: 184-190
Lee Y. H., Jeong C. S and Moon C. (2002). Advanced planning and scheduling with outsourcing in manufacturing supply chain. Computers & Industrial Engineering 43:
351-374.
Levis A. A. and Papageorgiou L. G.. (2004). A hierarchical solution approach for multi-site capacity planning under uncertainty in the pharmaceutical industry. Comouters &
Chemical Engineering 28: 707-725.
Moon, C., Kim, J., and Hur, S. (2002). Integrated process planning and scheduling with minimizing total tardiness in multi-plants supply chain. Computers & Industrial Engineering 43: 331-349.
Moon C. and Seo Y. (2005). Evolutionary algorithm for advanced process planning and scheduling in a multi-plant. Computers & Industrial Engineering 48: 311-325.
Omar M.K., Teo S.C. (2006). Minimizing the sum of earliness/tardiness in identical
parallel machines schedule with incompatible job families: An improved MIP approach.
Applied Mathematics and Computation 181: 1008-1017.
Potts C. N. and Kovalyov M. Y. (2000). Scheduling with batching: A review. European Journal of Poerational Research 120: 228-249.
Pearn W.L., Chung S.H., Yang M.H., Shiao K.P. (2008).Solution strategies for multi-stage wafer probing scheduling problem with reentry. Journal of the Operational Research Society 59: 637-651.
Sambasivan M. and Yahya S. (2005). A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers.
Comouters & Operations Research 32: 537-555.
Srinoi P., Shayan E., Ghotb F. (2006). A fuzzy logic modelling of dynamic scheduling in FMS.
International Journal of Production Research 44: 2183-2203
Toba, H., Izumi, H., Hatada, H. and Chikushima, T. (2005). Dynamic load balancing among multiple fabrication lines through estimation of minimum inter-operation time. IEEE Transactions on Semiconductor Manufacturing 18: 202-213.
Vercellis, C. (1999). Multi-plant production planning in capacitated self-configuring two-stage serial systems. European Journal of Operational Research 119: 451-460.
Wu, M. C. and Chang, W. J. (2007). A short-term capacity trading method for semiconductor fabs with partnership. Expert Systems with Applications 33: 476-483.
Wu, M. C., Chen, C. F. and Shih, C. F. (2008). Route planning for two wafer fabs with capacity-sharing mechanisms. International Journal of Production Research. (DOI:
10.1080/00207540802172029)
Yuan J.J., Liu Z.H., Ng C.T., Cheng T. C. E. (2006). Single machine batch scheduling problem with family setup times and release dates to minimize makespan. Journal of scheduling9: 499-513.
Yimer A.D., Demirli K. (2009). Fuzzy scheduling of job orders in a two-stage flowshop with batch-processing machines.International Journal of Approximate Reasoning 50: 117-137.
中文部分：
李佳諭，「流程式生產系統下混線生產重排程之研究」，屏東科技大學，碩士論文，民國 96 年。