메뉴 건너뛰기




Volumn 62, Issue 1, 2012, Pages 141-151

Decomposition-based classified ant colony optimization algorithm for scheduling semiconductor wafer fabrication system

Author keywords

Ant colony optimization; Decomposition; Decomposition based classified ACO (D CACO); Scheduling; Semiconductor wafer fabrication system (SWFS)

Indexed keywords

ACO ALGORITHMS; ANT COLONY OPTIMIZATION ALGORITHMS; ANT-COLONY OPTIMIZATION; DECOMPOSITION-BASED CLASSIFIED ACO (D-CACO); HYBRID MACHINE; SCHEDULING PROBLEM; SEMICONDUCTOR WAFER FABRICATION SYSTEM; SIMULATION PLATFORM; SUB-PROBLEMS;

EID: 82755177955     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2011.09.002     Document Type: Article
Times cited : (38)

References (40)
  • 1
    • 0023977010 scopus 로고
    • The shifting bottleneck procedure for job shop scheduling
    • J. Adams, E. Balas, and D. Zawack The shifting bottleneck procedure for job shop scheduling Management Science 34 3 1988 11
    • (1988) Management Science , vol.34 , Issue.3 , pp. 11
    • Adams, J.1    Balas, E.2    Zawack, D.3
  • 2
    • 0002381223 scopus 로고
    • Machine sequencing via disjunctive graphs: An implicit enumeration algorithm
    • E. Balas Machine sequencing via disjunctive graphs: An implicit enumeration algorithm Operations Research 17 6 1969 941 957
    • (1969) Operations Research , vol.17 , Issue.6 , pp. 941-957
    • Balas, E.1
  • 3
    • 57849155477 scopus 로고    scopus 로고
    • An integrated ACO approach for the joint production and preventive maintenance scheduling problem in the flowshop sequencing problem
    • Cambridge
    • Benbouzid-Sitayeb, F.; Ammi, I.; Varnier, C.; & Zerhouni, N. (2008). An integrated ACO approach for the joint production and preventive maintenance scheduling problem in the flowshop sequencing problem. In 2008 IEEE international symposium on industrial electronics (pp. 2532-2537). Cambridge.
    • (2008) 2008 IEEE International Symposium on Industrial Electronics , pp. 2532-2537
    • Benbouzid-Sitayeb, F.1    Ammi, I.2    Varnier, C.3    Zerhouni, N.4
  • 5
    • 9544220684 scopus 로고    scopus 로고
    • Beam-ACO - Hybridizing ant colony optimization with beam search: An application to open shop scheduling
    • C. Blum Beam-ACO - Hybridizing ant colony optimization with beam search: An application to open shop scheduling Computers & Operations Research 32 6 2005 27
    • (2005) Computers & Operations Research , vol.32 , Issue.6 , pp. 27
    • Blum, C.1
  • 6
    • 34249729418 scopus 로고    scopus 로고
    • A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups
    • C.F. Chien, and C.H. Chen A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups OR Spectrum 29 3 2007 391 419
    • (2007) OR Spectrum , vol.29 , Issue.3 , pp. 391-419
    • Chien, C.F.1    Chen, C.H.2
  • 7
    • 48749111396 scopus 로고    scopus 로고
    • A simulated annealing approach with probability matrix for semiconductor dynamic scheduling problem
    • F.D. Chou, H.M. Wang, and P.C. Chang A simulated annealing approach with probability matrix for semiconductor dynamic scheduling problem Expert Systems with Applications 35 4 2008 1889 1898
    • (2008) Expert Systems with Applications , vol.35 , Issue.4 , pp. 1889-1898
    • Chou, F.D.1    Wang, H.M.2    Chang, P.C.3
  • 10
    • 27644543634 scopus 로고    scopus 로고
    • Ant colony optimization theory: A survey
    • DOI 10.1016/j.tcs.2005.05.020, PII S0304397505003798
    • M. Dorigo, and C. Blum Ant colony optimization theory: A survey Theoretical Computer Science 344 2-3 2005 243 278 (Pubitemid 41554100)
    • (2005) Theoretical Computer Science , vol.344 , Issue.2-3 , pp. 243-278
    • Dorigo, M.1    Blum, C.2
  • 14
    • 0001548059 scopus 로고    scopus 로고
    • A Tabu Search Approach to Scheduling an Automated Wet Etch Station
    • C. Geiger, K. Kempf, and R. Uzsoy A tabu search approach to scheduling an automated wet etch station Journal of Manufacturing Systems 16 2 1997 102 116 (Pubitemid 127448019)
    • (1997) Journal of Manufacturing Systems , vol.16 , Issue.2 , pp. 102-116
    • Geiger, C.D.1    Kempf, K.G.2    Uzsoy, R.3
  • 15
    • 0030782894 scopus 로고    scopus 로고
    • Efficient dispatching rules for scheduling in a job shop
    • PII S0925527396000680
    • O. Holthausa, and C. Rajendran Efficient dispatching rules for scheduling in a job shop International Journal of Production Economics 48 1 1997 87 105 (Pubitemid 127410559)
    • (1997) International Journal of Production Economics , vol.48 , Issue.1 , pp. 87-105
    • Holthaus, O.1    Rajendran, C.2
  • 16
    • 34548613299 scopus 로고    scopus 로고
    • Ant colony optimization combined with taboo search for the job shop scheduling problem
    • DOI 10.1016/j.cor.2006.07.003, PII S0305054806001481
    • K.-L. Huang, and C.-J. Liao Ant colony optimization combined with taboo search for the job shop scheduling problem Computers & Operations Research 35 4 2008 1030 1046 (Pubitemid 47404760)
    • (2008) Computers and Operations Research , vol.35 , Issue.4 , pp. 1030-1046
    • Huang, K.-L.1    Liao, C.-J.2
  • 17
    • 24644518477 scopus 로고    scopus 로고
    • Dispatching rules using flow time predictions for semiconductor wafer fabrications
    • Y. Hung, and C. Chang Dispatching rules using flow time predictions for semiconductor wafer fabrications Journal of the Chinese Institute of Industrial Engineers 19 1 2002 67 74 (Pubitemid 41283722)
    • (2002) Journal of the Chinese Institute of Industrial Engineers , vol.19 , Issue.1 , pp. 67-74
    • Hung, Y.-F.1    Chang, C.-B.2
  • 18
    • 49749150530 scopus 로고    scopus 로고
    • Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework
    • A.H. Kashan, and B. Karimi Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework Journal of the Operational Research Society 59 9 2008 1269 1280
    • (2008) Journal of the Operational Research Society , vol.59 , Issue.9 , pp. 1269-1280
    • Kashan, A.H.1    Karimi, B.2
  • 19
    • 0028744478 scopus 로고
    • Scheduling semiconductor manufacturing plants
    • P.R. Kumar Scheduling semiconductor manufacturing plants IEEE Control Systems Magazine 14 6 1994 33 40
    • (1994) IEEE Control Systems Magazine , vol.14 , Issue.6 , pp. 33-40
    • Kumar, P.R.1
  • 20
    • 0035705542 scopus 로고    scopus 로고
    • Dispatching heuristic for wafer fabrication
    • Lee, L. H.; Tang, L. C.; & Chan, S. C. (2001). Dispatching heuristic for wafer fabrication. In Proceedings of the 2001 winter simulation conference (pp. 1215-1219). Arlington, VA. (Pubitemid 34124980)
    • (2001) Winter Simulation Conference Proceedings , vol.2 , pp. 1215-1219
    • Lee, L.H.1    Tang, L.C.2    Chan, S.C.3
  • 21
    • 70349284999 scopus 로고    scopus 로고
    • ACO-based multi-objective scheduling of parallel batch processing machines with advanced process control constraints
    • L. Li, F. Qiao, and Q.D. Wu ACO-based multi-objective scheduling of parallel batch processing machines with advanced process control constraints International Journal of Advanced Manufacturing Technology 44 9-10 2009 985 994
    • (2009) International Journal of Advanced Manufacturing Technology , vol.44 , Issue.910 , pp. 985-994
    • Li, L.1    Qiao, F.2    Wu, Q.D.3
  • 22
    • 27844530711 scopus 로고    scopus 로고
    • Modelling of semiconductor wafer fabrication systems by extended object-oriented Petri nets
    • DOI 10.1080/0020754042000264563
    • H. Liu, R.Y.K. Fung, and Z. Jiang Modeling of semiconductor wafer fabrication systems by extended object-oriented petri nets International Journal of Production Research 43 3 2005 471 495 (Pubitemid 41648330)
    • (2005) International Journal of Production Research , vol.43 , Issue.3 , pp. 471-495
    • Liu, H.1    Fung, R.Y.K.2    Jiang, Z.3
  • 23
    • 0042622980 scopus 로고    scopus 로고
    • A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
    • S.J. Mason, J.W. Fowler, and W.M. Carlyle A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops Journal of Scheduling 5 3 2002 247 262
    • (2002) Journal of Scheduling , vol.5 , Issue.3 , pp. 247-262
    • Mason, S.J.1    Fowler, J.W.2    Carlyle, W.M.3
  • 24
    • 42049121106 scopus 로고    scopus 로고
    • Tabu search methods for scheduling a burn-in oven with non-identical job sizes and secondary resource constraints
    • C.S. Mazumdar, M. Mathirajan, R. Gopinath, and A.I. Sivakumar Tabu search methods for scheduling a burn-in oven with non-identical job sizes and secondary resource constraints International Journal of Operational Research 3 1-2 2008 119 139
    • (2008) International Journal of Operational Research , vol.3 , Issue.12 , pp. 119-139
    • Mazumdar, C.S.1    Mathirajan, M.2    Gopinath, R.3    Sivakumar, A.I.4
  • 25
    • 33750718514 scopus 로고    scopus 로고
    • Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
    • DOI 10.1016/j.ejor.2005.12.020, PII S0377221705008532
    • L. Mönch, R. Schabacker, D. Pabst, and J.W. Fowler Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops European Journal of Operational Research 177 3 2007 2100 2118 (Pubitemid 44709466)
    • (2007) European Journal of Operational Research , vol.177 , Issue.3 , pp. 2100-2118
    • Monch, L.1    Schabacker, R.2    Pabst, D.3    Fowler, J.W.4
  • 26
    • 5244278595 scopus 로고    scopus 로고
    • A fast taboo search algorithm for the job shop problem
    • E. Nowicki, and C. Smutnicki A fast taboo search algorithm for the job shop problem Management Science 42 6 1996 797 813 (Pubitemid 126577322)
    • (1996) Management Science , vol.42 , Issue.6 , pp. 797-813
    • Nowicki, E.1    Smutnicki, C.2
  • 27
    • 0028452709 scopus 로고
    • Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
    • I.M. Ovacik, and R. Uzsoy Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times International Journal of Production Research 32 6 1994 1243
    • (1994) International Journal of Production Research , vol.32 , Issue.6 , pp. 1243
    • Ovacik, I.M.1    Uzsoy, R.2
  • 28
    • 0029404198 scopus 로고
    • Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times
    • I.M. Ovacik, and R. Uzsoy Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times International Journal of Production Research 33 11 1995 3173 3192
    • (1995) International Journal of Production Research , vol.33 , Issue.11 , pp. 3173-3192
    • Ovacik, I.M.1    Uzsoy, R.2
  • 30
    • 0034155381 scopus 로고    scopus 로고
    • Decomposition methods for large job shops
    • M. Singer Decomposition methods for large job shops Computers & Operations Research 28 3 2001 193 207
    • (2001) Computers & Operations Research , vol.28 , Issue.3 , pp. 193-207
    • Singer, M.1
  • 31
    • 35348867629 scopus 로고    scopus 로고
    • Bottleneck station scheduling in semiconductor assembly and test manufacturing using ant colony optimization
    • DOI 10.1109/TASE.2007.906341
    • Y. Song, M.T. Zhang, J. Yi, L. Zhang, and L. Zheng Bottleneck station scheduling in semiconductor assembly and test manufacturing using ant colony optimization IEEE Transactions on Automation Science and Engineering 4 4 2007 569 578 (Pubitemid 47573851)
    • (2007) IEEE Transactions on Automation Science and Engineering , vol.4 , Issue.4 , pp. 569-578
    • Song, Y.1    Zhang, M.T.2    Yi, J.3    Zhang, L.4    Zheng, L.5
  • 32
    • 33845487579 scopus 로고    scopus 로고
    • Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication
    • DOI 10.1007/s10951-006-0325-5
    • K. Sourirajan, and R. Uzsoy Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication Journal of Scheduling 10 1 2007 41 65 (Pubitemid 44914828)
    • (2007) Journal of Scheduling , vol.10 , Issue.1 , pp. 41-65
    • Sourirajan, K.1    Uzsoy, R.2
  • 35
    • 0000262471 scopus 로고    scopus 로고
    • A capacity allocation problem with integer side constraints
    • PII S0377221796000969
    • L.B. Toktay, and R. Uzsoy A capacity allocation problem with integer side constraints European Journal of Production Research 109 1 1998 170 182 (Pubitemid 128393237)
    • (1998) European Journal of Operational Research , vol.109 , Issue.1 , pp. 170-182
    • Beril Toktay, L.1    Uzsoy, R.2
  • 39
    • 0033336814 scopus 로고    scopus 로고
    • Scheduling cluster tools in wafer fabrication using candidate list and simulated annealing
    • DOI 10.1023/A:1008904604531
    • S.J. Yim, and D.Y. Lee Scheduling cluster tools in wafer fabrication using candidate list and simulated annealing Journal of Intelligent Manufacturing 10 6 1999 531 540 (Pubitemid 30556504)
    • (1999) Journal of Intelligent Manufacturing , vol.10 , Issue.6 , pp. 531-540
    • Yim, S.J.1    Lee, D.Y.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.