교수소개 CNU College of Economics And Management

경영학부

최병천 교수

  • 전공

    생산·MIS

  • 연구실

    042-821-5577

  • 이메일

    polytime@cnu.ac.kr

학력
1996.3 - 2000.2 서울대학교 산업공학과(공학사)
2000.3 - 2006.2 서울대학교 산업공학과(공학박사)
주요경력
2018.03 - 현 재 충남대학교 경영학부 교수
2013.08 - 2018.02 충남대학교 경영학부 부교수
2009.08 - 2013.08 충남대학교 경영학부 조교수
2008.02 - 2009.06 뉴욕대학(NYU) Post Doc.
2006.03 - 2007.08 삼성전자 반도체 사업부 책임
연구실적 (해외)
1. Byung-Gyoo Kim, Byung-Cheon Choi and Myoung-Ju Park. Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures. Asian-Pacific Journal of Operational Research 34(2017) 1--17
2. Byung-Cheon Choi and Myoung-Ju Park. A single-machine scheduling problem with uncertainty in processing times and outsourcing costs. Mathematical Problems in Engineering, 2017(2017) Article ID 5791796
3. Byung-Cheon Choi and Myoung-Ju Park. Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks. European Journal of Operational Research 260(2017) 514--519
4. Byung-Cheon Choi and Myoung-Ju Park. An ordered flow shop with two agents. Asia-Pacific Journal of Operational Research 33(2016) 1--24
5. Byung-Cheon Choi and Kwanghun Chung. Min-Max Regret Version of a Scheduling Problem with Outsourcing Decisions under Processing Time Uncertainty. European Journal of Operational Research 252(2016) 367--375
6. Byung-Cheon Choi and Myoung-Ju Park. Min-max regret version of the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs. Asia Pacific Journal of Operational Research 32(2015) 1--16
7. Chang-muk Kang and Byung-Cheon Choi. An adaptive crashing policy for stochastic time-cost tradeoff problems. Computers and Operations Research 63(2015) 1--6
8. Byung-Cheon Choi and Myoung-Ju Park. A batch scheduling problem with two agents. Asia Pacific Journal of Operational Research 32(2015) 1--19
9. Byung-Cheon Choi and Myoung-Ju Park. A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs. European Journal of Operational Research 244(2015) 748--752
10. Byung-Cheon Choi and Jibok Chung. Two-agent single-machine scheduling problem with just-in-time jobs. Theoretical Computer Science} 543(2014)37--45
11. Byung-Cheon Choi and Myoung-Ju Park. Outsourcing decisions in m-machine permutation flow shop scheduling problems with machine-dependent processing times. Asia Pacific Journal of Operational Research 31(2014)
12. Byung-Cheon Choi and Jibok Chung. Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs. European Journal of Operational Research 236 (2014) 61-68
13. Dae-Young Chung and Byung-Cheon Choi. Just-in-time scheduling under scenario-based uncertainty. Asia-Pacific Journal of Operational Research 30 (2013)
14. Byung-Cheon Choi and Jibok Chung. Job Release Scheduling Problem: Complexity and an Approximation Algorithm. Discrete Applied Mathematics 161 (2013) 858-863
15. Dae-Young Chung and Byung-Cheon Choi. Outsourcing and scheduling for two-machine ordered flow shop scheduling problems. European Journal of Operational Research 226 (2013) 46-52
16. Byung-Cheon Choi, Kangbok Lee. Two-Stage Proportionate Flexible Flow Shop to Minimize the Makespan. Journal of Combinatorial Optimization 25 (2013) 123-134
17. Kangbok Lee, Byung-Cheon Choi, Joseph Y-T. Leung, Michael L. Pinedo and Dirk Briskorn. Minimizing the total weighted delivery time in container scheduling. Naval Logistics Research 59 (2012) 266-277
18. Byung-Cheon Choi, Kangbok Lee, Joseph Y-T. Leung, Michael L. Pinedo and Dirk Briskorn. Container Scheduling: Complexity and Algorithms. Production and Operations Management 21 (2012) 115-128
19. Byung-Cheon Choi, Joseph Y-T. Leung and Michael L. Pinedo. Minimizing the makespan in a proportionate flow shop with machine-dependent processing times. Journal of Combinatorial Optimization 22 (2011) 797-818
20. Kangbok Lee and Byung-Cheon Choi. Two-stage Supply Chain Scheduling with an Outsourcing Option. European Journal of Operational Research 213 (2011) 489-497
21. Byung-Cheon Choi and Jibok Chung. Two-Machine Flow shop Scheduling Problem with an Outsourcing Option. European Journal of Operational Research 213 (2011) 66-72
22. Byung-Cheon Choi, Joseph Y-T. Leung and Michael L. Pinedo. A note on makespan minimization in proportionate flow shops. Information Processing Letters 111 (2010) 77-81
23. B. Dirk, Byung-Cheon Choi, Kangbok Lee, Joseph Y-T. Leung and Michael L. Pinedo, Inventory Constrained Scheduling on a Single Machine. European Journal of Operational Research 207 (2010) 605-619
24. Byung-Cheon Choi, Kangbok Lee, Joseph Y-T. Leung, and Michael L. Pinedo, Flow Shops with Machine Maintenance: Ordered and Proportionate Cases. European Journal of Operational Research 207 (2010) 97-104
25. Junghun Park, Byung-Cheon Choi, and Kwanho Kim. A Vector Space Approach to Tag Cloud Similarity Ranking. Information Processing Letters 110 (2010) 489-196
26. Byung-Cheon Choi, Joseph Y-T. Leung and Michael L. Pinedo. Complexity of a scheduling problem with controllable processing times. Operations Research Letters 38 (2010) 123-126
27. Kangbok Lee, Byung-Cheon Choi, Joseph Y-T. Leung and Michael L. Pinedo. Approximation algorithms for multi-agent scheduling to minimize total weighted completion time. Information Processing Letters 109 (2009) 913-917
28. Byung-Cheon Choi and Suk-Hun Yoon. Maximizing the weighted number of just-in-time jobs in flow shop scheduling. Journal of Scheduling 10 (2007) 237-243
29. Sung-Pil Hong and Byung-Cheon Choi. Polynomiality of sparsest cuts with fixed number of sources. Operations Research Letters 35 (2007) 739-742
30. Sung-Pil Hong and Byung-Cheon Choi. Approximability of the k-server disconnection problem. Networks 50 (2007) 273-282
31. Byung-Cheon Choi, Suk-Hun Yoon and Sung-Jin Chung. Single machine scheduling problems with resource dependent release times. Computers & Operations Research 34 (2007) 1988-2000
32. Byung-Cheon Choi, Suk-Hun Yoon and Sung-Jin Chung. Minimizing maximum completetion time in a proportionate flow shop with one machine of different speed. European Journal of Operational Research 176 (2007) 964-974
33. Byung-Cheon Choi, Suk-Hun Yoon and Sung-Jin Chung. Single machine scheduling problem with controllable processing times and resource dependent release times. European Journal of Operational Research 181 (2007) 645-653
34. Byung-Cheon Choi, Suk-Hun Yoon and Sung-Jin Chung. Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds. International Journal of Production Research 44 (2006) 715-728
35. Byung-Cheon Choi and Sung-Pil Hong. Two-server network disconnection problem. Lecture Note on Computer Science 3982 (2006) 757-764
연구실적 (국내)
1. B.C. Choi, and Yunhong Min. A time-cost tradeoff problem with multiple interim assessments under the precedence graph with two chains in parallel. Journal of The Korea Society of Computer and Information 23(2018) 85--92
2. Jibok Chung and Byung-Cheon Choi. Complexity and algorithms for optimal bundle search. Journal of Distribution Science 15(2017) 35--42
3. Jibok Chung, Byung-Cheon Choi, Yong-Sang Cho and Lak-Chae Chung. Service quality of online grocery shopping in Korean local regions. Journal of Distribution Science 14-8 (2016) 67-75
4. Byung-Cheon Choi and Jibok Chung. Some special cases of a continuous time--cost tradeoff problem with multiple milestones under a chain precedence graph. Management Science and Financial Engineering 22 (2016) 5-12
5. Jibok Chung and Byung-Cheon Choi. Optimization of transportation problem in dynamic logistics network. Journal of Distribution Science 14-2 (2016) 41-45
6. Byung-Cheon Choi and Myoung-Ju Park. Min-max regret version of m-machine ordered flow shop scheduling problem with uncertain processing times. Management Science and Financial Engineering 21 (2015) 1-9
7. Byung-Cheon Choi and Jibok-Chung. Complexity results for the design problem of content distribution networks. Management Science and Financial Engineering 20 (2014) 7-12
8. Byung-Cheon Choi and Myoung-Ju Park. Parallel machine scheduling with identical jobs and sequence-independent setup times. The Korean Operations Research and Management Science 39 (2014) 83-92
9. Byung-Hyun Ha, Jung-Ryoul son, Kyu-Kab Cho and Byung-Cheon Choi. A Mathematical Programming Approach for Block Storage Problem in Shipbuilding Process. Journal of Korean Institute of Industrial Engineering 30 (2013) 82-99
10. Byung-Cheon Choi and Jibok Chung. Project time-cost tradeoff problem with two milestones under an uncertain processing time. The Korean Operations Research and Management Science 38 (2013) 25-42
11. Dae-Young Chung and Byung-Cheon Choi. Just-in-time scheduling with competing agents. The Korean Operations Research and Management Science 37 (2012) 19-28
12. Jibok Chung, Byung-Cheon Choi, Jongdae Park, Hoyong Ryu. A study on the optimal rate allocation problem in overlay multimedia multicasting. The Korean Operations Research and Management Science 36 (2011) 36-42