Shioura, A, Shakhlevich, N and Strusevich, VA (2018) Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches. European Journal of Operational Research, 266 (3). pp. 795-818. ISSN 0377-2217
Abstract
This paper provides a review of recent results on scheduling with controllable processing times. The stress is on the methodological aspects that include parametric flow techniques and methods for solving mathematical programming problems with submodular constraints. We show that the use of these methodologies yields fast algorithms for solving problems on single machine or parallel machines, with either one or several objective functions. For a wide range of problems with controllable processing times we report algorithms with the running times which match those known for the corresponding problems with fixed processing times. As a by-product, we present the best possible algorithms for a number of problems on parallel machines that are traditionally studied within the body of research on scheduling with imprecise computation.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | (c) 2017 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY license. (http://creativecommons.org/licenses/by/4.0/) |
Keywords: | Scheduling with controllable processing times; Scheduling with imprecise computation; Flows in networks; Optimization with submodular constraints |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 25 Aug 2017 13:32 |
Last Modified: | 23 Jun 2023 22:34 |
Status: | Published |
Publisher: | Elsevier |
Identification Number: | 10.1016/j.ejor.2017.08.034 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:120591 |