 | 2012 |
|---|
| 23 |       | Ju-Yong Lee,
Yeong-Dae Kim:
Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance.
Computers & OR 39(9): 2196-2205 (2012) |
| 2011 |
|---|
| 22 | | Bong-Kyun Kim,
Yeong-Dae Kim:
Heuristic algorithms for assigning and scheduling flight missions in a military aviation unit.
Computers & Industrial Engineering 61(4): 1309-1317 (2011) |
| 21 | | June-Young Bang,
Yeong-Dae Kim:
Scheduling algorithms for a semiconductor probing facility.
Computers & OR 38(3): 666-673 (2011) |
| 2010 |
|---|
| 20 | | Dong-Guen Kim,
Yeong-Dae Kim:
A branch and bound algorithm for determining locations of long-term care facilities.
European Journal of Operational Research 206(1): 168-177 (2010) |
| 19 | | June-Young Bang,
Yeong-Dae Kim:
Hierarchical Production Planning for Semiconductor Wafer Fabrication Based on Linear Programming and Discrete-Event Simulation.
IEEE T. Automation Science and Engineering 7(2): 326-336 (2010) |
| 2009 |
|---|
| 18 | | Seong-Woo Choi,
Yeong-Dae Kim:
Minimizing total tardiness on a two-machine re-entrant flowshop.
European Journal of Operational Research 199(2): 375-384 (2009) |
| 17 | | Yeong-Dae Kim,
Byung-Jun Joo,
Jong-Ho Shin:
Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint.
J. Heuristics 15(1): 19-42 (2009) |
| 2008 |
|---|
| 16 | | June-Young Bang,
Jae-Hun Kang,
Bong-Kyun Kim,
Yeong-Dae Kim:
Multi-product lot merging/splitting algorithms for a semiconductor wafer fabrication.
Winter Simulation Conference 2008: 2209-2215 |
| 15 | | Sang-Oh Shim,
Yeong-Dae Kim:
A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property.
Computers & OR 35(3): 863-875 (2008) |
| 14 | | Seong-Woo Choi,
Yeong-Dae Kim:
Minimizing makespan on an m-machine re-entrant flowshop.
Computers & OR 35(5): 1684-1696 (2008) |
| 13 | | Truong Ton Hien Duc,
Huynh Trung Luong,
Yeong-Dae Kim:
A measure of bullwhip effect in supply chains with a mixed autoregressive-moving average demand process.
European Journal of Operational Research 187(1): 243-256 (2008) |
| 2007 |
|---|
| 12 | | Ho-Joo Lee,
Yeong-Dae Kim:
Heuristics for search sequencing under time-dependent probabilities of existence.
Computers & OR 34(7): 2010-2024 (2007) |
| 11 | | Sang-Oh Shim,
Yeong-Dae Kim:
Scheduling on parallel identical machines to minimize total tardiness.
European Journal of Operational Research 177(1): 135-146 (2007) |
| 2004 |
|---|
| 10 | | Seong-Hoon Choi,
Yeong-Dae Kim:
Reallocation of paths of ABR services in a multistage interconnection network (MIN)-type ATM switch network.
European Journal of Operational Research 159(1): 207-218 (2004) |
| 2003 |
|---|
| 9 | | Jae-Gon Kim,
Yeong-Dae Kim:
A linear programming-based algorithm for floorplanning in VLSI design.
IEEE Trans. on CAD of Integrated Circuits and Systems 22(5): 584-592 (2003) |
| 2001 |
|---|
| 8 | | Yeong-Dae Kim,
Dong-Ho Lee,
Chi-Moon Yoon:
Two-stage heuristic algorithms for part input sequencing in flexible manufacturing systems.
European Journal of Operational Research 133(3): 624-634 (2001) |
| 7 | | Yeong-Dae Kim,
Jae-Gon Kim,
Bum Choi,
Hyung-Un Kim:
Production scheduling in a semiconductor wafer fabrication facility producing multiple product types with distinct due dates.
IEEE Transactions on Robotics 17(5): 589-598 (2001) |
| 6 | | Yeong-Dae Kim,
Geun-Cheol Lee,
Seong-Kook Choi,
Seung-Kil Lim:
Tool requirements planning in a flexible manufacturing system with an automatic tool transporter.
IEEE Transactions on Robotics 17(6): 795-804 (2001) |
| 2000 |
|---|
| 5 | | Moon-Won Park,
Yeong-Dae Kim:
A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints.
European Journal of Operational Research 123(3): 504-518 (2000) |
| 1998 |
|---|
| 4 | | Moon-Won Park,
Yeong-Dae Kim:
A systematic procedure for setting parameters in simulated annealing algorithms.
Computers & OR 25(3): 207-217 (1998) |
| 1996 |
|---|
| 3 | | Jung-Ug Kim,
Yeong-Dae Kim:
Simulated annealing and genetic algorithms for scheduling products with multi-level product structure.
Computers & OR 23(9): 857-868 (1996) |
| 1995 |
|---|
| 2 | | Yeong-Dae Kim:
A backward approach in list scheduling algorithms for multi-machine tardiness problems.
Computers & OR 22(3): 307-319 (1995) |
| 1993 |
|---|
| 1 | | Yeong-Dae Kim:
A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops.
Computers & OR 20(4): 391-401 (1993) |
Data released under the ODC-BY 1.0 license — See also our legal information page