Activity: Talk or presentation › Oral presentation
In this paper, we present a comparison of heuristic optimization algorithms for single machine scheduling problems with and without arbitrary job release times. The main focus of our analysis is the efficiency of the examined methods, i.e. how they perform under strictly limited computation time. Furthermore, we study the effects of arbitrary release times on problem difficulty and required computation time. Experimental results are presented for benchmark problem instances of reasonable size.
4 Oct 2006
International Mediterranean Modelling Multiconference: null