Journal

Choi, B.-C., Park, M.-J. (2026). Single-machine scheduling with controllable processing times: a complexity dichotomy and a faster algorithm, Theoretical Computer Science. Volume 1084, 20 September 2026, 116178.

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

2026

Theoretical Computer Science.

Park, M.-J., Choi, B.-C., Lee, M. (2026). A linear-time algorithm for a resource-dependent preemptive late-work scheduling problem, Operations Research Letters. Volume 69, November 2026, 107513.

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

2026

Operations Research Letters, Volume 69, November 2026, 107513

Choi, B.-C., Park, M.-J., Chung, J., Kim, K.-M. (2026). Just-in-time scheduling with battery constraints. Journal of Scheduling. Volume 29, pp. 337–353.

Choi, B.-C., Park, M.-J., Chung, J., Kim, K.-M.

2026

Journal of Scheduling

Choi, B.-C., Park, M.-J. (2026). Minimizing total completion time in single-machine scheduling with convex resource consumption and job rejection. Theoretical Computer Science, Volume 1064, 26 February 2026, 115708

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

2026

Theoretical Computer Science, Volume 1064, 26 February 2026, 115708

Choi, B.-C., Park, M.-J. (2026). Bicriteria permutation flow shop scheduling problems with machine-dependent convex resource consumption functions, Journal of Combinatorial Optimization, Volume 51, article number 9.

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

2026

Journal of Combinatorial Optimization, Volume 51, article number 9.

Choi, B.-C., Park, M.-J. (2026). A preemptive single-machine scheduling problem with a late work criterion and convex resource consumption functions. Optimization letters. Volume 20, pp. 1025–1042.

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

2026

Optimization letters. Volume 20, pp. 1025–1042.