Skip navigation

Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost

Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost

Shioura, Akiyoshi, Shakhlevich, Natalia V. and Strusevich, Vitaly A. (2018) 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 (Print), 1573-2916 (Online) (doi:https://doi.org/10.1007/s10898-018-0686-2)

[img]
Preview
PDF (Open Access Article)
28908 STRUSEVICH_Scheduling_Problems_With_Controllable_Processing_Times_And_A_Common_Deadline_(OA)_2018.pdf - Published Version
Available under License Creative Commons Attribution.

Download (526kB) | Preview

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.

Item Type: Article
Uncontrolled Keywords: scheduling, single machine, parallel machines, controllable processing times
Subjects: Q Science > QA Mathematics
Faculty / Department / Research Group: Faculty of Liberal Arts & Sciences
Faculty of Liberal Arts & Sciences > School of Computing & Mathematical Sciences (CAM)
Last Modified: 26 Nov 2020 23:01
Selected for GREAT 2016: None
Selected for GREAT 2017: None
Selected for GREAT 2018: None
Selected for GREAT 2019: None
Selected for REF2021: None
URI: http://gala.gre.ac.uk/id/eprint/28908

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics