This is the latest version of this eprint.
Shioura, A, Shakhlevich, NV and Strusevich, VA (2013) A submodular optimization approach to bicriteria scheduling problems with controllable processing times on parallel machines. SIAM Journal on Discrete Mathematics, 27 (1). 186 - 204 (19). ISSN 0895-4801
Abstract
In this paper, we present a general methodology for designing polynomial-time algorithms for bicriteria scheduling problems on parallel machines with controllable processing times. For each considered problem, the two criteria are the makespan and the total compression cost, and the solution is delivered in the form of the break points of the efficient frontier. We reformulate the scheduling problems in terms of optimization over submodular polyhedra and give efficient procedures for computing the corresponding rank functions. As a result, for two of the considered problems we obtain the first polynomial-time algorithms, while for the third problem we considerably improve the known running time.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2013, Society for industrial and applied mathematics. Reproduced 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) |
Depositing User: | Symplectic Publications |
Date Deposited: | 20 Mar 2014 12:02 |
Last Modified: | 15 Sep 2014 01:42 |
Published Version: | http://dx.doi.org/10.1137/110843836 |
Status: | Published |
Publisher: | Society for industrial and applied mathematics |
Refereed: | Yes |
Identification Number: | 10.1137/110843836 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:78189 |
Available Versions of this Item
-
A submodular optimization approach to bicriteria scheduling problems with controllable processing times on parallel machines. (deposited 24 Jun 2013 09:01)
- A submodular optimization approach to bicriteria scheduling problems with controllable processing times on parallel machines. (deposited 20 Mar 2014 12:02) [Currently Displayed]