Abstract
The majority of scheduling metaheuristics use indirect representation of solutions as a way to efficiently explore the search space. Thus, a crucial part of such metaheuristics is a “schedule generation scheme” – procedure translating the indirect solution representation into a schedule. Schedule generation scheme is used every time a new candidate solution needs to be evaluated. Being relatively slow, it eats up most of the running time of the metaheuristic and, thus, its speed plays significant role in performance of the metaheuristic. Despite its importance, little attention has been paid in the literature to efficient implementation of schedule generation schemes. We give detailed description of serial schedule generation scheme, including new improvements, and propose a new approach for speeding it up, by using Bloom filters. The results are further strengthened by automated control of parameters. Finally, we employ online algorithm selection to dynamically choose which of the two implementations to use. This hybrid approach significantly outperforms conventional implementation on a wide range of instances.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
In multi-mode extension of RCPSP, this distribution depends on selected modes and hence needs to be obtained empirically, similarly to how we obtain \(E^r\).
References
Asta, S., Karapetyan, D., Kheiri, A., Özcan, E., Parkes, A.J.: Combining Monte-Carlo and hyper-heuristic methods for the multi-mode resource-constrained multi-project scheduling problem. Inf. Sci. 373, 476–498 (2016)
Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422–426 (1970)
Broder, A., Mitzenmacher, M.: Network applications of bloom filters: a survey. Internet Math. 1(4), 485–509 (2004)
Cohen, L., Holliday, M.: Practical Statistics for Students: An Introductory Text. Paul Chapman Publishing Ltd., London (1996)
Guo, H.: Algorithm selection for sorting and probabilistic inference: a machine learning-based approach. Ph.D. thesis, Kansas State University (2003)
Kayaturan, G.C., Vernitski, A.: A way of eliminating errors when using Bloom filters for routing in computer networks. In: Fifteenth International Conference on Networks, ICN 2016, pp. 52–57 (2016)
Kim, J.-L., Ellis Jr., R.D.: Comparing schedule generation schemes in resource-constrained project scheduling using elitist genetic algorithm. J. Constr. Eng. Manag. 136(2), 160–169 (2010)
Kolisch, R.: Serial and parallel resource-constrained project scheduling methods revisited: theory and computation. Eur. J. Oper. Res. 90(2), 320–333 (1996)
Kolisch, R., Hartmann, S.: Heuristic algorithms for the resource-constrained project scheduling problem: classification and computational analysis. In: Węglarz, J. (ed.) Project Scheduling, pp. 147–178. Springer, Boston (1999). doi:10.1007/978-1-4615-5533-9_7
Kolisch, R., Hartmann, S.: Experimental investigation of heuristics for resource-constrained project scheduling: an update. Eur. J. Oper. Res. 174(1), 23–37 (2006)
Kolisch, R., Sprecher, A.: PSPLIB - a project scheduling problem library: OR software - ORSEP operations research software exchange program. Eur. J. Oper. Res. 96(1), 205–216 (1997)
Lau, J., Arnold, M., Hind, M., Calder, B.: Online performance auditing: using hot optimizations without getting burned. SIGPLAN Not. 41(6), 239–251 (2006)
Tarkoma, S., Rothenberg, C.E., Lagerspetz, E.: Theory and practice of bloom filters for distributed systems. IEEE Commun. Surv. Tutor. 14(1), 131–155 (2012)
Acknowledgements
We would like to thank Prof. Rainer Kolisch for providing us with a C++ implementation of the PSPLIB generator. It should be noted that, although the C++ implementation was developed to reproduce the original Pascal implementation, the exact equivalence cannot be guaranteed; also, in our experiments we used a modification of the provided C++ code.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Karapetyan, D., Vernitski, A. (2017). Efficient Adaptive Implementation of the Serial Schedule Generation Scheme Using Preprocessing and Bloom Filters. In: Battiti, R., Kvasov, D., Sergeyev, Y. (eds) Learning and Intelligent Optimization. LION 2017. Lecture Notes in Computer Science(), vol 10556. Springer, Cham. https://doi.org/10.1007/978-3-319-69404-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-69404-7_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-69403-0
Online ISBN: 978-3-319-69404-7
eBook Packages: Computer ScienceComputer Science (R0)