參考文獻 |
[1] Azizoglu, M., Webster, S. (2001). Scheduling a batch processing machine with incompatible job families. Computers & Industrial Engineering, 39(3-4), 325–335.
[2] Brucker, P., Jurisch, B., Sievers, B. (1994). A branch and bound algorithm for the job-shop scheduling problem. Discrete Applied Mathematics, 49(1-3), 107–127.
[3] Carlier, J., Pinson, E. (1989). An Algorithm for Solving the Job-Shop Problem. Management Science, 35(2), 164–176.
[4] Carlier, J., Pinson, E. (1994). Adjustment of heads and tails for the job-shop problem. European Journal of Operational Research, 78(2), 146–161.
[5] Carlier, J., Rebaï, I. (1996). Two branch and bound algorithms for the permutation flow shop problem. European Journal of Operational Research, 90(2), 238–251.
[6] Centeno, G., Armacost, R. L. (1997). Parallel machine scheduling with release time and machine eligibility restrictions. Computers & Industrial Engineering, 33(1-2), 273–276.
[7] Chandru, V., Lee C.Y., Uzsoy, R. (1993) Minimizing total completion time on batch processing machines, International Journal of Production Research, 31(9), 2097-2121
[8] Chen, H., B. Du., George Q,. Huang. 2011. “Scheduling a Batch Processing Machine with Non-Identical Job Sizes: A Clustering Perspective.” International Journal of Production Research 49 (19): 5755–5778.
[9] Dupont, L., Dhaenens-Flipo, C. (2002). Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure. Computers & Operations Research, 29(7), 807–819.
[10] El Adl, M.K., Rodriguez, A.A., Tsakalis, K.S. (1996). Hierarchical modeling and control of re-entrant semiconductor manufacturing facilities. Proceedings of the 35th Conference on Decision and Control, Kobe, Japan.
[11] Fowler, J.W., Hogg, G.L., Phillips, D.T. (1992) Control of multiproduct bulk service diffusion/oxidation processes. liE Transactions,24, 8~96.
[12] Garey, M.R., Johnson, D.S. (1979). Computers and intractability: a guide to the theory of NP-completeness. New York: Freeman
[13] Jamrus, T., Chien, C.F., Gen, M., Sethanan K. (2018). Hybrid Particle Swarm Optimization Combined with Genetic Operators for Flexible Job-Shop Scheduling Under Uncertain Processing Time for Semiconductor Manufacturing. IEEE Transactions on Semiconductor Manufacturing, 31(1), 32–41.
[14] Karimi, N., Davoudpour, H. (2015). A branch and bound method for solving multi-factory supply chain scheduling with batch delivery. Expert Systems with Applications, 42(1), 238–245.
[15] Li, X., Li, Y., Wang, Y. (2016). Minimizing makespan on a batch processing machine using heuristics improved by an enumeration scheme. International Journal of Production Research, 55(1), 176–186.
[16] Li, X.L., Li, Y.P., Wang, Y. (2017). Minimising makespan on a batch processing machine using heuristics improved by an enumeration scheme, International Journal of Production Research, 55:1, 176-186.
[17] Mason, S.J., Fowler, J.W., Carlyle, W.M., Montgomery, D.C. (2005). Heuristics for minimizing total weighted tardiness in complex job shops, International Journal of Production Research, 43:10, 1943-1963.
[18] Mazdeh, M. M., Sarhadi, M., Hindi, K. S. (2007). A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs. European Journal of Operational Research, 183(1), 7486.
[19] Mönch, L., Fowler, J. W., Dauzère-Pérès S., Mason, S. J., Rose, O. (2011). A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations. Journal of Scheduling, 14(6), 583–599.
[20] Rossi, A., Dini, G. (2007). Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimization method. Robotics and Computer-Integrated Manufacturing, 23(5), 503–516.
[21] Sangsawang, C., Sethanan, K., Fujimoto, T., Gen, M. (2015). Metaheuristics optimization approaches for two-stage reentrant flexible flow shop with blocking constraint. Expert Systems with Applications, 42(5), 2395–2410.
[22] Scholl, W., Domaschke, J. (2000). Implementation of modeling and simulation in semiconductor wafer fabrication with time constraints between wet etch and furnace operations. IEEE Transactions on Semiconductor Manufacturing, 13(3), 273–277.
[23] Sforza, A., Sterle, C. (Eds.). (2017). Optimization and Decision Science: Methodologies and Applications. Springer Proceedings in Mathematics & Statistics.
[24] Sheen, G.J., Liao, L.W. (2007). A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags. European Journal of Operational Research, 181(1), 102–116.
[25] Tangudu, S. K., Kurz, M. E. (2006). A branch and bound algorithm to minimize total weighted tardiness on a single batch processing machine with ready times and incompatible job families. Production Planning & Control, 17(7), 728–741.
[26] Thitipong J., Chen F. C., Mitsuo G., Kanchana S. (2018). Hybrid Particle Swarm Optimization Combined with Genetic Operators for Flexible Job-Shop Scheduling Under Uncertain Processing Time for Semiconductor Manufacturing. IEEE transactions on semiconductor manufacturing, vol. 31, no. 1, 32-41.
[27] Uzsoy, R. (1995). Scheduling batch processing machines with incompatible job families. International Journal of Production Research, 33(10), 2685–2708.
[28] Uzsoy, R., Lee, CY. and Martin-Vega, L.A. (1992) A review of production planning and scheduling models in the semiconductor industry, part I: system characteristics, performance evaluation and production planning. liE Transactions, 24, 47-60.
[29] Wang, H.K., Chien, C.F., Gen, M. (2015). An Algorithm of Multi-Subpopulation Parameters with Hybrid Estimation of Distribution for Semiconductor Scheduling With Constrained Waiting Time. IEEE Transactions on Semiconductor Manufacturing, 28(3), 353–366.
[30] Xiao H. (2000). Introduction to semiconductor manufacturing technology. New Jersey: Prentice Hall. |