Skip to main content
Conference Proceedings

Handling scheduling problems with controllable parameters by methods of submodular optimization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2016) 9869 LNCS 74-90
DOI: 10.1007/978-3-319-44914-2_7
1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we demonstrate how scheduling problems with controllable processing times can be reformulated as maximization linear programming problems over a submodular polyhedron intersected with a box. We explain a decomposition algorithm for solving the latter problem and discuss its implications for the relevant problems of preemptive scheduling on a single machine and parallel machines.

Cite

CITATION STYLE

APA

Shioura, A., Shakhlevich, N. V., & Strusevich, V. A. (2016). Handling scheduling problems with controllable parameters by methods of submodular optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9869 LNCS, pp. 74–90). Springer Verlag. https://doi.org/10.1007/978-3-319-44914-2_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free