 | 2011 |
|---|
| 15 |       | Byung-Cheon Choi,
Jibok Chung:
Two-machine flow shop scheduling problem with an outsourcing option.
European Journal of Operational Research 213(1): 66-72 (2011) |
| 14 | | Kangbok Lee,
Byung-Cheon Choi:
Two-stage production scheduling with an outsourcing option.
European Journal of Operational Research 213(3): 489-497 (2011) |
| 13 | | Byung-Cheon Choi,
Joseph Y.-T. Leung,
Michael L. Pinedo:
Minimizing makespan in an ordered flow shop with machine-dependent processing times.
J. Comb. Optim. 22(4): 797-818 (2011) |
| 2010 |
|---|
| 12 | | Byung-Cheon Choi,
Kangbok Lee,
Joseph Y.-T. Leung,
Michael L. Pinedo:
Flow shops with machine maintenance: Ordered and proportionate cases.
European Journal of Operational Research 207(1): 97-104 (2010) |
| 11 | | Dirk Briskorn,
Byung-Cheon Choi,
Kangbok Lee,
Joseph Y.-T. Leung,
Michael Pinedo:
Complexity of single machine scheduling subject to nonnegative inventory constraints.
European Journal of Operational Research 207(2): 605-619 (2010) |
| 10 | | Jonghun Park,
Byung-Cheon Choi,
Kwanho Kim:
A vector space approach to tag cloud similarity ranking.
Inf. Process. Lett. 110(12-13): 489-496 (2010) |
| 9 | | Byung-Cheon Choi,
Joseph Y.-T. Leung,
Michael L. Pinedo:
A note on makespan minimization in proportionate flow shops.
Inf. Process. Lett. 111(2): 77-81 (2010) |
| 8 | | Byung-Cheon Choi,
Joseph Y.-T. Leung,
Michael L. Pinedo:
Complexity of a scheduling problem with controllable processing times.
Oper. Res. Lett. 38(2): 123-126 (2010) |
| 2009 |
|---|
| 7 | | Kangbok Lee,
Byung-Cheon Choi,
Joseph Y.-T. Leung,
Michael L. Pinedo:
Approximation algorithms for multi-agent scheduling to minimize total weighted completion time.
Inf. Process. Lett. 109(16): 913-917 (2009) |
| 2007 |
|---|
| 6 | | Byung-Cheon Choi,
Suk-Hun Yoon,
Sung-Jin Chung:
Single machine scheduling problems with resource dependent release times.
Computers & OR 34(7): 1988-2000 (2007) |
| 5 | | Byung-Cheon Choi,
Suk-Hun Yoon,
Sung-Jin Chung:
Minimizing maximum completion time in a proportionate flow shop with one machine of different speed.
European Journal of Operational Research 176(2): 964-974 (2007) |
| 4 | | Byung-Cheon Choi,
Suk-Hun Yoon,
Sung-Jin Chung:
Single machine scheduling problem with controllable processing times and resource dependent release times.
European Journal of Operational Research 181(2): 645-653 (2007) |
| 3 | | Sung-Pil Hong,
Byung-Cheon Choi:
Approximability of the k-server disconnection problem.
Networks 50(4): 273-282 (2007) |
| 2 | | Sung-Pil Hong,
Byung-Cheon Choi:
Polynomiality of sparsest cuts with fixed number of sources.
Oper. Res. Lett. 35(6): 739-742 (2007) |
| 2006 |
|---|
| 1 | | Byung-Cheon Choi,
Sung-Pil Hong:
Two-Server Network Disconnection Problem.
ICCSA (3) 2006: 785-792 |
Data released under the ODC-BY 1.0 license — See also our legal information page