Shioura, A, Shakhlevich, NV and Strusevich, VA (2020) Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost. Journal of Global Optimization, 76 (3). pp. 471-490. ISSN 0925-5001
Abstract
We consider a range of scheduling problems with controllable processing times, in which the jobs must be completed by a common deadline by compressing appropriately their processing times. The objective is to minimize the maximum compression cost. We present a number of algorithms based on common general principles adapted with a purpose of reducing the resulting running times.
Metadata
Authors/Creators: |
|
||||
---|---|---|---|---|---|
Copyright, Publisher and Additional Information: | © 2018, The Author(s). This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. | ||||
Keywords: | Scheduling; Single machine; Parallel machines; Controllable processing times | ||||
Dates: |
|
||||
Institution: | The University of Leeds | ||||
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) | ||||
Funding Information: |
|
||||
Depositing User: | Symplectic Publications | ||||
Date Deposited: | 29 Jun 2018 10:49 | ||||
Last Modified: | 25 Jun 2023 21:25 | ||||
Status: | Published | ||||
Publisher: | Springer Verlag | ||||
Identification Number: | https://doi.org/10.1007/s10898-018-0686-2 |
Download
Filename: final vor Shioura2020_Article_SchedulingProblemsWithControll.pdf
Licence: CC-BY 4.0