Search

Your search keyword '"Strusevich, Vitaly A."' showing total 381 results
Start Over Author "Strusevich, Vitaly A."

Refine your results

more »

more »

more »

more »
381 results on '"Strusevich, Vitaly A."'

16. Scheduling with Flexible Maintenance

Author

Strusevich, Vitaly A., Rustogi, Kabir, Price, Camille C., Series editor, Zhu, Joe, Series editor, Hillier, Frederick S., Series editor, Strusevich, Vitaly A., and Rustogi, Kabir

Published
2017
Full Text
View/download PDF

21. Scheduling with Positional Effects

Author

Strusevich, Vitaly A., Rustogi, Kabir, Price, Camille C., Series editor, Zhu, Joe, Series editor, Hillier, Frederick S., Series editor, Strusevich, Vitaly A., and Rustogi, Kabir

Published
2017
Full Text
View/download PDF

22. Introduction to Time-Changing Effects

Author

Strusevich, Vitaly A., Rustogi, Kabir, Price, Camille C., Series editor, Zhu, Joe, Series editor, Hillier, Frederick S., Series editor, Strusevich, Vitaly A., and Rustogi, Kabir

Published
2017
Full Text
View/download PDF

26. Relevant Boolean Programming Problems

Author

Strusevich, Vitaly A., Rustogi, Kabir, Price, Camille C., Series editor, Zhu, Joe, Series editor, Hillier, Frederick S., Series editor, Strusevich, Vitaly A., and Rustogi, Kabir

Published
2017
Full Text
View/download PDF

30. Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques.

Author

Shioura, Akiyoshi, Strusevich, Vitaly A., and Shakhlevich, Natalia V.

Subjects
SCHEDULING, MACHINERY, DEADLINES, COMPUTER scheduling, ARGUMENT, ONLINE algorithms
Abstract

We study the use of flow‐based algorithmic and proof techniques applied to preemptive scheduling of jobs on parallel identical machines. For the classical problem in which the jobs have individual release dates and must be finished by a common deadline, we present and prove unified necessary and sufficient conditions for the existence of a feasible schedule by examining the structure of minimum cuts in a special network. We then study an enhanced model that allows the presence of additional resources, provided that some jobs at any time of their processing require one unit of a particular resource. We extend our argument developed for the classical case to this enhanced model. The generalized necessary and sufficient conditions for the existence of a feasible schedule are presented and proved using the max‐flow/min‐cut reasoning. [ABSTRACT FROM AUTHOR]

Published
2024
Full Text
View/download PDF

33. Handling Scheduling Problems with Controllable Parameters by Methods of Submodular Optimization

Author

Shioura, Akiyoshi, Shakhlevich, Natalia V., Strusevich, Vitaly A., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Kochetov, Yury, editor, Khachay, Michael, editor, Beresnev, Vladimir, editor, Nurminski, Evgeni, editor, and Pardalos, Panos, editor

Published
2016
Full Text
View/download PDF

38. Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints

Author

Shioura, Akiyoshi, Shakhlevich, Natalia V., and Strusevich, Vitaly A.

Subjects
Production management -- Methods, Mathematical optimization -- Research, Management research, Scheduling (Management) -- Methods, Algorithms -- Methods -- Analysis -- Research, Algorithm, Computers, Science and technology
Abstract

Abstract. In this paper, we propose a new methodology for the speed-scaling problem based on its link to scheduling with controllable processing times and submodular optimization. It results in faster [...]

Published
2017
Full Text
View/download PDF

42. Transporting Jobs through a Processing Center with Two Parallel Machines

Author

Kellerer, Hans, Soper, Alan J., Strusevich, Vitaly A., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Wu, Weili, editor, and Daescu, Ovidiu, editor

Published
2010
Full Text
View/download PDF

45. Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach

Author

Shakhlevich, Natalia V., Shioura, Akiyoshi, Strusevich, Vitaly A., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Halperin, Dan, editor, and Mehlhorn, Kurt, editor

Published
2008
Full Text
View/download PDF

50. Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines

Author

Shioura, Akiyoshi, Shakhlevich, Natalia V., and Strusevich, Vitaly A.

Subjects
Engineering research, Mathematical optimization -- Research, Scheduling (Management) -- Methods, Algorithms -- Research, Algorithm, Computers, Science and technology
Abstract

In this paper, we study a scheduling problem on a single machine, provided that the jobs have individual release dates and deadlines, and the processing times are controllable. The objective [...]

Published
2016
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results