default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDByung-Cheon Choi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j47]Byung-Cheon Choi, Jun-Ho Lee:
A Resource Allocation Problem with Convex Resource-Dependent Processing Times Under A Two-Machine Flow Shop Environment. Asia Pac. J. Oper. Res. 41(2): 2350018:1-2350018:19 (2024)- 2023
- [j46]Yunhong Min, Byung-Cheon Choi, Myoung-Ju Park, Kyung Min Kim
:
A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work. 4OR 21(3): 421-437 (2023) - [j45]Byung-Cheon Choi, Myoung-Ju Park:
Two-machine flow shop scheduling with convex resource consumption functions. Optim. Lett. 17(5): 1241-1259 (2023) - [j44]Byung-Cheon Choi, Myoung-Ju Park:
Correction to: Two‑machine flow shop scheduling with convex resource consumption functions. Optim. Lett. 17(5): 1261-1262 (2023) - 2022
- [j43]Byung-Cheon Choi, Kyung Min Kim, Yunhong Min, Myoung-Ju Park:
A single machine scheduling with generalized and periodic due dates to minimize total deviation. Discret. Appl. Math. 314: 31-52 (2022) - [j42]Byung-Cheon Choi, Kyung Min Kim, Yunhong Min, Myoung-Ju Park:
Scheduling with generalized and periodic due dates under single- and two-machine environments. Optim. Lett. 16(2): 623-633 (2022) - [j41]Byung-Cheon Choi, Myoung-Ju Park:
Single-machine scheduling with resource-dependent processing times and multiple unavailability periods. J. Sched. 25(2): 191-202 (2022) - 2021
- [j40]Byung-Cheon Choi, Myoung-Ju Park, Kyung Min Kim, Yunhong Min:
A Parallel Machine Scheduling Problem Maximizing Total Weighted Early Work. Asia Pac. J. Oper. Res. 38(6): 2150007:1-2150007:16 (2021) - [j39]Myoung-Ju Park, Byung-Cheon Choi, Jibok Chung:
A Time-Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph. Asia Pac. J. Oper. Res. 38(6): 2150012:1-2150012:20 (2021) - [j38]Byung-Cheon Choi, Myoung-Ju Park:
Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty. J. Comb. Optim. 41(4): 781-793 (2021) - 2020
- [j37]Myoung-Ju Park, Byung-Cheon Choi, Yunhong Min, Kyung Min Kim:
Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates. Asia Pac. J. Oper. Res. 37(1): 1950032:1-1950032:16 (2020) - [j36]Byung-Cheon Choi, Jibok Chung, Myoung-Ju Park:
A just-in-time scheduling problem with two competing agents. Optim. Lett. 14(7): 1869-1886 (2020) - [j35]Yunhong Min, Byung-Cheon Choi, Myoung-Ju Park:
Two-machine flow shops with an optimal permutation schedule under a storage constraint. J. Sched. 23(3): 327-336 (2020) - [j34]Byung-Cheon Choi, Myoung-Ju Park:
Scheduling two projects with controllable processing times in a single-machine environment. J. Sched. 23(5): 619-628 (2020)
2010 – 2019
- 2019
- [j33]Byung-Cheon Choi, Myoung-Ju Park:
A linear time-cost tradeoff problem with multiple interim assessments within multiple projects in parallel. Comput. Ind. Eng. 128: 651-658 (2019) - [j32]Byung-Cheon Choi, Changmuk Kang:
A linear time-cost tradeoff problem with multiple milestones under a comb graph. J. Comb. Optim. 38(2): 341-361 (2019) - [j31]Byung-Cheon Choi, Yunhong Min, Myoung-Ju Park:
Strong NP-hardness of minimizing total deviation with generalized and periodic due dates. Oper. Res. Lett. 47(5): 433-437 (2019) - 2018
- [j30]Byung-Cheon Choi, Myoung-Ju Park:
Just-In-Time Scheduling with Generalized Due Dates and Identical Due Date Intervals. Asia Pac. J. Oper. Res. 35(6): 1850046:1-1850046:13 (2018) - 2017
- [j29]Byung-Gyoo Kim, Byung-Cheon Choi, Myoung-Ju Park:
Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures. Asia Pac. J. Oper. Res. 34(4): 1750017:1-1750017:17 (2017) - [j28]Byung-Cheon Choi, Myoung-Ju Park:
Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks. Eur. J. Oper. Res. 260(2): 514-519 (2017) - 2016
- [j27]Byung-Cheon Choi, Myoung-Ju Park:
An Ordered Flow Shop with Two Agents. Asia Pac. J. Oper. Res. 33(5): 1650037:1-1650037:24 (2016) - [j26]Byung-Cheon Choi, Kwanghun Chung:
Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty. Eur. J. Oper. Res. 252(2): 367-375 (2016) - 2015
- [j25]Byung-Cheon Choi, Myoung-Ju Park:
Min-Max Regret Version of the Linear Time-Cost Tradeoff Problem with Multiple Milestones and Completely Ordered Jobs. Asia Pac. J. Oper. Res. 32(5): 1550039:1-1550039:16 (2015) - [j24]Byung-Cheon Choi, Myoung-Ju Park:
A Batch Scheduling Problem with Two Agents. Asia Pac. J. Oper. Res. 32(6): 1550044:1-1550044:19 (2015) - [j23]Changmuk Kang, Byung-Cheon Choi:
An adaptive crashing policy for stochastic time-cost tradeoff problems. Comput. Oper. Res. 63: 1-6 (2015) - [j22]Byung-Cheon Choi, Myoung-Ju Park:
A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs. Eur. J. Oper. Res. 244(3): 748-752 (2015) - 2014
- [j21]Byung-Cheon Choi, Myoung-Ju Park:
Outsourcing Decisions in M-Machine Permutation Flow shop Scheduling Problems with Machine-dependent Processing times. Asia Pac. J. Oper. Res. 31(4) (2014) - [j20]Byung-Cheon Choi, Jibok Chung:
Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs. Eur. J. Oper. Res. 236(1): 61-68 (2014) - [j19]Byung-Cheon Choi, Jibok Chung:
Two-agent single-machine scheduling problem with just-in-time jobs. Theor. Comput. Sci. 543: 37-45 (2014) - 2013
- [j18]Dae-Young Chung, Byung-Cheon Choi:
Just-in-Time Scheduling under Scenario-Based Uncertainty. Asia Pac. J. Oper. Res. 30(2) (2013) - [j17]Byung-Cheon Choi, Jibok Chung:
Job release scheduling problem: Complexity and an approximation algorithm. Discret. Appl. Math. 161(6): 858-863 (2013) - [j16]Dae-Young Chung, Byung-Cheon Choi:
Outsourcing and scheduling for two-machine ordered flow shop scheduling problems. Eur. J. Oper. Res. 226(1): 46-52 (2013) - [j15]Byung-Cheon Choi, Kangbok Lee:
Two-stage proportionate flexible flow shop to minimize the makespan. J. Comb. Optim. 25(1): 123-134 (2013) - 2011
- [j14]Byung-Cheon Choi, Jibok Chung:
Two-machine flow shop scheduling problem with an outsourcing option. Eur. J. Oper. Res. 213(1): 66-72 (2011) - [j13]Kangbok Lee, Byung-Cheon Choi:
Two-stage production scheduling with an outsourcing option. Eur. J. Oper. Res. 213(3): 489-497 (2011) - [j12]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
- [j11]Byung-Cheon Choi, Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo:
Flow shops with machine maintenance: Ordered and proportionate cases. Eur. J. Oper. Res. 207(1): 97-104 (2010) - [j10]Dirk Briskorn, Byung-Cheon Choi, Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo:
Complexity of single machine scheduling subject to nonnegative inventory constraints. Eur. J. Oper. Res. 207(2): 605-619 (2010) - [j9]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) - [j8]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) - [j7]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)
2000 – 2009
- 2009
- [j6]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
- [j5]Byung-Cheon Choi, Suk-Hun Yoon, Sung-Jin Chung:
Single machine scheduling problems with resource dependent release times. Comput. Oper. Res. 34(7): 1988-2000 (2007) - [j4]Byung-Cheon Choi, Suk-Hun Yoon, Sung-Jin Chung:
Minimizing maximum completion time in a proportionate flow shop with one machine of different speed. Eur. J. Oper. Res. 176(2): 964-974 (2007) - [j3]Byung-Cheon Choi, Suk-Hun Yoon, Sung-Jin Chung:
Single machine scheduling problem with controllable processing times and resource dependent release times. Eur. J. Oper. Res. 181(2): 645-653 (2007) - [j2]Sung-Pil Hong, Byung-Cheon Choi:
Approximability of the k-server disconnection problem. Networks 50(4): 273-282 (2007) - [j1]Sung-Pil Hong, Byung-Cheon Choi:
Polynomiality of sparsest cuts with fixed number of sources. Oper. Res. Lett. 35(6): 739-742 (2007) - 2006
- [c1]Byung-Cheon Choi, Sung-Pil Hong:
Two-Server Network Disconnection Problem. ICCSA (3) 2006: 785-792
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 21:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
