Risk-averse single machine scheduling: complexity and approximation

Adam Kasperski and Paweł Zieliński ()
Additional contact information
Paweł Zieliński: Wrocław University of Science and Technology

Journal of Scheduling, 2019, vol. 22, issue 5, No 4, 567-580

Abstract: Abstract In this paper, a class of single machine scheduling problems is considered. It is assumed that job processing times and due dates can be uncertain and they are specified in the form of discrete scenario set. A probability distribution in the scenario set is known. In order to choose a schedule, some risk criteria such as the value at risk and conditional value at risk are used. Various positive and negative complexity results are provided for basic single machine scheduling problems. In this paper, new complexity results are shown and some known complexity results are strengthened.

Keywords: Single machine; Value at risk; Conditional value at risk; Computational complexity; Approximation algorithms; Robust scheduling (search for similar items in EconPapers)
Date: 2019
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/s10951-019-00599-6 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:jsched:v:22:y:2019:i:5:d:10.1007_s10951-019-00599-6

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-019-00599-6

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

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