Article

Shioura, Akiyoshi, Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2018) Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost. Journal of Global Optimization, 76 (3). pp. 471-490. ISSN 0925-5001 (Print), 1573-2916 (Online) (doi:10.1007/s10898-018-0686-2)

Shioura, Akiyoshi, Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2017) Machine speed scaling by adapting methods for convex optimization with submodular constraints. INFORMS Journal on Computing, 29 (4). pp. 724-736. ISSN 1091-9856 (Print), 1526-5528 (Online) (doi:10.1287/ijoc.2017.0758)

Shioura, Akiyoshi, Shakhlevich, Natalia V. and Strusevich, Vitaly (2017) Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches. European Journal of Operational Research, 266 (3). pp. 795-818. ISSN 0377-2217 (doi:10.1016/j.ejor.2017.08.034)

Shioura, Akiyoshi, Shakhlevich, Natalia V. and Strusevich, Vitaly (2016) Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines. INFORMS Journal on Computing, 28 (1). pp. 148-161. ISSN 1091-9856 (Print), 1526-5528 (Online) (doi:10.1287/ijoc.2015.0660)

Shioura, Akiyoshi, Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2015) Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times. Mathematical Programming, 153 (2). pp. 495-534. ISSN 0025-5610 (Print), 1436-4646 (Online) (doi:10.1007/s10107-014-0814-9)

Shioura, Akiyoshi, Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2013) A submodular optimization approach to bicriteria scheduling problems with controllable processing times on parallel machines. SIAM Journal on Discrete Mathematics, 27 (1). pp. 186-204. ISSN 0895-4801 (Print), 1095-7146 (Online) (doi:10.1137/110843836)

Shakhlevich, Natalia V., Shioura, Akiyoshi and Strusevich, Vitaly A. (2009) Single machine scheduling with controllable processing times by submodular optimization. International Journal of Foundations of Computer Science, 20 (2). pp. 247-269. ISSN 0129-0541 (Print), 1793-6373 (Online) (doi:10.1142/S0129054109006541)

Conference Proceedings

Shakhlevich, Natalia V., Shioura, Akiyoshi and Strusevich, Vitaly A. (2008) Fast divide-and-conquer algorithms for preemptive scheduling problems with controllable processing times - a polymatroid optimization approach. In: Algorithms – ESA 2008 : 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings. Lecture Notes in Computer Science (5193). Springer Verlag, Berlin/Heidelberg, Germany, pp. 756-767. ISBN 978-3-540-87743-1 (doi:10.1007/978-3-540-87744-8_63)