Two-Server Network Disconnection Problem. - Byung-Cheon Choi; Sung-Pil Hong (ICCSA (3), 2006)

Single machine scheduling problems with resource dependent release times. - Byung-Cheon Choi; Suk-Hun Yoon; Sung-Jin Chung (Comput. Oper. Res., 2007)

Minimizing maximum completion time in a proportionate flow shop with one machine of different speed. - Byung-Cheon Choi; Suk-Hun Yoon; Sung-Jin Chung (Eur. J. Oper. Res., 2007)

Single machine scheduling problem with controllable processing times and resource dependent release times. - Byung-Cheon Choi; Suk-Hun Yoon; Sung-Jin Chung (Eur. J. Oper. Res., 2007)

Approximability of the k-server disconnection problem. - Sung-Pil Hong; Byung-Cheon Choi (Networks, 2007)

Polynomiality of sparsest cuts with fixed number of sources. - Sung-Pil Hong; Byung-Cheon Choi (Oper. Res. Lett., 2007)

Maximizing the weighted number of just-in-time jobs in flow shop scheduling. - Byung-Cheon Choi; Suk-Hun Yoon (J. Sched., 2007)

Approximation algorithms for multi-agent scheduling to minimize total weighted completion time. - Kangbok Lee; Byung-Cheon Choi; Joseph Y.-T. Leung; Michael L. Pinedo (Inf. Process. Lett., 2009)

Complexity of single machine scheduling subject to nonnegative inventory constraints. - Dirk Briskorn; Byung-Cheon Choi; Kangbok Lee; Joseph Y.-T. Leung; Michael L. Pinedo (Eur. J. Oper. Res., 2010)

Flow shops with machine maintenance: Ordered and proportionate cases. - Byung-Cheon Choi; Kangbok Lee; Joseph Y.-T. Leung; Michael L. Pinedo (Eur. J. Oper. Res., 2010)

A note on makespan minimization in proportionate flow shops. - Byung-Cheon Choi; Joseph Y.-T. Leung; Michael L. Pinedo (Inf. Process. Lett., 2010)

A vector space approach to tag cloud similarity ranking. - Jonghun Park; Byung-Cheon Choi; Kwanho Kim (Inf. Process. Lett., 2010)

Complexity of a scheduling problem with controllable processing times. - Byung-Cheon Choi; Joseph Y.-T. Leung; Michael L. Pinedo (Oper. Res. Lett., 2010)

Two-machine flow shop scheduling problem with an outsourcing option. - Byung-Cheon Choi; Jibok Chung (Eur. J. Oper. Res., 2011)

Two-stage production scheduling with an outsourcing option. - Kangbok Lee; Byung-Cheon Choi (Eur. J. Oper. Res., 2011)

Minimizing makespan in an ordered flow shop with machine-dependent processing times. - Byung-Cheon Choi; Joseph Y.-T. Leung; Michael L. Pinedo (J. Comb. Optim., 2011)

Just-in-Time Scheduling under Scenario-Based Uncertainty. - Dae-Young Chung; Byung-Cheon Choi (Asia Pac. J. Oper. Res., 2013)

Job release scheduling problem: Complexity and an approximation algorithm. - Byung-Cheon Choi; Jibok Chung (Discret. Appl. Math., 2013)

Outsourcing and scheduling for two-machine ordered flow shop scheduling problems. - Dae-Young Chung; Byung-Cheon Choi (Eur. J. Oper. Res., 2013)

Two-stage proportionate flexible flow shop to minimize the makespan. - Byung-Cheon Choi; Kangbok Lee (J. Comb. Optim., 2013)

Outsourcing Decisions in M-Machine Permutation Flow shop Scheduling Problems with Machine-dependent Processing times. - Byung-Cheon Choi; Myoung-Ju Park (Asia Pac. J. Oper. Res., 2014)

Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs. - Byung-Cheon Choi; Jibok Chung (Eur. J. Oper. Res., 2014)

Two-agent single-machine scheduling problem with just-in-time jobs. - Byung-Cheon Choi; Jibok Chung (Theor. Comput. Sci., 2014)

Min-Max Regret Version of the Linear Time-Cost Tradeoff Problem with Multiple Milestones and Completely Ordered Jobs. - Byung-Cheon Choi; Myoung-Ju Park (Asia Pac. J. Oper. Res., 2015)

A Batch Scheduling Problem with Two Agents. - Byung-Cheon Choi; Myoung-Ju Park (Asia Pac. J. Oper. Res., 2015)

An adaptive crashing policy for stochastic time-cost tradeoff problems. - Changmuk Kang; Byung-Cheon Choi (Comput. Oper. Res., 2015)

A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs. - Byung-Cheon Choi; Myoung-Ju Park (Eur. J. Oper. Res., 2015)

An Ordered Flow Shop with Two Agents. - Byung-Cheon Choi; Myoung-Ju Park (Asia Pac. J. Oper. Res., 2016)

Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty. - Byung-Cheon Choi; Kwanghun Chung (Eur. J. Oper. Res., 2016)

Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures. - Byung-Gyoo Kim; Byung-Cheon Choi; Myoung-Ju Park (Asia Pac. J. Oper. Res., 2017)

Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks. - Byung-Cheon Choi; Myoung-Ju Park (Eur. J. Oper. Res., 2017)

Just-In-Time Scheduling with Generalized Due Dates and Identical Due Date Intervals. - Byung-Cheon Choi; Myoung-Ju Park (Asia Pac. J. Oper. Res., 2018)

A linear time-cost tradeoff problem with multiple interim assessments within multiple projects in parallel. - Byung-Cheon Choi; Myoung-Ju Park (Comput. Ind. Eng., 2019)

A linear time-cost tradeoff problem with multiple milestones under a comb graph. - Byung-Cheon Choi; Changmuk Kang (J. Comb. Optim., 2019)

Strong NP-hardness of minimizing total deviation with generalized and periodic due dates. - Byung-Cheon Choi; Yunhong Min; Myoung-Ju Park (Oper. Res. Lett., 2019)

Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates. - Myoung-Ju Park; Byung-Cheon Choi; Yunhong Min; Kyung Min Kim (Asia Pac. J. Oper. Res., 2020)

A just-in-time scheduling problem with two competing agents. - Byung-Cheon Choi; Jibok Chung; Myoung-Ju Park (Optim. Lett., 2020)

Scheduling two projects with controllable processing times in a single-machine environment. - Byung-Cheon Choi; Myoung-Ju Park (J. Sched., 2020)

Two-machine flow shops with an optimal permutation schedule under a storage constraint. - Yunhong Min; Byung-Cheon Choi; Myoung-Ju Park (J. Sched., 2020)

A Parallel Machine Scheduling Problem Maximizing Total Weighted Early Work. - Byung-Cheon Choi; Myoung-Ju Park; Kyung Min Kim; Yunhong Min (Asia Pac. J. Oper. Res., 2021)

A Time-Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph. - Myoung-Ju Park; Byung-Cheon Choi; Jibok Chung (Asia Pac. J. Oper. Res., 2021)

Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty. - Byung-Cheon Choi; Myoung-Ju Park (J. Comb. Optim., 2021)

A single machine scheduling with generalized and periodic due dates to minimize total deviation. - Byung-Cheon Choi; Kyung Min Kim; Yunhong Min; Myoung-Ju Park (Discret. Appl. Math., 2022)

Scheduling with generalized and periodic due dates under single- and two-machine environments. - Byung-Cheon Choi; Kyung Min Kim; Yunhong Min; Myoung-Ju Park (Optim. Lett., 2022)

Single-machine scheduling with resource-dependent processing times and multiple unavailability periods. - Byung-Cheon Choi; Myoung-Ju Park (J. Sched., 2022)

Two-machine flow shop scheduling with convex resource consumption functions. - Byung-Cheon Choi; Myoung-Ju Park (Optim. Lett., 2023)

Correction to: Two‑machine flow shop scheduling with convex resource consumption functions. - Byung-Cheon Choi; Myoung-Ju Park (Optim. Lett., 2023)

A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work. - Yunhong Min; Byung-Cheon Choi; Myoung-Ju Park; Kyung Min Kim (4OR, 2023)

A Resource Allocation Problem with Convex Resource-Dependent Processing Times Under A Two-Machine Flow Shop Environment. - Byung-Cheon Choi; Jun-Ho Lee (Asia Pac. J. Oper. Res., 2024)

Scheduling step-deteriorating jobs on a single machine with multiple critical dates. - Byung-Cheon Choi; Eun-Seok Kim; Jun-Ho Lee (J. Oper. Res. Soc., 2025)

Two-machine permutation flow shop scheduling with generalized due dates to minimize total late work. - Byung-Cheon Choi; Myoung-Ju Park; Kyung Min Kim (J. Sched., 2025)