Future Research

From this dissertation, three possible concerns might be useful in further research.

The first concern involves solving the two scheduling problems using metaheuristic solution procedures, such as tabu search (TS), genetic algorithm (GA), and simulated annealing (SA), since metaheuristics have been widely applied in the investigations of scheduling problems. The metaheuristics can embed the solutions obtained in this dissertation as the initial solutions and then apply more general solution procedures that explore the solution space to identify good solutions. Moreover, the second concern is to solve another type of scheduling problem in TFT-LCD factories, such as a batch processing machine scheduling problem with the consideration of unequal ready times and multiple-batch operations in cell assembly process. Finally, the third concern is the need to minimize the maximum completion time involved in the consideration of setup times for the parallel batch processing machine scheduling problem with the characteristics of unequal ready times, setup times, and incompatible product families.

References

[1] Allahverdi, A., Gupta, J. N. D. and Aldowaisan, T., “A review of scheduling research involving setup considerations,”Omega-International Journal of Management Science, 27, pp. 219- 239, 1999.

[2] Archetti, C., Hertz, A. and Speranza, M. G., “Metaheuristics for the team orienteering problem,”Journal of Heuristics, 13, pp. 49- 76, 2007.

[3] Balas, E., “The prize collecting traveling salesman problem,”Networks, 19, pp. 621-636, 1989.

[4] Baptiste, P., Marek, C., Dürr, C., Jawor, W. and Vakhania, N., “Preemptive scheduling of equal-length jobs to maximize weighted throughput,”Operations Research Letters, 32, pp. 258- 264, 2004.

[5] Bar-Yehuda, R., Even, G. and Shahar, S. M., “On approximating a geometric prize-collecting traveling salesman problem with time windows,” Journal of Algorithms, 55, pp. 76- 92, 2005.

[6] Bilge, U., Kirac, F., Kurtulan, M. and Pekgun, P., “A Tabu search algorithm for parallel machine total tardiness problem,”Computers and Operations Research, 31, pp.

397- 414, 2004.

[7] Bodin, L. D., Golden, B. L., Assad, A. A. and Ball, M. O., “Routing and scheduling of vehicles and crews: the state of the art,” Computers and Operations Research, 10, pp. 63- 211, 1983.

[8] Bräysy, O. and Gendreau, M., “Vehicle routing problem with timewindows, part I:

route construction and local search algorithms,” Transportation Science, 39, pp. 104-118, 2005.

[9] Bräysy, O. and Gendreau, M., “Vehicle routing problem with time windows,partII: metaheuristics,” Transportation Science, 39, pp. 119- 139, 2005.

[10] Butt, S. E. and Cavalier, T. M., “A heuristic for the multiple tour maximum collection problem,” Computers and Operations Research, 21, pp. 101- 111, 1994.

[11] Butt, S. E. and Ryan, D. M., “An optimal solution procedure for the multiple tour maximum collection problem using column generation,”Computers and Operations Research, 26, pp. 427- 441, 1999.

[12] Chandru, V., Lee, C. Y. and Uzsoy, R., “Minimizingtotal completion time on a batch processing machines with job families,” Operations Research Letters, 13, pp. 61-65, 1993.

[13] Chandru, V., Lee C. Y. and Uzsoy, R., “Minimizingtotal completion time on a batch processing machines,”International Journal of Production Research, 31, pp.

2097- 2121, 1993.

[14] Chang, P. Y., Damodaran, P. and Melouk, S., “Minimizing makespan on parallel batch processing machines,”International Journal of Production Research, 42, pp.

4211- 4220, 2004.

[15] Chang, P. C. and Wang, H. M., “A heuristic for a batchprocessing machine scheduled to minimise total completion time with non-identical job sizes,” International Journal of Advanced Manufacturing Technology, 24, pp. 615- 620, 2004.

[16] Chao, I. M., Golden, B. L. and Wasil, E. A., “A fastand effective heuristic forthe orienteering problem,”European Journal of Operational Research, 88, pp. 475- 489, 1996.

[17] Chao, I. M., Golden, B. L. and Wasil, E. A., “The team orienteering problem,”

European Journal of Operational Research, 88, pp. 464- 474, 1996.

[18] Chao, Y. F., “The production planning for LCD cell forming process,” thesis, Department of Industrial Engineering and Engineering Management in National Tsing Hua University, Taiwan, 2005.

[19] Cheng, T. C. E. and Sin, C. C. S., “A state-of-the-art review of parallel-machine scheduling research,” European Journal of Operational Research, 47, pp. 271- 292, 1990.

[20] Chou, F. D., “A joint GA+DP approach for single burn-in oven scheduling problems with makespan criterion,” International Journal of Advanced Manufacturing Technology, 35, pp. 587- 595, 2007.

[21] Chou, F. D., Chang, P. C. and Wang, H. M., “A hybrid genetic algorithm to minimize makespan for the single batch machine dynamic scheduling problem,”

International Journal of Advanced Manufacturing Technology, 31, pp. 350- 359, 2006.

[22] Chou, F. D. and Wang, H. M., “Scheduling for a single semiconductor batch-processing machine to minimize total weighted tardiness,” Journal of the Chinese Institute of Industrial Engineers, 2007 (accepted).

[23] Christofides, N., Mingozzi, A., Toth, P. and Sandi, C., Combinatorial Optimization, John Wiley & Sons: New York, 1979.

[24] Chu, C., “A branch-and-bound algorithm to minimize total flow time with unequal release dates,”Naval Research Logistics, 39, pp. 859- 875, 1992.

[25] Damodaran, P. and Srihari, K., “Mixed integer formulation to minimize makespan in a flow shop with batch processing machines,” Mathematical and Computer Modelling, 40, pp. 1465- 1472, 2004.

[26] Deng, X., Feng, H., Zhang, P., Zhang Y. and Zhu, H., “Minimizing mean completion time in a batch processing system,” Algorithmica, 38, pp. 513- 528, 2004.

[27] Deng, X., Feng, H., Li, G. and Shi, B., “A PTAS for semiconductor burn-in scheduling,” Journal of Combinatorial Optimization, 9, pp. 5- 17, 2005.

[28] Dumas, Y., Desrosiers, J., Gelinas, E. and Solomon, M. M., “An optimal algorithm for the traveling salesman problem with time windows,”Operations Research, 43, pp. 367- 371, 1995.

[29] DuPont, L. and Dhaenens-Flipo, C., “Minimizing themakespan on a batch machine with non-identical job sizes:an exactprocedure,” Computers & Operations Research, 29, pp. 807- 819, 2002.

[30] DuPont, L. and Ghazvini, F. J., “A branch and bound algorithm for minimizing mean flow time on a single batch processing machine,” International Journal of Industrial Engineering, 4, pp.197- 203, 1997.

[31] Erramilli, V. and Mason, S. J., “Multiple orders per job compatible batch scheduling,”IEEE Transactions on Electronics Packaging Manufacturing, 29 (4), pp.

285- 296, 2006.

[32] Feillet,D., Dejax, F. and Gendreau, M., “Traveling salesman problems with profits,” Transportation Science, 39(2), pp. 188- 205, 2005.

[33] Frederickson, G. N., “Approximation algorithms for some postman problems,”

Journal of the Association for Computing Machinery, 26(3), pp. 538- 554, 1979.

[34] Fung, S. P. Y., Chin, F. Y. L. and Shen, H., “Online scheduling of unit jobs with bounded importance ratio,”International Journal of Foundations of Computer Science, 16(3), pp. 581- 598, 2005.

[35] Gendreau, M., Hertz, A., Laporte, G. and Stan, M., “A generalizedinsertion heuristic for the traveling salesman problem with time windows,” Operations Research, 46, pp. 330- 335, 1998.

[36] Gensch, D. H., “An industrial application of the traveling salesman’s subtour problem,”AIIE Transactions, 10, pp. 362-370, 1978.

[37] Ghazvini, F. J. and DuPont, L., “Minimizing meanflow times criteria on a single batch processing machine with non-identical jobs sizes,” International Journal of Production Economics, 55, pp. 273- 280, 1998.

[38] Golden, B. L., “Evaluate a sequentialvehicle routing algorithm,”AIIE Transactions, 9, pp. 204-208, 1977.

[39] Golden, B. L., Levy, L. and Vohra, R., “The orienteering problem,” Naval Research Logistics, 34, pp. 307-318, 1987.

[40] Golden, B. L., Wang, Q. and Lin, L., “A multifaceted heuristic forthe orienteering problem,” Naval Research Logistics, 35, pp. 359-366, 1988.

[41] Goldratt, E. M., Theory of Constraints: What is This Thing Called the Theory of Constraints and How Should It be Implemented?, New York: North River, 1990.

[42] Gupta, A. K. and Sivakumar, A. I., “Optimization ofdue-date objectives in scheduling semiconductor batch manufacturing,” International Journal of Machine Tools & Manufacturing, 46, pp.1671- 1679, 2005.

[43] Gupta, J. N. D. and Ruiz-Torres, A. J., “Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs,” European Journal of Operational Research, 167, pp. 679- 695, 2005.

[44] Hiraishi, K., Levner, E., and Vlach, M., “Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs,”Computers and Operations Research, 29, pp. 841- 848, 2002.

[45] Hu, Y. J., “Lot sizing scheduling for color filter production” thesis,Departmentof Industrial Engineering and Engineering Management in National Tsing Hua University, Taiwan, 2003.

[46] Hwang, T. K. and Chang, S. C., “Design of a lagrangian relaxation-based hierarchical production scheduling environment for semiconductor wafer fabrication,”IEEE Transactions on Robotics and Automation, 19(4), pp. 566- 578, 2003.

[47] Jeong, B., Kim, S. W. and Lee, Y. J., “An assembly scheduler for TFT LCD manufacturing,”Computers & Industrial Engineering, 41, pp. 37- 58, 2001.

[48] Jeong, B., Sim, S. B., Jeong, H. S. and Kim, S. W., “An available-to-promise system for TFT LCD manufacturing in supply chain,”Computers & Industrial Engineering, 43, pp. 191- 212, 2002.

[49] Kashan, A. H., Karimi, B. and Jolai, F., “Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes,”International Journal of Production Research, 44, pp. 2337- 2360, 2006.

[50] Lai, C. L., “Lot sizing scheduling for color filter RGB process,” thesis,Department of Industrial Engineering and Engineering Management in National Tsing Hua University, Taiwan, 2005.

[51] Lee, C. Y. and Uzsoy, R., “Minimizing makespan on a single batch processing machine with dynamic job arrivals,”International Journal of Production Research, 37 (1), pp. 219- 236, 1999.

[52] Lee, C. Y., Uzsoy, R. and Martin-Vega L. A., “Efficient algorithms for scheduling semiconductor burn-in operations,”Operations Research, 40 (4), pp. 764- 775, 1992.

[53] Lee, Y. H. and Lee, B., “Push-pull production planning of the re-entrant process,”

International Journal of Advanced manufacturing technology, 22, pp. 922- 931, 2003.

[54] Lenstra, J. K. and Rinnooy Kan, A. H. G., “Complexity of vehicle routing and scheduling problems,”Networks, 11, pp. 221- 227, 1981.

[55] Li, C. L. and Lee, C. Y., “Scheduling with agreeablerelease times and due dates on a batch processing machine,” European Journal of Operational Research, 96, pp. 564-569, 1997.

[56] Lin, J. T. and Chen, Y. Y., “A multi-site supply network planning problem considering variable time buckets- A TFT-LCD industry case,”International Journal of Advanced manufacturing technology, 33, pp. 1031- 1044, 2007.

[57] Lin, J. T., Chen T. L. and Chen, W. J., “Capacity and product mix planning problem for TFT array multi-plant,” Journal of the Chinese Institute of Industrial Engineers, 24 (6), pp. 489- 504, 2007.

[58] Little, J., Murty, K., Sweeney, D. and Karel. C., “An algorithms for the traveling salesman problem,”Operations Research, 11, pp. 972- 989, 1963.

[59] Mathirajan, M. and Sivakumar, A. I., “A literature review,classification and simple meta-analysis on scheduling of batch processors in semiconductor,” International Journal of Advanced manufacturing technology, 29, pp. 990- 1001, 2006.

[60] Melouk, S., Damodaran, P. and Chang, P. Y., “Minimizing makespan forsingle machine batch processing with non-identical job sizes using simulated annealing,”

International Journal of Production Economics, 87, pp. 141- 147, 2004.

[61] Mokotoff, E., “Parallelmachine scheduling problems:a survey,” Asia-Pacific Journal of Operational Research, 18, pp. 193- 242, 2001.

[62] Mönch, L., Balasubramanian, H., Fowler, J. W. and Pfund, M. E., “Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times,”Computer & Operations Research, 32, pp. 2731- 2750, 2005.

[63] Mönch, L., Unbehaun, R. and Choung, Y. I., “Minimizingearliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint,” OR Spectrum, 28, pp.177- 198, 2006.

[64] Mönch, L. and Unbehaun, R., “Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date,” Computer &

Operations Research, 34, pp. 3380- 3396, 2007.

[65] Pearn, W. L., Chung, S. H. and Yang, M. H., “The wafer probing scheduling problem (WPSP),”Journal of the Operational Research Society, 53, pp. 864-874, 2002.

[66] Pearn, W. L., Chung, S. H. and Yang, M. H., “A case study on the wafer probing scheduling problem,”Production Planning and Control, 13(1), pp. 66- 75, 2002.

[67] Pearn, W. L., Chung, S. H. and Yang, M. H., “Minimizing the total machine workload for the wafer probing scheduling problem,”IIE Transactions, 34, pp.

211-220, 2002.

[68] Pearn, W. L., Chung, S. H., Yang, M. H. and Chen, Y. H., “Algorithms for the wafer probing scheduling problem with sequence-dependent set-up time and due date restrictions,”Journal of the Operational Research Society, 55, pp. 1194-1207, 2004.

[69] Pearn, W. L., Chung, S. H., Chen, A. Y. and Yang, M. H., “A case study on the multistage IC final testing scheduling problem with reentry,”International Journal of Production Economics, 88, pp. 257-267, 2004.

[70] Poon, C. K. and Zhang, P., “Minimizing makespan inbatch machine scheduling,” Algorithmica, 39, pp. 155- 174, 2004.

[71] Poon, C. K. and Yu, W., “On minimizing total completion time in batch machine scheduling,” International Journal of Foundations of Computer Science, 15, pp. 593- 607, 2004.

[72] Poon, C. K. and Yu, W., “On-line scheduling algorithms for a batch machine with finite capacity,” Journal of Combinatorial Optimization, 9, pp. 167- 186, 2005.

[73] Pott, C. N. and Kovalyov, M. Y., “Scheduling with batching:A review,” European Journal of Operational Research, 120, pp. 228- 249, 2000.

[74] Rojanasoonthon, S., Bard, J. F. and Reddy, S. D., “Algorithms for parallel machine scheduling: a case study of the tracking and data relay satellite system,”

Journal of the Operational Research Society, 54, pp. 806- 821, 2003.

[75] Rosenkrantz, D. J., Stearns, R. E. and Lewis, P. M., “An analysis of several heuristics for the traveling salesman problem,”SIAM Journal on Computing, 6, pp.

563-581, 1977.

[76] Sen, T., Sulek, J. and Dileepan, P., “Static scheduling to minimize weighted and unweighted tardiness: a state-of-the-art survey,”International Journal of Production Economics, 83, pp. 1- 12, 2003.

[77] Shin, H. J. and Leon, V. J., “Scheduling with product family set-up times: an application in TFT LCD manufacturing,”International Journal of Production Research, 42, pp. 4235- 4248, 2004.

[78] So, K. C., “Some heuristics for scheduling jobs on parallel machines with setups,”

Management Science, 36, pp. 467- 475, 1990.

[79] Solomon, M. M., “Algorithms for the vehicle routing and scheduling problems with time windows constraints,”Operations Research, 35, pp. 254- 265, 1987.

[80] Su, C. T., Wang, P. S. and Hsu, C. C., “Effective Approaches for Low Temperature Polysilicon TFT LCD Post-Mapping Yield Control Problem,”IEEE Transactions on Automation Science and Engineering, 2, pp. 198- 206, 2005.

[81] Su, C. T. and Yang, C. H., “Two-phased meta-heuristic methods for the post-mapping yield control problem,”International Journal of Production Research, 44, pp. 4837- 4854, 2006.

[82] Sung, C. S. and Choung, Y. I., “Minimizing makespan on a single burn-in oven in semiconductor manufacturing,”European Journal of Operational Research, 120, pp.

559- 574, 2000.

[83] Sung, C. S., Choung, Y. I., Hong, J. M. and Kim, Y. H., “Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals,”Computer &

Operations Research, 29, pp. 995- 1007, 2002.

[84] Tang, H. and Miller-Hooks, E., “A tabu search heuristic for the team orienteering problem,”Computers and Operations Research, 32, pp. 1379-1407, 2005.

[85] Tovia, F. S., Mason, J. and Ramasami, B., “A scheduling heuristic for maximizing wirebonder throughput,”IEEE Transactions on Electronics Packaging Manufacturing, 27(2), pp. 145-150, 2004.

[86] Uzsoy, R., “Scheduling of a single batch processing machines with non-identical job sizes,”International Journal of Production Research, 32, pp. 1615- 1635, 1994.

[87] Van Der Zee, D. J., “Dynamic scheduling of batch servers with compatible product families,”International Journal of Production Research, 42, pp. 4803- 4826, 2004.

[88] Van Der Zee, D. J., “Dynamic scheduling of batch-processing machines with non-identical product sizes,”International Journal of Production Research, 45, pp.

2327- 2349, 2007.

[89] Wang, C. S. and Uzsoy, R., “A genetic algorithm tominimize maximum lateness on a batch processing machine,” Computers & Operations Research, 29, pp.1621- 1640, 2002.

[90] Wang, F. K., Du, T. and Wen, F. C., “Product mix in the TFT-LCD industry,”

Production Planning & Control, 18, pp. 584- 591, 2007.

[91] Wang, H. M., Chang, P. C. and Chou, F. D., “A hybrid forward/backward approach for single batch scheduling problems with non-identical job sizes,” Journal of the Chinese Institute of Industrial Engineers, 24 (3), pp. 191- 199, 2007.

[92] Wang, P. S. and Su, T. C., “An optimal yield mapping approach for the small and medium sized liquid crystal displays,”International Journal of Advanced manufacturing technology, 27, pp. 985- 989, 2006.

[93] Wolsey, L. A., Integer Programming, 1st ed. New York: John Wiley & Sons, 1998.

[94] Zhang, G., Cai, X., Lee C. Y. and Wong, C. K., “Minimizingmakespan on a single batch processing machine with nonidentical job sizes,” Naval Research Logistics, 48, pp. 226- 240, 2001.

Appendix

Table A1Setup times matrix for 26 product types in problem 6 (unit: minutes).

To

From U 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 U 0 120 120 120 120 120 120 120 120 120 120 120 120 120 120 120 120 120 120 120 120 120 120 120 120 120 120

1 0 0 15 20 20 360 360 180 30 30 180 360 250 250 180 30 30 150 120 50 50 50 130 20 50 30 20 2 0 15 0 20 20 360 320 180 30 30 180 360 30 30 170 170 250 30 50 50 150 100 100 150 15 250 30 3 0 20 20 0 120 30 30 170 170 250 250 250 130 150 50 260 80 30 50 50 150 100 100 150 15 80 30 4 0 280 280 360 0 130 20 50 260 80 80 280 130 150 50 260 80 30 50 50 150 100 100 150 15 80 30 5 0 280 280 360 15 0 20 50 260 80 80 280 130 150 50 260 80 30 50 50 150 100 100 150 15 80 30 6 0 280 280 360 15 20 0 50 260 80 80 280 15 80 150 150 120 80 250 250 250 100 100 270 30 120 80 7 0 20 20 120 50 15 80 0 150 120 120 30 15 80 150 150 120 100 150 150 150 80 80 30 30 120 100 8 0 20 20 15 320 30 120 120 0 250 250 250 50 150 150 260 80 250 170 170 250 250 250 250 30 80 20 9 0 280 280 200 50 50 150 150 260 0 80 280 250 100 250 150 30 250 50 260 80 80 80 280 30 30 20 10 0 150 150 80 80 250 250 250 270 30 0 20 150 80 280 30 250 15 170 130 250 250 250 250 150 30 50 11 0 270 270 100 100 150 150 280 30 30 100 0 50 180 120 120 250 150 170 130 250 250 250 250 270 50 150 12 0 15 15 30 30 180 180 120 120 50 150 150 0 180 120 120 250 280 250 250 100 30 30 280 250 250 280 13 0 20 20 360 360 260 80 80 280 250 250 100 50 0 120 150 150 15 360 360 320 320 120 15 280 150 15 14 0 280 280 15 15 260 80 80 280 150 150 80 20 15 0 150 208 15 320 320 320 320 120 15 280 30 15 15 0 20 20 50 50 130 250 250 250 150 80 80 150 80 80 0 80 250 50 260 80 80 80 280 30 250 250 16 0 20 20 208 208 280 250 30 30 280 280 280 280 100 30 30 0 130 150 150 120 120 120 30 280 50 150 17 0 280 280 50 50 150 150 80 80 120 250 280 150 80 80 80 80 0 20 20 20 50 50 150 280 250 250 18 0 150 150 80 80 270 270 100 100 50 150 280 270 100 100 100 100 15 0 130 250 50 250 250 150 150 150 19 0 30 50 30 30 15 280 120 120 30 30 15 15 280 280 120 120 30 280 0 250 250 100 30 15 180 180 20 0 80 250 30 280 15 15 120 120 30 30 15 15 360 360 120 120 30 280 280 0 250 100 30 150 30 30 21 0 100 150 30 280 15 50 250 250 80 80 250 250 360 360 120 120 250 250 100 30 0 30 30 30 30 30 22 0 150 150 80 150 50 50 150 150 100 100 150 15 20 20 250 250 250 250 100 30 30 0 250 30 170 250 23 0 270 270 100 150 50 50 50 180 120 120 180 15 20 20 250 250 250 250 100 30 30 30 0 260 260 80 24 0 30 50 30 30 360 280 120 120 30 30 15 250 280 280 120 120 30 280 280 250 250 100 30 0 180 180 25 0 80 250 30 280 360 360 120 120 30 30 15 250 280 280 120 120 30 280 280 250 250 100 30 150 0 180 26 0 80 250 30 280 360 360 120 120 30 30 15 250 280 280 120 120 30 280 280 250 250 100 30 150 0 0

Table A2The job information of the 120 jobs in PCBSP.