Shioura, A, Chakhlevitch, NV and Strusevich, VA (2016) Handling Scheduling Problems with Controllable Parameters by Methods of Submodular Optimization. In: Kochetov, Y, Khachay, M, Beresnev, V, Nurminski, E and Pardalos, P, (eds.) Discrete Optimization and Operations Research. 9th International Conference, DOOR, 19-23 Sep 2016, Vladivostok, Russia. Lecture Notes in Computer Science (9869). Springer International Publishing , Cham, Switzerland , pp. 74-90. ISBN 978-3-319-44913-5
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.
Metadata
Authors/Creators: |
|
||||
---|---|---|---|---|---|
Copyright, Publisher and Additional Information: | © Springer International Publishing Switzerland 2016. This is an author produced version of a paper published in Lecture Notes in Computer Science. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-44914-2_7. Uploaded in accordance with the publisher's self-archiving policy. | ||||
Dates: |
|
||||
Institution: | The University of Leeds | ||||
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) > Institute for Computational and Systems Science (Leeds) | ||||
Funding Information: |
|
||||
Depositing User: | Symplectic Publications | ||||
Date Deposited: | 28 Jul 2016 12:25 | ||||
Last Modified: | 16 Jan 2018 00:38 | ||||
Published Version: | http://dx.doi.org/10.1007/978-3-319-44914-2_7 | ||||
Status: | Published | ||||
Publisher: | Springer International Publishing | ||||
Series Name: | Lecture Notes in Computer Science | ||||
Identification Number: | https://doi.org/10.1007/978-3-319-44914-2_7 |