Shioura, A, Shakhlevich, N and Strusevich, VA (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
Abstract
In this paper we present a decomposition algorithm for maximizing a linear function over a submodular polyhedron intersected with a box. Apart from this contribution to submodular optimization, our results extend the toolkit available in deterministic machine scheduling with controllable processing times. We demonstrate how this method can be applied to developing fast algorithms for minimizing total compression cost for preemptive schedules on parallel machines with respect to given release dates and a common deadline. Obtained scheduling algorithms are faster and easier to justify than those previously known in the scheduling literature.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © The Author(s) 2014. This article is distributed under the terms of the Creative Commons Attribution License which permits any use, distribution, and reproduction in any medium, provided the original author(s) and the source are credited. |
Keywords: | Submodular optimization; Parallel machine scheduling; Controllable processing times; Decomposition |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) |
Funding Information: | Funder Grant number EPSRC (Engineering and Physical Sciences Research Council) EP/J019755/1 |
Depositing User: | Symplectic Publications |
Date Deposited: | 11 Jul 2017 16:06 |
Last Modified: | 23 Jun 2023 21:47 |
Status: | Published |
Publisher: | Springer Verlag |
Identification Number: | 10.1007/s10107-014-0814-9 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:86260 |