Myoung-Ju Park
Orcid: 0000-0003-3382-6514
According to our database1,
Myoung-Ju Park
authored at least 35 papers
between 2009 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work.
4OR, September, 2023
Correction to: Two‑machine flow shop scheduling with convex resource consumption functions.
Optim. Lett., June, 2023
Optim. Lett., June, 2023
2022
Single-machine scheduling with resource-dependent processing times and multiple unavailability periods.
J. Sched., 2022
Scheduling with generalized and periodic due dates under single- and two-machine environments.
Optim. Lett., 2022
Eur. J. Oper. Res., 2022
A single machine scheduling with generalized and periodic due dates to minimize total deviation.
Discret. Appl. Math., 2022
2021
IEEE Robotics Autom. Lett., 2021
Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty.
J. Comb. Optim., 2021
A Time-Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph.
Asia Pac. J. Oper. Res., 2021
Asia Pac. J. Oper. Res., 2021
IEEE Access, 2021
2020
Two-machine flow shops with an optimal permutation schedule under a storage constraint.
J. Sched., 2020
Scheduling two projects with controllable processing times in a single-machine environment.
J. Sched., 2020
Asia Pac. J. Oper. Res., 2020
Integrated Scheduling of Jobs, Reticles, Machines, AMHS and ARHS in a Semiconductor Manufacturing.
Proceedings of the Winter Simulation Conference, 2020
2019
Strong NP-hardness of minimizing total deviation with generalized and periodic due dates.
Oper. Res. Lett., 2019
A linear time-cost tradeoff problem with multiple interim assessments within multiple projects in parallel.
Comput. Ind. Eng., 2019
2018
Asia Pac. J. Oper. Res., 2018
2017
Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks.
Eur. J. Oper. Res., 2017
Asia Pac. J. Oper. Res., 2017
2016
2015
A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs.
Eur. J. Oper. Res., 2015
Min-Max Regret Version of the Linear Time-Cost Tradeoff Problem with Multiple Milestones and Completely Ordered Jobs.
Asia Pac. J. Oper. Res., 2015
2014
Dynamic task assignment and resource management in cloud services by using bargaining solution.
Concurr. Comput. Pract. Exp., 2014
Outsourcing Decisions in M-Machine Permutation Flow shop Scheduling Problems with Machine-dependent Processing times.
Asia Pac. J. Oper. Res., 2014
2013
Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications.
J. Glob. Optim., 2013
2011
2009
A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search.
Eur. J. Oper. Res., 2009
Comput. Oper. Res., 2009