Page - XII - in Algorithms for Scheduling Problems

better than anoptimistic one, and leads to the best optimization criteria trade-offs. Thepessimistic heterogeneousearliestfinishtime(PHEFT)schedulingalgorithmperformswell indifferentscenarios with a variety ofworkloads and cluster configurations. The developedPHEFT strategy also has a lower timecomplexity in comparisonwithearlierversions, knownasHEFT (heterogeneousearliest finish timefirst). The editors of this bookwould like to thank the authors for submitting their high-qualityworks, the reviewers for their timely constructive comments, and the editorial staff of theMDPI AG for their assistance in promptlymanaging the reviewprocess and for their continuous support in the preparationof this bookwhenever needed. Wehope that the readerwill find stimulating ideas for developingnewapproaches andalgorithms fordifferent types of schedulingproblems. Due to the large interest in this subject, we plan to prepare a Volume 2 of the Special Issue ”Algorithms for SchedulingProblems”. Thesubmissiondeadline (inautumn2019)willbeannouncedonthewebsite of the journalAlgorithms later in thisyear. Frank Werner, Larysa Burtseva, Yuri Sotskov Special Issue Editors xii