請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/27415完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 傅立成 | |
| dc.contributor.author | Tsung-Che Chiang | en |
| dc.contributor.author | 蔣宗哲 | zh_TW |
| dc.date.accessioned | 2021-06-12T18:04:12Z | - |
| dc.date.available | 2010-01-25 | |
| dc.date.copyright | 2008-01-25 | |
| dc.date.issued | 2008 | |
| dc.date.submitted | 2008-01-18 | |
| dc.identifier.citation | Adams, J., Balas, E., and Zawack, D., 1988, The shifting bottleneck procedure for job-shop scheduling, Management Science, 34, 391 – 401.
Anderson, E.J. and Nyirenda, J.C., 1990, Two new rules to minimize tardiness in a job shop. International Journal of Production Research, 28, 2277 – 2292. Appleton-Day, K. and Shao, L., 1997, Real-time dispatch gets real-time results in AMD’s Fab 25, Proceedings of the IEEE/SEMI Advanced Semiconductor Manufacturing Conference, 444 – 447. Arroyo, J.E.C. and Armentano, V.A., 2005, Genetic local search for multi-objective flowshop scheduling problems, European Journal of Operational Research, 167 (3), 717 – 738. Arzi, Y. and Raviv, D., 1998, Dispatching in a workstation belonging to a re-entrant production line under sequence-dependent set-up times, Production Planning & Control, 9 (7), 690 – 699. Baek, D.H., Yoon, W.C., and Park, S.C., 1998, A spatial rule adaptation procedure for reliable production control in a wafer fabrication system, International Journal of Production Research, 36 (6), 1475 – 1491. Bahaji, N. and Kuhl, M.E., 2007, A simulation study of new multi-objective composite dispatching rules, CONWIP, and push lot release in semiconductor fabrication, International Journal of Production Research, to appear. Balasubramanian, H., Monch, L., Fowler, J., and Pfund, M., 2004, Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness, International Journal of Production Research, 42 (8), 1621 – 1638. Basseur, M., Seynhaeve, F., and Talbi, E.-G., 2002, Design of multi-objective evolutionary algorithms: application to the flow-shop scheduling problem, Proceedings of IEEE Congress on Evolutionary Computation, 1151 – 1156. Benjaafar S. and Sheikhzadeh, 1997, Scheduling policies, batch sizes, and manufacturing lead times, IIE Transactions, 29, 159 – 166. Bertsekas, D.P., 1991, Linear network optimization: Algorithms and codes, M.I.T. Press, Cambridge, MA. Cai, L.W., Wu, Q.H., and Yong, Z.Z., 2000, A genetic algorithm with local search for solving job problems, Lecture Notes on Computer Science, 1803, 107 – 116. Cavalieri, S. and Gaiardelli, P., 1998, Hybrid genetic algorithms for a multiple-objective scheduling problem, Journal of Intelligent Manufacturing, 9, 361 – 367. Chang, Y.-L., Sueyoshi, T., and Sullivan, R.S., 1996, Ranking dispatching rules by data envelopment analysis in a job shop environment, IIE Transactions, 28, 631 – 642. Chang, P-C, Hsieh, J-C, and Lin, S-G, 2002, The development of gradual-priority weighting approach for the multi-objective flowshop scheduling problem, International Journal of Production Economics, 79, 171 – 183. Chang, P-C, Hsieh, J-C, and Wang, Y-W, 2003, Genetic algorithms applied in BOPP film scheduling problems: minimizing total absolute deviation and setup times, Applied Soft Computing, 3, 139 – 148. Chang, P-C, Chen, S-H, and Liu, C-H, 2007, Sub-population genetic algorithm with mining gene structures for multobjective flowshop scheduling problems, Expert Systems with Applications, 33, 762 – 771. Chang, P-C, Hsieh, J-C, and Wang, C-Y, 2007, Adaptive multi-objective genetic algorithms for scheduling of drilling operation in printed circuit board industry, Applied soft Computing, 7, 800 – 806. Chen, J.-H. and Ho, S.-Y., 2005, A novel approach to production planning of flexible manufacturing systems using an efficient multi-objective genetic algorithm, International Journal of Machine Tool & Manufacture, 45 (7)-(8), 949 – 957. Chen, Q., Xi, L., and Wang, Y., 2005, The impact of release times, lot size, and scheduling policy in an A&T facility, International Journal of Advanced Manufacturing Technology, 29 (5), 577 – 583. Cheng, R.W., Gen, M., and Tsujimura, Y., 1996, A tutorial survey of job-shop scheduling problems using enetic algorithms – I. representation, Computers & Industrial Engineering, 30 (4), 983 – 997. Cheng, R., Gen, M., and Tsujimura, Y., 1999, A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies, Computers & Industrial Engineering, 36 (2), 343-364. Chern, C.-C. and Liu, Y.-L., 2003, Family-based scheduling rules of a sequence-dependent wafer fabrication system, IEEE Transactions on Semiconductor Manufacturing, 16 (1), 15 – 25. Chiang, T.-C. and Fu, L.-C., 2004, Solving the FMS scheduling problem by critical ratio-based heuristics and the genetic algorithm, Proceedings of the IEEE International Conference on Robotics and Automation, 3, 3131 – 3136. Chiang, T.-C. and Fu, L.-C., 2006a, Multiobjective job shop scheduling using rule-coded genetic local search, Proceedings of International Conference on Computers and Industrial Engineering, 1764 – 1775. Chiang, T.-C. and Fu, L.-C., 2006b, Multiobjective job shop scheduling using genetic algorithm with cyclic fitness assignment, Proceedings of IEEE World Congress on Computational Intelligence, 11035 - 11042. Chiang, T.-C. and Fu, L.-C., 2007, Using dispatching rules for job shop scheduling with due date-based objectives, International Journal of Production Research, 45 (14), 3245 – 3262. Cigolini, R., Comi, A., Micheletti, A., Perona, M., and Portioli, A., 1999, Implementing new dispatching rules at SGS-Thomson Microelectronics, Production Planning & Control, 10 (1), 97 – 106. Cigolini, R., Perona, M., Portioli, A., and Zambelli, T., 2002, A new dynamic look-ahead scheduling procedure for batching machines, Journal of Scheduling, 5, 185 – 204. Cochran, J.K., Horng, S.-M., and Fowler, J.W., 2003, A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines, Computers & Operations Research, 30, 1087 – 1102. Corne, D.W., Knowles, J.D., and Oates, M.J., 2000, The Pareto envelope-based selection algorithm for multiobjective optimization, Proceedings of the Sixth International Conference on Parallel Problem Solving from Nature, 839-848. Corne, D.W., Jerram, N.R., Knowles, J.D., and Oates, M.J., 2001, PESA-II: Region-based selection in evolutionary multiobjective optimization, Proceedings of the Genetic and Evolutionary Computation Conference, 283-290. Dabbas, R.M., Chen, H.-N., Fowler, J.W., and Shunk, D., 2001, A combined dispatching criteria approach to scheduling semiconductor manufacturing systems, Computers & Industrial Engineering, 39, 307 – 324. Dauzere-Peres, S. and Lasserre, J.B., 1993, A modified shifting bottleneck procedure for job shop scheduling, International Journal of Production Research, 31, 923 – 932. Deb, K., Pratap, A., Agarwal, S., and Meyarivan, T., 2002, A fast and elitist multi-objective genetic algorithm: NSGA-II, IEEE Transactions on Evolutionary Computation, 6 (2), 181 – 197. Duwayri, Z., Mollaghasemi, M., Nazzal, D., and Rabadi, G., 2006, Scheduling setup changes at bottleneck workstations in semiconductor manufacturing, Production Planning & Control, 17 (7), 717 – 272. Ellis, K.P., Lu, Y., and Bish, E.K., 2004, Scheduling of wafer test processes in semiconductor manufacturing, International Journal of Production Research, 42 (2), 215 – 242. Esquivel, S., Ferrero, S., Gallard, R., Salto, C., Alfonso, H., and Schutz, M., 2002, Enhanced evolutionary algorithms for single and multiobjecitve optimization in the job shop scheduling problem, Knowledge-Based Systems, 15, 13 – 25. Fonseca, C.M. and Fleming, P.J., 1993, Genetic algorithms for multiobjective optimization: formulation, discussion and generalization, Proceedings of the Fifth International Conference on Genetic Algorithms, 1993. Fowler, J.W., Hogg, L.G., and Phillips, D.T., 1992, Control of multiproduct bulk service diffusion/oxidation processes, IIE Transactions, 24 (4), 84 – 96. Fowler, J. W. and Robinson, J., 1995, Measurement and improvement of manufacturing capacities (MIMAC): Final report, Technical Report 95062861A-TR, SEMATECH, Austin, TX. Fowler, J.W., Brown, S., Gold, H., and Schoemig, 1997, A., Measurable improvements in cycle-time-constrained capacity, Proceedings of the 6th International Symposium on Semiconductor Manufacturing. Fowler, J.W, Hogg, G.L., and Mason, S.J., 2002, Workload control in the semiconductor industry, Production Planning & Control, 13 (7), 568 – 578. Gao, J., Gen, M., Sun, L., and Zhao, X., 2007, A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problem, Computers & Industrial Engineering, 53, 149 – 162. Geiger, M.J., 2007, On operators and search space topology in multi-objective flow shop scheduling, European Journal of Operational Research, 181, 195 – 206. Geiger, C.D. and Uzsoy, R., 2007, Learning effective dispatching rules for batch processor scheduling, International Journal of Production Research, to appear. Giegandt, A. and Nicholson, G., 1998, Better dispatch application – a success story, Proceedings of the IEEE/SEMI Advanced Semiconductor Manufacturing Conference, 396 – 399. Glassey , C.R. and Resende, M.G.C., 1988, Closed-loop job release control for VLSI circuit manufacturing, IEEE Transactions on Semiconductor Manufacturing, 1 (1), 36 – 46. Glassey, C.R. and Weng, W.W., 1991, Dynamic batch heuristic for simultaneous processing, IEEE Transactions on Semiconductor Manufacturing, 4 (2), 77 – 82. Goncalves, J.F., Magalhaes Mendes, J.J. de, and Resende M.G.C., 2005, A hybrid genetic algorithm for the job shop scheduling problem, European Journal of Operational Research, 167, 77 – 95. Gupta, A.K. and Sivakumar, A.I., 2006a, Job shop scheduling techniques in semiconductor manufacturing, International Journal of Advanced Manufacturing Technology, 27, 1163 – 1169. Gupta, A.K. and Sivakumar, A.I., 2006b, Optimization of due-date objectives in scheduling semiconductor batch manufacturing, International Journal of Machine Tools & Manufacture, 46, 1671 – 1679. Gupta, A.K. and Sivakumar, A.I., 2007, Controlling delivery performance in semiconductor manufacturing using look ahead batching, International Journal of Production Research, 45 (3), 591 – 613. Gupta, J.N.D., Ruiz, R., Folwer, J.W., and Mason, S.J., 2006, Operational planning and control of semiconductor wafer production, Production Planning & Control, 17 (7), 639 – 647. Ham, M. and Dillard, F., 2005, Dynamic photo stepper dispatching/ scheduling in wafer fabrication, Proceedings of International Symposium on Semiconductor Manufacturing, 75 – 79. Herrmann, J.W., Lee, C.-Y., and Hinchman, J., 1995, Global job shop scheduling with a genetic algorithm, Production and Operations Management, 4 (1), 30 – 45. Ho, Y.C., Sreenivas, R.S., and Vakili, R., 1992, Ordinal optimization of DEDS, Discrete Event Dynamic Systems: Theory and Applications, 2 (1), 61 – 88. Horn, J., Nafpliotis, N., and Goldberg, D.E., 1994, A niched Pareto genetic algorithm for multiobjective optimization, Proceedings of IEEE Congress on Evolutionary Computation, 82-87. Horng, S.-M., Fowler, J.W., and Cochran, J.K., 2000, A genetic algorithm approach to manage ion implantation processes in wafer fabrication, International Journal of Manufacturing Technology and Management 1 (2/3), 156 – 172. Hsieh, B.W., Chang, S.C., and Chen, C.H., 2001, Scheduling semiconductor wafer fabrication by using ordinal optimization-based simulation, IEEE Transactions on Robotics and Automation, 17 (5), 599 – 608. Huang, S.-C. and Lin, J.T., 1998, An interactive scheduler for a wafer probe center in semiconductor manufacturing, International Journal of Production Research, 36 (7), 1883 – 1900. Hung, Y.-F. and Chang, C.-B., 2002, Dispatching rules using flow time predictions for semiconductor wafer fabrications, Journal of the Chinese Institute of Industrial Engineers, 19 (1), 67 – 74. Hung, Y.-F. and Chen, I.-R., 1998, A simulation study of dispatch rules for reducing flow times in semiconductor wafer fabrication, Production Planning & Control, 9 (7), 714 – 722. Hung, Y.-F. and Leachman, R.C., 1999, Reduced simulation models of wafer fabrication facilities, International Journal of Production Research, 37 (12), 2685 – 2701. Ishibuchi, H. and Murata, T., 1998, A multi-objective genetic local search algorithm and its application to flowshop scheduling, IEEE Transactions on Systems, Man, and Cybernetics: Part C, 28 (3), 392-403. Ishibuchi, H. and Murata, T., 1999, Local search procedures in a multi-objective genetic local search algorithm for scheduling problems, Proceedings of IEEE International Conference on Systems, Man, and Cybernetics, 665 – 670. Ishibuchi, H., Yoshida, T., and Murata, T., 2002, Selection of initial solutions for local search in multiobjective genetic local search, Proceedings of IEEE Congress on Evolutionary Computation, 950 – 955. Ishibuchi, H., Yoshida, T., and Murata, T., 2003, Balance between genetic search and local search in memetic algorithm or multiobjective permutation flowshop scheduling, IEEE Transactions on Evolutionary Computation, 7 (2), 204-223. Janiak, A., Kozan, E., Lichtenstein, M., and Oguz, C., 2007, Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion, International Journal of Production Economics, 105, 407 – 424. Jaszkiewicz, A., 2002, Genetic local search for multi-objective combinatorial optimization, European Journal of Operational Research, 137, 50-71. Jayamohan, M.S. and Rajendran, C., 2000, New dispatching rules for shop scheduling: a step forward, International Journal of Production Research, 38, 563 – 586. Jeong, K.C. and Kim, Y.-D., 1998, A real-time scheduling mechanism for a flexible manufacturing system: using simulation and dispatching rules, International Journal of Production Research, 36, 2609 – 2626. Johri, P.K., 1993, Practical issues in scheduling and dispatching in semiconductor wafer fabrication, Journal of Manufacturing Systems, 12 (6), 474 – 485. Jones, D.F., Mirrazavi, S.K., and Tamiz, M., 2002, Multi-objective meta-heuristics: An overview of the current state-of-the-art, European Journal of Operational Research, 137, 1 – 9. Kacem, I., Hammadi, S., and Borne, P., 2002, Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems, IEEE Transactions on Systems, Man, and Cybernetics – Part C, 32 (1), 1 – 13. Kim, Y.-D., Kim, J.-U., Lim, S.-K., and Jun, H.-B., 1998a, Due-date based scheduling and control policies in a multiproduct semiconductor wafer fabrication facility, IEEE Transactions on Semiconductor Manufacturing, 11 (1), 155 – 164. Kim, Y.-D., Lee, D.-H., and Kim, J.-U., 1998b, A simulation study on lot release control, mask scheduling, and batch scheduling in semiconductor wafer fabrication facilities, Journal of Manufacturing Systems, 17 (2), 107 – 117. Kim, Y.-D., Kim, J.-G., Choi, B., and Kim, H.-U., 2001, Production scheduling in a semiconductor wafer fabrication facility producing multiple product types with distinct due dates, IEEE Transactions on Robotics and Automation, 17 (5), 589 – 598. Koksalan, M. and Keha, A.B., 2003, Using genetic algorithms for single-machine bicriteria scheduling problems, European Journal of Operational Research, 145, 543 – 556. Kumar, P.R., 1994, Scheduling semiconductor manufacturing plants, IEEE Control and Systems Magazine, 14 (6), 33 – 40. Law, A.M. and Kelton, W.D., 2000, Simulation Modeling and Analysis, 3rd ed., 557 – 559. Lee, C.-Y., Uzsoy, R., and Margin-Vega, L.A., 1992, Efficient algortithms for scheduling semiconductor burn-in operations, Operations Research, 40(4), 764 – 775. Lee, C.-Y., Piramuth, S., and Tsai, Y.-K., 1997, Job shop scheduling with a genetic algorithm and machine learning, International Journal of Production Research 35 (4), 1171 – 1191. Lee, Y.H., Lee, K.B., and Jeong, B., 2000, Multi-objective production scheduling of probe process in semiconductor manufacturing, Production Planning & Control, 11 (7), 660 – 669. Lee, Y.H., Park, J.W., and Kim, S.Y., 2002, Experimental study on input and bottleneck scheduling for a semiconductor fabrication line, IIE Transactions, 34, 179 – 190. Lemesre, J., Dhaenens, C. and Talbi, E.G., 2007, An exact parallel method for a bi-objective permutation flowshop problem, European Journal of Operational Research, 177, 1641 – 1655. Li, S., Tang, T., and Collins, D.W., 1996, Minimum inventory variability schedule with applications in semiconductor fabrication, IEEE Transactions on Semiconductor Manufacturing, 9 (1), 145 – 149. Lin, J.T., Wang, F.K., and Kou, P.C., 2005, A parameterized-dispatching rule for a logic IC sort in a wafer fabrication, Production Planning & Control, 16 (5), 426 – 436. Liu, M. and Wu, C., 2004, Genetic algorithm using sequence rule chain for multi-objective optimization in re-entrant micro-electronic production line, Robotics and Computer-Integrated Manufacturing 20, 225 – 236. Loukil, T., Teghom, J., and Tuyttens, D., 2005, Solving multi-objective production scheduling problems using metaheuristics, European Journal of Operational Research, 161 (1), 42 – 61. Loukil, T., Teghem, J., and Fortemps, P., 2007, A multi-objective production scheduling case study solved by simulated annealing, European Journal of Operational Research, 179, 709 – 722. Low, C., Yip, Y., and Wu, T-H, 2006, Modelling and heuristics of FMS scheduling with multiple objectives, Computers & Operations Research, 33, 674 – 694. Lu, S.C.H., Ramaswamy, D., and P.R. Kumar, 1994, Efficient scheduling policies to reduce mean and variance of cycle-time in semiconductor manufacturing plants, IEEE Transactions on Semiconductor Manufacturing, 7 (3), 374 – 388. Malve, S. and Uzsoy, R., 2007, A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families, Computers & Operations Research, 34, 3016 – 3028. Mason, S.J., Fowler, J.W., and Carlyle, W.M., 2002, A modified shifting bottleneck heuristic for minimizing total weighted in complex job shops, Journal of Scheduling, 5, 247 – 262. Mason, S.J., Fowler, J.W., Carlyle, W.M., and Montgomery, D.C., 2005, Heuristics for minimizing total weighted tardiness in complex job shops, International Journal of Production Research, 43 (10), 1943 – 1963. Mason, S.J. and Oey, K., 2003, Scheduling complex job shops using disjunctive graphs: a cycle elimination procedure, International Journal of Production Research, 41 (5), 981 – 994. Mehta, S.V. and Uzsoy, R., 1998, Minimizing total tardiness on a batch processing machine with incompatible job families, IIE Transactions, 30, 165 – 178. Meloni, C., Naso, D., and Turchiano, B., 2003, Multi-objective evolutionary algorithms for a class of sequencing problems in manufacturing environments, Proceedings of IEEE International Conference on Systems, Man, and Cybernetics, 1, 8 – 13. Min, H.-S. and Yih, Y., 2003, Selection of dispatching rules on multiple dispatching decision points in real-time scheduling of a semiconductor wafer fabrication system, International Journal of Production Research, 41 (16), 3921 – 3941. Miragliotta, G. and Perona, M., 2005, Decentralized, multi-objective driven scheduling for reentrant shops: A conceptual development and a test case, European Journal of Operational Research, 167, 644 – 662. Monch, L., Balasubramanian, H., Fowler, J.W., and Pfund, M.E., 2005, Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times, Computers & Operations Research, 32, 2731 – 2750. Montgomery, D.C., 2001, Design and Analysis of Experiments, 5th ed., 96 – 103. Naso, D., Turchiano, B., and Meloni, C., 2006, Single and multi-objective evolutionary algorithms for the coordination of serial manufacturing operations, Journal of Intelligent Manufacturing, 17, 251 – 270. Neppalli, V.R., Chen, C.-L., and Gupta, J.N.D., 1996, Genetic algorithms for the two-stage bicriteria flowshop problem, European Journal of Operational Research, 95, 356 – 373. Neuts, M.F., 1967, A general class of bulk queues with Poisson input, Annals of Mathematical Statistics, 38 (3), 759 – 770. Norman, B.A. and Bean, J.C., 1999, A genetic algorithm methodology for complex scheduling problems, Naval Research Logistics., 46, 199 – 211. Ovacik, I.M. and Uzsoy, R., 1994, Exploiting shop floor status information to schedule complex job shops, Journal of Manufacturing Systems, 13 (2), 73 – 83. Ovacik, I.M. and Uzsoy, R., 1996, Decomposition methods for scheduling semiconductor testing facilities, International Journal of Flexible Manufacturing Systems, 8, 357 – 388. Pasupathy, T., Rajendran, C., and Suresh, R.K., 2006, A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs, International Journal of Advanced Manufacturing Technology, 27, 804 – 815. Pearn, W.L., Chung, S.H., and Yang, M.H., 2002, The wafer probing scheduling problem (WPSP), Journal of the Operational Research Society, 53, 864 – 874. Pearn, W.L., Chung, S.H., Chen, A.Y., and Yang, M.H., 2004, A case study on the multistage IC final testing scheduling problem with reentry, International Journal of Production Economics, 88, 257 – 267. Perez, I.C., Fowler, J.W., Carlyle, W.M., 2005, Minimizing total weighted tardiness on a single batch process machine with incompatible job families, Computers & Operations Research, 32, 327 – 341. Ponnambalam, S.G., Ramkumar, V., and Jawahar, N., 2001, A multiobjective genetic algorithm for job shop scheduling. Production, Planning & Control, 12 (8), 764 – 774. Qu, P. and Mason, S.J., 2005, Metaheuristic scheduling of 300-mm lots containing multiple orders, IEEE Transactions on Semiconductor Manufacturing, 18 (4), 633 – 643. Rajendran, C., 1995, Heuristics for scheduling in flowshop with multiple objectives, European Journal of Operational Research, 82, 540 – 555. Rajendran, C. and Ziegler, H., 2003, Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times, European Journal of Operational Research, 149, 513 – 522. Robinson, J.K., Fowler, J.W., and Bard, J.F., 1995, The use of upstream and downstream information in scheduling semiconductor batch operations, International Journal of Production Research, 33 (7), 1849 – 1869. Rose, O., 2002, Some issues of the critical ratio dispatch rule in semiconductor manufacturing, Proceedings of the 2002 Winter Simulation Conference, 1401 – 1405. Rubin, P.A. and Ragatz, G.L., 1995, Scheduling in a sequence dependent setup environment with genetic search, Computers & Operations Research, 22, 85 – 99. Russell, R.S., Dar-el, E.M., and Taylor III, B.W., 1987, A comparative analysis of the COVERT job sequencing rule using various shop performance measures, International Journal of Production Research, 25 (10), 1523 – 1540. Schaffer, J.D., 1985, Multi-objective optimization with vector evaluated genetic algorithms, Proceedings of the First International Conference on Genetic Algorithms, 93-100. Sethi, S.P., Chu, K.-F., and Yan, H., 1999, Efficient setup/dispatching policies in a semiconductor manufacturing facility, Proceedings of the 38th Conference on Decision and Control, 1368 – 1373. Sha, D.Y. and Liu, C-Y, 2003, A simulated annealing algorithm for integration of shop floor control strategies in semiconductor wafer fabrication, International Journal of Advanced Manufacturing Technology, 22, 75 – 88. Sivakumar, A.I., 2001, Multiobjective dynamic scheduling using discrete event simulation, International Journal of Computer Integrated Manufacturing, 14 (2), 154 – 167. Sivakumar, A.I. and Gupta, A.K., 2006, Online multiobjective Pareto optimal dynamic scheduling of semiconductor back-end using conjunctive simulated scheduling, IEEE Transactions on Electronics Packaging Manufacturing, 29 (2), 99 – 109. Solomon, L., Fowler, J.W., Pfund, M., and Jensen, P.H., 2002, The inclusion of future arrivals and downstream setups into wafer fabrication batch processing decisions, Journal of Electronics Manufacturing, 11 (2), 149 – 159. Sridhar, J., and Rajendran, C., 1996, Scheduling in flowshop and cellular manufacturing systems with multiple objectives – a genetic algorithmis approach, Production Planning and Control, 7 (4), 374 – 382. Srinivas, N. and Deb, K., 1994, Multiobjective optimization using nondominated sorting in genetic algorithms, Evolutionary Computation, 2 (3), 221-248. Sung and Kim, 2003, Minimizing due date related performance measures on two batch processing machines, European Journal of Operational Research, 47, 644 – 656. Suresh, R.K. and Mohanasundaram, K.M., 2006, Pareto archived simulated annealing for job shop scheduling with multiple objectives, International Journal of Advanced Manufacturing Technology, 29, 184 – 196. Taillard, E.D., Gambardella, L.M., Gendreau, M., and Potvin, J.-Y., 2001, Adaptive memory programming: a unified view of metaheuristics, European Journal of Operational Research, 135, 1-16. Talbi, E.-G., Rahoual, M., Mabed, M.H., and Dhaenens, C., 2001, A hybrid evolutionary approach for multicriteria optimization problems: application to the flow shop, Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization, 416 – 428. Tyan, J.C., Chen, J.C., and Wang, F.-K., 2002, Development of a state-dependent dispatch rule using theory of constraints in near-real-world wafer fabrication, Production Planning & Control, 13 (3), 253 – 161. Upasani, A.A., Uzsoy, R., and Sourirajan, K., 2006, A problem reduction approach for scheduling semiconductor wafer fabrication facilities, IEEE Transactions on Semiconductor Manufacturing, 19 (2), 216 – 225. Uzsory, R., Church, L.K., Ovacik, I.M., and Hinchman, J., 1993, Performance evaluation of dispatching rules for semiconductor testing operations, Journal of Electronics Manufacturing, 3, 95 – 105. Uzsoy, R., Lee, C.-Y., 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, IIE Transactions, 24 (4), 47 – 60. Uzsoy, R., 1995, Scheduling batch processing machines with incompatible job families, International Journal of Production Research, 33 (10), 2685 – 2708. Van Veldhuizen, D.A. and Lamont, G.B., 2000, On measuring multiobjective evolutionary algorithm performance, Proceedings of IEEE Congress on Evolutionary Computation, 204 – 211. Van Veldhuizen, D.A. and Lamont, G.B., 2000, Multiobjective evolutionary algorithms: analyzing the state-of-the-art, Evolutionary Computation, 8 (2), 125 – 147. Van Der Zee, D.J., 2007, Dynamic scheduling of batch-processing machines with non-identical product sizes, International Journal of Production Research, 45 (10), 2327 – 2349. Varadharajan, T.K. and Rajendran, C., 2005, A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs, European Journal of Operational Research, 167, 772 – 795. Vepsalainen, A.P.J. and Morton, T.E., 1987, Priority rules for job shops with weighted tardiness costs, Management Science, 33 (8), 1035 – 1047. Wang, C-S and Uzsoy, R., 2002, A genetic algorithm to minimize maximum lateness on a batch processing machine, Computers & Operations Research, 29, 161 – 1640. Weng, W.W. and Leachman, R.C., 1993, An improved methodology for real-time production decisions at batch-process work stations, IEEE Transactions on Semiconductor Manufacturing, 6 (3), 219 – 225. Wein, L.M., 1988, Scheduling semiconductor wafer fabrication, IEEE Transactions on Semiconductor Manufacturing, 1 (3), 115 – 130. Wolpert, D.H. and Macready, W.G., 1997, No free lunch theorems for optimization, IEEE Transactions on Evolutionary Computation, 1 (1), 67 – 82. Wu, M.-C., Huang, Y.L., Chang, Y.C., and Yang, K.F., 2006, Dispatching in semiconductor fabs with machine-dedication features, International Journal of Advanced Manufacturing Technology, 28, 978 – 984. Xia, W. and Wu, Z., 2005, An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems, Computers & Industrial Engineering, 48, 409 – 425. Yandra and Tamura, H., 2007, A new multiobjective genetic algorithm with heterogeneous population for solving flowshop scheduling problems, International Journal of Computer Integrated Manufacturing, 20 (5), 465 – 477. Yang, J. and Chang, T.-S., 1998, Multiobjective scheduling for IC sort and test with a simulation testbed, IEEE Transactions on Semiconductor Manufacturing, 11 (2), 304 – 315. Yoon H.J., and Lee, D.Y., 2000, A control method to reduce the standard deviation of flow time in wafer fabrication, IEEE Transactions on Semiconductor Manufacturing, 13 (3), 389 – 392. Zitzler, E. and Thiele, L., 1999, Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto Approach, IEEE Transactions on Evolutionary Computation, 3 (4), 257 – 271. Zitzler, E., Deb, K., and Thiele, L., 2000, Comparison of multiobjective evolutionary algorithms: empirical results, Evolutionary Computation, 8 (2), 173 – 195. Zitzler, E., Laumanns, M., and Thiele, L., 2002, SPEA2: Improving the strength Pareto evolutionary algorithm, Technical Report 103, Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH) Zurich, Gloriastrasse 35, CH-8092 Zurich, Switzerland. | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/27415 | - |
| dc.description.abstract | 這是一本研究如何對半導體製造廠中之生產設備進行排程的論文。為了因應接單生產 (make-to-order) 的市場趨勢,我們的研究特別專注於如何排程以最佳化多個與客戶交期 (due date) 相關的效能指標。本文中,對於廠內循序 (serial) 機台與批次 (batch) 機台的即時派工 (dispatching) 問題,我們分別提出兩條新的派工法則 (dispatching rule),其主要特色為計算工件優先值時,會考慮總緊急度,並會視需要作交期延長的動作。論文中,我們也針對傳統使用派工法則的方式指出其缺點,並將派工決策視為一個二維指派問題,透過求解此指派問題的方式來彌補傳統方式之不足。除此之外,我們提出一個多目標演化式演算法 (multiobjective evolutionary algorithm),它可以依據製造廠內的現有狀況與廠方設定的效能指標,來產生一群具有Pareto最佳性 (Pareto optimal) 的派工法則與參數組合。生管人員毋須事前訂定多個效能指標間的偏好關係,就可直接從這群Pareto最佳解組合中,挑選最適當的組合來作即時派工之用途。對於多目標演化式演算法中的關鍵程序,包括適合度計算 (fitness assignment)、親代選擇 (mating selection)、環境選擇 (environmental selection) 與區域搜尋 (local search),我們都提出了創新的設計。在實驗中,我們使用一套公開且具有代表性的測試資料來驗證所提方法之效能。這套測試資料包含了七個不同半導體製造廠的資料,配合不同的廠負載度 (load level) 與交期鬆緊度 (due date tightness) 設定,產生數十種不同的測試環境。實驗結果顯示,所提方法之效能,顯著優於多種既有之方法。因此,我們相信本論文所提之方法,將可應用於半導體製造廠之多目標排程,使產品之生產時程更為滿足客戶訂單之交期。 | zh_TW |
| dc.description.abstract | In this dissertation, we address the scheduling problem in the semiconductor manufacturing industry, one of the most complicated and capital-intensive industries in the world. Due date delivery performance is of our particular concern to cater to the make-to-order market environment nowadays. We propose a real-time scheduling approach to resolve the main decisions including serial dispatching and batch dispatching. The real-time scheduling approach is based on two newly proposed dispatching rules, whose features include total urgency estimation and due date extension. To apply the dispatching rules, the weakness of traditional paradigm is discussed, and a 2-D assignment-based paradigm is proposed. In addition, a performance optimizer based on the evolutionary algorithm is developed with the consideration of multiple objectives simultaneously. The critical components of the multiobjective evolutionary algorithm (MOEA) including fitness assignment, mating selection, environmental selection, and local search procedure are designed elaborately to balance between exploration and exploitation. By using the proposed MOEA-based optimizer, it is easy for production managers to obtain a set of rules and parameter values which is fit to their own manufacturing systems and is able to produce schedules to their satisfaction. Experiments are conducted on a representative test bed consisting of seven wafer fabrication facilities under different levels of fab load and due date tightness. Considering performance measures including on-time delivery rate, mean tardiness, and maximum tardiness simultaneously, the proposed serial and batch dispatching rules significantly outperform 16 existing serial rules and 6 batch rules, respectively. The proposed MOEA also shows superiority over a representative approach in the literature. According to these promising results, we can conclude that the proposed real-time scheduler and performance optimizer are useful tools to do multiobjective scheduling in the semiconductor manufacturing industry. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-12T18:04:12Z (GMT). No. of bitstreams: 1 ntu-97-D90922009-1.pdf: 769831 bytes, checksum: 1ce7012bfb8b594c151c70045f265e55 (MD5) Previous issue date: 2008 | en |
| dc.description.tableofcontents | 1 Introduction 1
1.1 Motivation 1 1.2 Problem definition 3 1.2.1 Semiconductor manufacturing scheduling 3 1.2.2 Multiobjective scheduling 10 1.3 Scope of research 17 1.4 Organization 20 2 Literature Review 22 2.1 Semiconductor manufacturing scheduling 22 2.1.1 Lot release control 23 2.1.2 Serial dispatching 24 2.1.3 Batch dispatching 31 2.2 Multiobjective scheduling 42 2.2.1 Multiobjective evolutionary algorithm 42 2.2.2 Multiobjective evolutionary scheduling 48 3 Real-time Semiconductor Manufacturing Scheduling 58 3.1 Overview 58 3.2 Serial dispatching 60 3.2.1 Basic concept 61 3.2.2 Due date extension procedure 64 3.2.3 Two viewpoints for calculation of total degree of urgency 68 3.2.4 Lot filtering 69 3.3 2-D assignment-based dispatching paradigm 70 3.3.1 Basic concept 70 3.3.2 Collection of lot and equipment candidates 73 3.3.3 Calculation of matching preferences 75 3.3.4 Solution of the 2-D assignment problem 77 3.3.5 Linkage of assignment results and dispatching decisions 78 3.4 Batch dispatching 79 3.4.1 Forming a batch 80 3.4.2 Selecting among batches 86 3.4.3 Starting a batch process 86 4 Multiobjective Evolutionary Algorithm-based Optimization 91 4.1 Overview 91 4.2 Encoding and decoding schemes 93 4.2.1 Encoding scheme 93 4.2.2 Decoding scheme 96 4.3 Cyclic fitness assignment 99 4.4 Region-based mating selection 102 4.5 Contribution-based environmental selection 108 4.5.1 Replacement of no-contribution individuals with new individuals 108 4.5.2 Survival of fitter individuals 112 4.6 Population and contribution-based local search procedure 114 4.7 Initialization, crossover, mutation, stopping criterion, and parameters 119 4.8 Short summary 121 5 Experiments and Results 123 5.1 Testbed descriptions 123 5.1.1 Model of manufacturing system 123 5.1.2 Data setting 124 5.1.3 Implementation and verification 126 5.2 Performance of the proposed serial dispatching rule (ECR3) 126 5.2.1 Benchmark approaches 126 5.2.2 Experimental design 126 5.2.3 Experimental results 132 5.2.4 Discussions 138 5.3 Performance of the proposed batch dispatching rule (B-ECR3) 139 5.3.1 Benchmark approaches 140 5.3.2 Experimental design 142 5.3.3 Experimental results 143 5.3.4 Discussions 148 5.4 Performance of the proposed dispatching paradigm 149 5.4.1 Benchmark approaches 149 5.4.2 Experimental design 150 5.4.3 Experimental results 151 5.4.4 Discussions 152 5.5 Performance of the proposed multiobjective evolutionary algorithm 154 5.5.1 Test problem instances and encoded rules 154 5.5.2 Performance metrics 157 5.5.3 Experimental design 157 5.5.4 Experimental results 160 5.5.5 Discussions 164 6 Conclusions and Future Work 170 References 175 | |
| dc.language.iso | en | |
| dc.subject | 派工 | zh_TW |
| dc.subject | 半導體製造 | zh_TW |
| dc.subject | 演化式演算法 | zh_TW |
| dc.subject | 多目標 | zh_TW |
| dc.subject | 排程 | zh_TW |
| dc.subject | 批次 | zh_TW |
| dc.subject | evolutionary algorithms | en |
| dc.subject | dispatching | en |
| dc.subject | scheduling | en |
| dc.subject | semiconductor manufacturing | en |
| dc.subject | batch | en |
| dc.subject | multiobjective | en |
| dc.title | 半導體製造系統之多目標排程 | zh_TW |
| dc.title | Multiobjective Scheduling in Semiconductor Manufacturing Systems | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 96-1 | |
| dc.description.degree | 博士 | |
| dc.contributor.oralexamcommittee | 陳正剛,陳文耀,鄭慕德,黃漢邦,張百棧,林則孟,巫木誠 | |
| dc.subject.keyword | 半導體製造,排程,派工,批次,多目標,演化式演算法, | zh_TW |
| dc.subject.keyword | semiconductor manufacturing,scheduling,dispatching,batch,multiobjective,evolutionary algorithms, | en |
| dc.relation.page | 192 | |
| dc.rights.note | 有償授權 | |
| dc.date.accepted | 2008-01-18 | |
| dc.contributor.author-college | 電機資訊學院 | zh_TW |
| dc.contributor.author-dept | 資訊工程學研究所 | zh_TW |
| 顯示於系所單位: | 資訊工程學系 | |
文件中的檔案:
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-97-1.pdf 未授權公開取用 | 751.79 kB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。
