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.

中文翻译：

---

规避风险的单机调度：复杂性和近似

本文考虑一类单机调度问题。假设作业处理时间和截止日期可能不确定，并以离散场景集的形式指定。场景集中的概率分布是已知的。为了选择时间表，使用了一些风险标准，例如风险价值和条件风险价值。为基本的单机调度问题提供了各种正负复杂性结果。在本文中，展示了新的复杂度结果，并加强了一些已知的复杂度结果。