Items where Author is "Shakhlevich, Natalia V."
 | Up a level |
base polyhedron
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)
controllable processing speeds
Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2006) Single machine scheduling with controllable release and processing parameters. Discrete Applied Mathematics, 154 (15). pp. 2178-2199. ISSN 0166-218X (doi:10.1016/j.dam.2005.04.014)
controllable processing times
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)
Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2008) Preemptive scheduling on uniform parallel machines with controllable job processing times. Algorithmica, 51 (4). pp. 451-473. ISSN 0178-4617 (Print), 1432-0541 (Online) (doi:10.1007/s00453-007-9091-9)
Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2006) Single machine scheduling with controllable release and processing parameters. Discrete Applied Mathematics, 154 (15). pp. 2178-2199. ISSN 0166-218X (doi:10.1016/j.dam.2005.04.014)
controllable release dates
Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2006) Single machine scheduling with controllable release and processing parameters. Discrete Applied Mathematics, 154 (15). pp. 2178-2199. ISSN 0166-218X (doi:10.1016/j.dam.2005.04.014)
controllable release speeds
Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2006) Single machine scheduling with controllable release and processing parameters. Discrete Applied Mathematics, 154 (15). pp. 2178-2199. ISSN 0166-218X (doi:10.1016/j.dam.2005.04.014)
divide-and-conquer algorithm
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)
generalized polymatroid
Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2008) Preemptive scheduling on uniform parallel machines with controllable job processing times. Algorithmica, 51 (4). pp. 451-473. ISSN 0178-4617 (Print), 1432-0541 (Online) (doi:10.1007/s00453-007-9091-9)
ingle machine scheduling
Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2006) Single machine scheduling with controllable release and processing parameters. Discrete Applied Mathematics, 154 (15). pp. 2178-2199. ISSN 0166-218X (doi:10.1016/j.dam.2005.04.014)
maximum flow
Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2008) Preemptive scheduling on uniform parallel machines with controllable job processing times. Algorithmica, 51 (4). pp. 451-473. ISSN 0178-4617 (Print), 1432-0541 (Online) (doi:10.1007/s00453-007-9091-9)
polymatroid
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)
polymatroid optimization
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)
scheduling
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)
single machine scheduling
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)
uniform parallel machine scheduling
Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2008) Preemptive scheduling on uniform parallel machines with controllable job processing times. Algorithmica, 51 (4). pp. 451-473. ISSN 0178-4617 (Print), 1432-0541 (Online) (doi:10.1007/s00453-007-9091-9)