|
|
Digital Library of the
European Council for Modelling and Simulation |
|
Title: |
Perturbation In Local Search For Scheduling |
|
Authors: |
Frank Herrmann |
|
Published in:
|
(2015).ECMS 2015 Proceedings edited
by: Valeri M. Mladenov, Grisha Spasov, Petia Georgieva, Galidiya Petrova, European
Council for Modeling and Simulation. doi:10.7148/2015 ISBN:
978-0-9932440-0-1 29th
European Conference on Modelling and Simulation, Albena (Varna), Bulgaria,
May 26th – 29th,
2015 |
|
Citation
format: |
Frank
Herrmann (2015).
Perturbation In Local Search For
Scheduling, ECMS 2015 Proceedings edited by: Valeri
M. Mladenov, Petia Georgieva, Grisha Spasov, Galidiya Petrova
European Council for Modeling and Simulation. doi:10.7148/2015-0446 |
|
DOI: |
http://dx.doi.org/10.7148/2015-0446 |
|
Abstract: |
Local search is an established meta
heuristic for scheduling problems. To avoid of getting stucked
in a local optimum, the achieved solution is destroyed. Usually, this is done
randomly. Here, two problem specific procedures are suggested. One focuses on
jobs with the highest difference between the actual processing time and the
net processing time of the job and the other one tries to remove jobs which
causes the highest idle time for themselves or other jobs. Comprehensive
simulations of test scheduling problems as well as a real world application show
that both problem specific procedures outperform a random procedure. |
|
Full
text: |
|
