Author Info
Name
Affiliation
Papers
MYOUNG-JU PARK
Department of Industrial Engineering, Seoul National University, San 56-1 Shilim-Dong, Kwanahk Gu, Seoul, 151-742, Republic of Korea
20
Collaborators
Citations 
PageRank 
13
29
7.50
Referers 
Referees 
References 
51
305
174
Search Limit
100305
Title
Citations
PageRank
Year
Two-machine ordered flow shop scheduling with generalized due dates00.342020
Two-machine flow shops with an optimal permutation schedule under a storage constraint10.352020
A just-in-time scheduling problem with two competing agents00.342020
Scheduling two projects with controllable processing times in a single-machine environment00.342020
A linear time-cost tradeoff problem with multiple interim assessments within multiple projects in parallel.00.342019
Strong NP-hardness of minimizing total deviation with generalized and periodic due dates00.342019
Just-In-Time Scheduling with Generalized Due Dates and Identical Due Date Intervals.00.342018
Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks.10.352017
Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures.10.352017
An Ordered Flow Shop with Two Agents.10.352016
Min-Max Regret Version of the Linear Time–Cost Tradeoff Problem with Multiple Milestones and Completely Ordered Jobs10.362015
A Batch Scheduling Problem with Two Agents20.372015
A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs.30.462015
Dynamic task assignment and resource management in cloud services by using bargaining solution40.422014
Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications30.422013
Rank of Handelman hierarchy for Max-Cut.20.382011
Approximation of a batch consolidation problem10.382011
Optimal search-relocation trade-off in Markovian-target searching30.412009
Approximation of the k-batch consolidation problem20.432009
A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search40.442009