TY - GEN
T1 - Efficient heuristic optimization in single machine scheduling
AU - Braune, Roland
AU - Affenzeller, Michael
AU - Wagner, Stefan
N1 - Copyright:
Copyright 2012 Elsevier B.V., All rights reserved.
PY - 2006
Y1 - 2006
N2 - 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.
AB - 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.
KW - Genetic Algorithms
KW - Heuristic Optimization
KW - Neighborhood Search
KW - Production Scheduling
KW - Single Machine
KW - Tabu Search
UR - http://www.scopus.com/inward/record.url?scp=38449093681&partnerID=8YFLogxK
M3 - Conference contribution
SN - 8469007262
SN - 9788469007266
T3 - International Mediterranean Modelling Multiconference, I3M
SP - 499
EP - 504
BT - International Mediterranean Modelling Multiconference, IMM
T2 - International Mediterranean Modelling Multiconference, I3M 2006
Y2 - 4 October 2006 through 6 October 2006
ER -