Browse "IE-Journal Papers(저널논문)" by Subject Branch and bound
Showing results 1 to 5 of 5
| A branch and bound algorithm for determining locations of long-term care facilities Kim, Dong-Guen; Kim, Yeong-Dae, EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.206, no.1, pp.168 - 177, 2010-10 |
| 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 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 |
| 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 |
| Three-machine flow shop scheduling with overlapping waiting time constraints Kim, Hyunjung; Lee, Jun-Ho, COMPUTERS & OPERATIONS RESEARCH, v.101, pp.93 - 102, 2019-01 |
Discover
Open Access
- 55 OA Article