Efficient heuristic optimization in single machine scheduling

In this paper, we present a comparison of heuristic optimization algorithms for single machine schedul- ing problems with and without arbitrary job release times. The main focus of our analysis is the e?- ciency of the examined methods, i.e. how they per- form under strictly limited computation time. Fur- thermore, we study the e®ects of arbitrary release times on problem di?culty and required computa- tion time. Experimental results are presented for benchmark problem instances of reasonable size.