Choi, B.-C., & Park, M.-J. (2015). Min-max regret version of the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs. Asia-Pacific Journal of Operational Research, 32(5), 1550039.

Home Choi, B.-C., & Park, M.-J. (2015). Min-max regret version of the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs. Asia-Pacific Journal of Operational Research, 32(5), 1550039.

Choi, B.-C., & Park, M.-J. (2015). Min-max regret version of the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs. Asia-Pacific Journal of Operational Research, 32(5), 1550039.

저자

Choi, B.-C., & Park, M.-J.

저널 정보

Asia-Pacific Journal of Operational Research, 32(5), 1550039

출간연도

2015

링크

https://doi.org/10.1142/S0217595915500396

경영과학 연구실Operations Research Lab

Choi, B.-C., & Park, M.-J. (2015). Min-max regret version of the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs. Asia-Pacific Journal of Operational Research, 32(5), 1550039.

Choi, B.-C., & Park, M.-J. (2015). Min-max regret version of the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs. Asia-Pacific Journal of Operational Research, 32(5), 1550039.

경영과학 연구실