default search action
Myoung-Ju Park
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j34]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) - [j33]Byung-Cheon Choi, Myoung-Ju Park:
Two-machine flow shop scheduling with convex resource consumption functions. Optim. Lett. 17(5): 1241-1259 (2023) - [j32]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
- [j31]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) - [j30]Seho Yim, Sung-Pil Hong, Myoung-Ju Park, Yerim Chung:
Inverse interval scheduling via reduction on a single machine. Eur. J. Oper. Res. 303(2): 541-549 (2022) - [j29]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) - [j28]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
- [j27]Andy Ham, Myoung-Ju Park:
Electric Vehicle Route Optimization Under Time-of-Use Electricity Pricing. IEEE Access 9: 37220-37228 (2021) - [j26]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) - [j25]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) - [j24]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) - [j23]Andy Ham, Myoung-Ju Park:
Human-Robot Task Allocation and Scheduling: Boeing 777 Case Study. IEEE Robotics Autom. Lett. 6(2): 1256-1263 (2021) - 2020
- [j22]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) - [j21]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) - [j20]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) - [j19]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) - [c1]Andy Ham, Myoung-Ju Park, Ho-Jun Shin, Si-Young Choi, John W. Fowler:
Integrated Scheduling of Jobs, Reticles, Machines, AMHS and ARHS in a Semiconductor Manufacturing. WSC 2020: 1966-1973
2010 – 2019
- 2019
- [j18]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) - [j17]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
- [j16]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
- [j15]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) - [j14]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
- [j13]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) - 2015
- [j12]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) - [j11]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) - [j10]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) - [j9]Yerim Chung, Myoung-Ju Park:
Notes on inverse bin-packing problems. Inf. Process. Lett. 115(1): 60-68 (2015) - 2014
- [j8]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) - [j7]Kwang Sup Shin, Myoung-Ju Park, Jae-Yoon Jung:
Dynamic task assignment and resource management in cloud services by using bargaining solution. Concurr. Comput. Pract. Exp. 26(7): 1432-1452 (2014) - 2013
- [j6]Myoung-Ju Park, Sung-Pil Hong:
Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications. J. Glob. Optim. 56(2): 727-736 (2013) - 2011
- [j5]Junho Chang, Soo Y. Chang, Sung-Pil Hong, Yun-Hong Min, Myoung-Ju Park:
Approximation of a batch consolidation problem. Networks 58(1): 12-19 (2011) - [j4]Myoung-Ju Park, Sung-Pil Hong:
Rank of Handelman hierarchy for Max-Cut. Oper. Res. Lett. 39(5): 323-328 (2011)
2000 – 2009
- 2009
- [j3]Sung-Pil Hong, Sung-Jin Cho, Myoung-Ju Park, Moon-Gul Lee:
Optimal search-relocation trade-off in Markovian-target searching. Comput. Oper. Res. 36(6): 2097-2104 (2009) - [j2]Sung-Pil Hong, Sung-Jin Cho, Myoung-Ju Park:
A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search. Eur. J. Oper. Res. 193(2): 351-364 (2009) - [j1]Sung-Pil Hong, Myoung-Ju Park, Soo Y. Chang:
Approximation of the k-batch consolidation problem. Theor. Comput. Sci. 410(8-10): 963-967 (2009)
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 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint