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

Akiyoshi Shioura, Natalia V. Shakhlevich and Vitaly A. Strusevich ()
Additional contact information
Akiyoshi Shioura: Tokyo Institute of Technology
Natalia V. Shakhlevich: University of Leeds
Vitaly A. Strusevich: University of Greenwich

Journal of Global Optimization, 2020, vol. 76, issue 3, No 3, 490 pages

Abstract: 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.

Keywords: Scheduling; Single machine; Parallel machines; Controllable processing times; 90C27; 90B35 (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10898-018-0686-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:76:y:2020:i:3:d:10.1007_s10898-018-0686-2

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-018-0686-2

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().