{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T14:05:12Z","timestamp":1769004312553,"version":"3.49.0"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319694030","type":"print"},{"value":"9783319694047","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-69404-7_9","type":"book-chapter","created":{"date-parts":[[2017,10,24]],"date-time":"2017-10-24T08:43:57Z","timestamp":1508834637000},"page":"124-138","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Adaptive Implementation of the Serial Schedule Generation Scheme Using Preprocessing and Bloom Filters"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Karapetyan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexei","family":"Vernitski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,25]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1016\/j.ins.2016.09.010","volume":"373","author":"S Asta","year":"2016","unstructured":"Asta, S., Karapetyan, D., Kheiri, A., \u00d6zcan, 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\u2013498 (2016)","journal-title":"Inf. Sci."},{"issue":"7","key":"9_CR2","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"issue":"4","key":"9_CR3","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1080\/15427951.2004.10129096","volume":"1","author":"A Broder","year":"2004","unstructured":"Broder, A., Mitzenmacher, M.: Network applications of bloom filters: a survey. Internet Math. 1(4), 485\u2013509 (2004)","journal-title":"Internet Math."},{"key":"9_CR4","doi-asserted-by":"crossref","DOI":"10.4135\/9781849209571","volume-title":"Practical Statistics for Students: An Introductory Text","author":"L Cohen","year":"1996","unstructured":"Cohen, L., Holliday, M.: Practical Statistics for Students: An Introductory Text. Paul Chapman Publishing Ltd., London (1996)"},{"key":"9_CR5","unstructured":"Guo, H.: Algorithm selection for sorting and probabilistic inference: a machine learning-based approach. Ph.D. thesis, Kansas State University (2003)"},{"key":"9_CR6","unstructured":"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\u201357 (2016)"},{"issue":"2","key":"9_CR7","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1061\/(ASCE)0733-9364(2010)136:2(160)","volume":"136","author":"J-L Kim","year":"2010","unstructured":"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\u2013169 (2010)","journal-title":"J. Constr. Eng. Manag."},{"issue":"2","key":"9_CR8","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/0377-2217(95)00357-6","volume":"90","author":"R Kolisch","year":"1996","unstructured":"Kolisch, R.: Serial and parallel resource-constrained project scheduling methods revisited: theory and computation. Eur. J. Oper. Res. 90(2), 320\u2013333 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-1-4615-5533-9_7","volume-title":"Project Scheduling","author":"R Kolisch","year":"1999","unstructured":"Kolisch, R., Hartmann, S.: Heuristic algorithms for the resource-constrained project scheduling problem: classification and computational analysis. In: W\u0119glarz, J. (ed.) Project Scheduling, pp. 147\u2013178. Springer, Boston (1999). doi:\n10.1007\/978-1-4615-5533-9_7"},{"issue":"1","key":"9_CR10","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.ejor.2005.01.065","volume":"174","author":"R Kolisch","year":"2006","unstructured":"Kolisch, R., Hartmann, S.: Experimental investigation of heuristics for resource-constrained project scheduling: an update. Eur. J. Oper. Res. 174(1), 23\u201337 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9_CR11","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"R Kolisch","year":"1997","unstructured":"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\u2013216 (1997)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"9_CR12","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1145\/1133255.1134010","volume":"41","author":"J Lau","year":"2006","unstructured":"Lau, J., Arnold, M., Hind, M., Calder, B.: Online performance auditing: using hot optimizations without getting burned. SIGPLAN Not. 41(6), 239\u2013251 (2006)","journal-title":"SIGPLAN Not."},{"issue":"1","key":"9_CR13","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1109\/SURV.2011.031611.00024","volume":"14","author":"S Tarkoma","year":"2012","unstructured":"Tarkoma, S., Rothenberg, C.E., Lagerspetz, E.: Theory and practice of bloom filters for distributed systems. IEEE Commun. Surv. Tutor. 14(1), 131\u2013155 (2012)","journal-title":"IEEE Commun. Surv. Tutor."}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-69404-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,24]],"date-time":"2017-10-24T08:47:07Z","timestamp":1508834827000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-69404-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319694030","9783319694047"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-69404-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}