{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T10:03:23Z","timestamp":1766311403762},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642340963"},{"type":"electronic","value":"9783642340970"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-34097-0_4","type":"book-chapter","created":{"date-parts":[[2012,12,13]],"date-time":"2012-12-13T06:26:36Z","timestamp":1355379996000},"page":"77-102","source":"Crossref","is-referenced-by-count":6,"title":["Structure vs. Efficiency of the Cross-Entropy Based Population Learning Algorithm for Discrete-Continuous Scheduling with Continuous Resource Discretisation"],"prefix":"10.1007","author":[{"given":"Piotr","family":"J\u0119drzejowicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksander","family":"Skakovski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10479-005-5724-z","volume":"134","author":"P.-T. Boer De","year":"2005","unstructured":"De Boer, P.-T., Kroese, D.P., Mannor, S., Rubinstein, R.Y.: A Tutorial on the Cross-Entropy Method. Annals of Operations Research\u00a0134(1), 19\u201367 (2005)","journal-title":"Annals of Operations Research"},{"key":"4_CR2","unstructured":"Czarnowski, I., Gutjahr, W.J., J\u0119drzejowicz, P., Ratajczak, E., Skakovski, A., Wierzbowska, I.: Scheduling Multiprocessor Tasks in Presence of Correlated Failures. Central European Journal of Operations Research\u00a011(2), 163\u2013182 (2003); Lupta\u0107ik, M., Wildburger, U.L. (eds.) Physika-Verlag, A Springer-Verlag Company, Heidelberg"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-540-45224-9_40","volume-title":"Knowledge-Based Intelligent Information and Engineering Systems","author":"J. J\u0119drzejowicz","year":"2003","unstructured":"J\u0119drzejowicz, J., J\u0119drzejowicz, P.: Population\u2013Based Approach to Multiprocessor Task Scheduling in Multistage Hybrid Flowshops. In: Palade, V., Howlett, R.J., Jain, L. (eds.) KES 2003. LNCS (LNAI), vol.\u00a02773, pp. 279\u2013286. Springer, Heidelberg (2003)"},{"issue":"3","key":"4_CR4","first-page":"159","volume":"28","author":"J. J\u0119drzejowicz","year":"2003","unstructured":"J\u0119drzejowicz, J., J\u0119drzejowicz, P.: PLA\u2013Based Permutation Scheduling. Foundations of Computing and Decision Sciences\u00a028(3), 159\u2013177 (2003)","journal-title":"Foundations of Computing and Decision Sciences"},{"key":"4_CR5","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/11504894_33","volume-title":"Innovations in Applied Artificial Intelligence","author":"J. J\\kedrzejowicz","year":"2005","unstructured":"J\u0119drzejowicz, J., J\u0119drzejowicz, P.: New Upper Bounds for the Permutation Flowshop Scheduling Problem. In: Ali, M., Esposito, F. (eds.) IEA\/AIE 2005. LNCS (LNAI), vol.\u00a03533, pp. 232\u2013235. Springer, Heidelberg (2005)"},{"key":"4_CR6","first-page":"51","volume":"24","author":"P. J\u0119drzejowicz","year":"1999","unstructured":"J\u0119drzejowicz, P.: Social Learning Algorithm as a Tool for Solving Some Difficult Scheduling Problems. Foundation of Computing and Decision Sciences\u00a024, 51\u201366 (1999)","journal-title":"Foundation of Computing and Decision Sciences"},{"key":"4_CR7","first-page":"1153","volume-title":"6th International Conference on Intelligent Systems Design and Applications, ISDA 2006 Special session: Nature Imitation Methods Theory and Practice (NIM 2006)","author":"P. J\u0119drzejowicz","year":"2006","unstructured":"J\u0119drzejowicz, P., Skakovski, A.: A Population Learning Algorithm for Discrete-Continuous Scheduling with Continuous Resource Discretisation. In: Chen, Y., Abraham, A. (eds.) 6th International Conference on Intelligent Systems Design and Applications, ISDA 2006 Special session: Nature Imitation Methods Theory and Practice (NIM 2006), October 16-18, vol.\u00a0II, pp. 1153\u20131158. IEEE Computer Society, Jinan (2006)"},{"key":"4_CR8","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-540-85563-7_16","volume-title":"Knowledge-Based Intelligent Information and Engineering Systems","author":"P. J\u0119drzejowicz","year":"2008","unstructured":"J\u0119drzejowicz, P., Skakovski, A.: A Cross-Entropy Based Population Learning Algorithm for Discrete-Continuous Scheduling with Continuous Resource Discretisation. In: Lovrek, I., Howlett, R.J., Jain, L.C. (eds.) KES 2008, Part I. LNCS (LNAI), vol.\u00a05177, pp. 82\u201389. Springer, Heidelberg (2008)"},{"issue":"2","key":"4_CR9","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/S0377-2217(97)00346-9","volume":"107","author":"J. J\u00f3zefowska","year":"1998","unstructured":"J\u00f3zefowska, J., W\u0119glarz, J.: On a methodology for discrete-continuous scheduling. European J. Oper. Res.\u00a0107(2), 338\u2013353 (1998)","journal-title":"European J. Oper. Res."},{"key":"4_CR10","unstructured":"J\u00f3zefowska, J., Mika, M., R\u00f3\u017cycki, R., Walig\u00f3ra, G., W\u0119glarz, J.: Solving discrete-continuous scheduling problems by Tabu Search. In: 4th Metaheuristics International Conference MIC 2001, Porto, Portugal, July 16-20, pp. 667\u2013671 (2001)"},{"issue":"2","key":"4_CR11","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1016\/S0377-2217(97)00345-7","volume":"107","author":"J. J\u00f3zefowska","year":"1998","unstructured":"J\u00f3zefowska, J., R\u00f3\u017cycki, R., Walig\u00f3ra, G., W\u0119glarz, J.: Local search metaheuristics for some discrete-continuous scheduling problems. European J. Oper. Res.\u00a0107(2), 354\u2013370 (1998)","journal-title":"European J. Oper. Res."},{"key":"4_CR12","unstructured":"R\u00f3\u017cycki, R.: Zastosowanie algorytmu genetycznego do rozwi\u0105zywania dyskretno-ci\u0105g\u0142ych problem\u00f3w szeregowania. PhD dissertation, Istitute of Computing Science, Pozna\u0144 University of Technology, Piotrowo 3A, 60-965, Pozna\u0144, Poland (2000)"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0377-2217(96)00385-2","volume":"99","author":"R.Y. Rubinstein","year":"1997","unstructured":"Rubinstein, R.Y.: Optimization of computer simulation models with rare events. European Journal of Operations Research\u00a099, 89\u2013112 (1997)","journal-title":"European Journal of Operations Research"}],"container-title":["Studies in Computational Intelligence","Agent-Based Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34097-0_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:44:27Z","timestamp":1620132267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34097-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642340963","9783642340970"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34097-0_4","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2013]]}}}