Search

Your search keyword '"Shakhlevich, Natalia V."' showing total 4 results
Start Over Author "Shakhlevich, Natalia V." Topic single machine
4 results on '"Shakhlevich, Natalia V."'

2. 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

4. Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines.

Author

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

Subjects
*SUBMODULAR functions, *MATHEMATICAL optimization, *MACHINE learning, *PRODUCTION scheduling, *MATHEMATICAL decomposition
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 is to find a feasible schedule that minimizes the total cost of reducing the processing times. We reformulate the problem in terms of maximizing a linear function over a submodular polyhedron intersected with a box. For the latter problem of submodular optimization, we develop a recursive decomposition algorithm and apply it to solving the single machine scheduling problem to achieve the best possible running time. [ABSTRACT FROM AUTHOR]

Published
2016
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results