Showing results 1 to 7 of 7
Algorithms for scheduling problems in re-entrant flowshops = 재 투입이 있는 흐름공정에서의 작업스케쥴링에 관한 연구link Choi, Seong-Woo; 최성우; et al, 한국과학기술원, 2007 |
Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times An, Young-Jin; Kim, Yeong-Dae; Choi, Seong-Woo, COMPUTERS & OPERATIONS RESEARCH, v.71, pp.127 - 136, 2016-07 |
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 |
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 |
Minimizing total tardiness of orders with re-entrant lots on a hybrid flowshop = 재투입이 있는 혼합 흐름 공정에서 주문의 총 납기 지연을 최소화하는 스케쥴링 방법 개발link Choi, Seong-Woo; 최성우; et al, 한국과학기술원, 2003 |
Minimizing total tardiness on a two-machine re-entrant flowshop Choi, Seong-Woo; Kim, Yeong-Dae, EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.199, no.2, pp.375 - 384, 2009-12 |
Multiproduct Lot Merging-Splitting Algorithms for Semiconductor Wafer Fabrication Bang, June-Young; Kim, Yeong-Dae; Choi, Seong-Woo, IEEE TRANSACTIONS ON SEMICONDUCTOR MANUFACTURING, v.25, no.2, pp.200 - 210, 2012-05 |
Discover