2921 | Minimizing Makespan in a Two-Machine Flowshop with Dynamic Arrivals Allowed Sung, Chang Sup; Kim, YH, COMPUTERS AND OPERATIONS RESEARCH, v.29, no.3, pp.275 - 294, 2002-02 |
2922 | Minimizing Makespan on a Single Burn-in Oven in Semiconductor Manufacturing Sung, Chang Sup, EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.120, no.3, pp.559 - 574, 2000-02 |
2923 | Minimizing Makespan on a Single Burn-In Oven wih Job Families and Dynamic Job Arrivals Allowed Sung, Chang Sup, COMPUTERS & OPERATIONS RESEARCH, v.120, no.3, pp.559 - 574, 2000-10 |
2924 | MINIMIZING MAKESPAN ON A TWO-MACHINE RE-ENTRANT FLOWSHOP Choi, SW; Kim, Yeong-Dae, Asia Pacific Industrial Engineering and Management Systems Conference, pp.31.19.1 - 31.19.10, 2004 |
2925 | Minimizing makespan on a two-machine re-entrant flowshop Choi, SW; Kim, Yeong-Dae, JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.58, pp.972 - 981, 2007-07 |
2926 | Minimizing makespan on an m-machine re-entrant flowshop Choi, Seong-Woo; Kim, Yeong-Dae, COMPUTERS & OPERATIONS RESEARCH, v.35, no.5, pp.1684 - 1696, 2008-05 |
2927 | Minimizing makespan on two-machine re-entrant flowshop Choi, Seong-Woo; Kim, Yeong-Dae, International Conference on Computers and Industrial Engineering, pp.CIE453 - CIE453, 2004 |
2928 | Minimizing maximum completion time in a two-batch-processing-machine flowshop with dynamic arrivals allowed Sung, Chang Sup; Yoon, SH, ENGINEERING OPTIMIZATION, v.28, no.3, pp.231 - 243, 1997-04 |
2929 | Minimizing mean flow time on a single batch-processing machine for the burn-in test operation of semiconductor manufacturing = 반도체 제조 burn-in공정을 위한 배치 공정 설비에서 평균 흐름시간 최소화문제link Hong, Yang-Pyo; 홍양표; et al, 한국과학기술원, 1996 |
2930 | MINIMIZING MEAN TARDINESS AND EARLINESS IN SINGLE-MACHINE SCHEDULING PROBLEMS WITH UNEQUAL DUE-DATES Kim, Yeong-Dae; YANO, CA, NAVAL RESEARCH LOGISTICS, v.41, no.7, pp.913 - 933, 1994-12 |
2931 | Minimizing the number of patterns in the two-dimensional cutting stock problem Paek, Seunghoon; Park, Sung-Soo, 대한산업공학회 추계학술대회, 대한산업공학회, 2018-11-09 |
2932 | Minimizing the Number of Switching in an SS/TDMA System with Inter-Satellite Links and Variable Bandwidth Allowed 성창섭, 대한산업공학회 추계학술대회, pp.271 - 274, 2001 |
2933 | Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance Lee, Ju-Yong; Kim, Yeong-Dae, COMPUTERS OPERATIONS RESEARCH, v.39, no.9, pp.2196 - 2205, 2012-09 |
2934 | Minimizing tool costs subject to a makespan constraint in a flexible manufacturing system Lim, Seung-Kil; Lee, Geun-Cheol; Choi, Seong-Kook; Kim, Yeong-Dae, Asia-Pacific Conference on Industrial Engineering and Management Systems, pp.243 - 246, 1999 |
2935 | Minimizing total tardiness in a single machine scheduling problem with periodically scheduled maintenance = 정기적인 정비 계획이 있는 단일 기계 공정에서의 납기지연 최소화를 위한 연구link Du, Nguyen Van; Du, N. V.; et al, 한국과학기술원, 2009 |
2936 | Minimizing total tardiness in a two parallel batch-and-single machines system with incompatible job families = 두 대로 구성된 병렬 (뱃치, 단독) 시스템에서 Incompatible job 패밀리에 대한 total tardiness 대상의 스케줄링 연구link Tang, Chonglin; 당숭린; Tang, C. Lin; et al, 한국과학기술원, 2006 |
2937 | Minimizing total tardiness in a two-machine flowshop scheduling problem with availability constraint on the first machine Lee, Ju-Yong; Kim, Yeong-Dae, COMPUTERS & INDUSTRIAL ENGINEERING, v.114, pp.22 - 30, 2017-12 |
2938 | Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times Jeong, Bong Joo; Kim, Yeong-Dae, COMPUTERS & OPERATIONS RESEARCH, v.47, pp.72 - 80, 2014-07 |
2939 | Minimizing total tardiness in an unrelated parallel-machine scheduling problem Shim, Sang-Oh; Kim, Yeong-Dae, Asia-Pacific Management Conference, pp.979 - 990, 2004 |
2940 | Minimizing total tardiness in an unrelated parallel-machine scheduling problem Shim, SO; Kim, Yeong-Dae, JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.58, pp.346 - 354, 2007-03 |