{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T04:40:22Z","timestamp":1737175222108,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434320"},{"type":"electronic","value":"9783540460046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46004-7_5","type":"book-chapter","created":{"date-parts":[[2007,7,3]],"date-time":"2007-07-03T01:43:59Z","timestamp":1183427039000},"page":"41-50","source":"Crossref","is-referenced-by-count":1,"title":["Performance of Evolutionary Approaches for Parallel Task Scheduling under Different Representations"],"prefix":"10.1007","author":[{"given":"Susana","family":"Esquivel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudia","family":"Gatica","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ra\u00fal","family":"Gallard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Graham R. L.: Bounds on Multiprocessing Anomalies and Packing Algorithms. Proceedings of the AFIPS 1972 Spring Joint Computer Conference, pp 205\u2013217, 1972.","DOI":"10.1145\/1478873.1478901"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/361604.361619","volume":"17","author":"T.L. Adam","year":"1974","unstructured":"Adam T.L., Chandy K.M., and Dickson J.R., A comparison of list schedules for parallel processing systems. Communications of the ACM, 17:685\u20139, 1974.","journal-title":"Communications of the ACM"},{"key":"5_CR3","unstructured":"Kruatrachue B., Static task scheduling and grain paccking in parallel processing systems. PhD Thesis, Oregon State University, 1987."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Zomaya A., Genetic scheduling for parallel processor systems: Comparative studies and performance issues. IEEE Trans. Parallel and Distributed Systems. Vol. 10, No. 8, 1999.","DOI":"10.1109\/71.790598"},{"key":"5_CR5","unstructured":"Kidwell M.:Using Genetic Algorithms to Schedule Tasks on a Bus-based System. Proceedings of the 5th International Conference on Genetic Algorithms, pp 368\u2013374, 1993."},{"key":"5_CR6","first-page":"17","volume":"29","author":"M. Cena","year":"1995","unstructured":"Cena M., Crespo M., Gallard R.,: Transparent Remote Execution in LAHNOS by Means of a Neural Network Device. ACM Press, Operating Systems Review, Vol. 29, Nr. 1, pp 17\u201328, 1995.","journal-title":"Transparent Remote Execution in LAHNOS by Means of a Neural Network Device"},{"key":"5_CR7","unstructured":"Ercal F.: Heuristic Approaches to Task Allocation for Parallel Computing. Doctoral Dissertation, Ohio State University, 1988."},{"key":"5_CR8","unstructured":"Flower J., Otto S., Salama M.: Optimal mapping of irregular finite element domains to parallel processors. Caltech C3P#292b, 1987."},{"issue":"12","key":"5_CR9","doi-asserted-by":"publisher","first-page":"1317","DOI":"10.1109\/71.334905","volume":"5","author":"M. Al_Mouhamed","year":"1994","unstructured":"Al_Mouhamed M. and Al_Maasarani A., Performance evaluation of scheduling precedence-constrained on message-passing systems. IEEE Trans. Parallel and Distributed Systems. 5(12):1317\u20131322, 1994.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"5_CR10","unstructured":"Bagchi S., Uckum S., Miyabe Y., Kawamura K.: Exploring Problem Specific Recombination Operators for Job Shop Scheduling. Proceedings of the 4th International Conference on Genetic Algorithms, pp 10\u201317, 1991."},{"key":"5_CR11","unstructured":"Pinedo M.,: Scheduling: Theory, Algorithms and Systems. Prentice Hall International Series in Industrial and Systems Engineering, 1995."},{"key":"5_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-45365-2_23","volume-title":"Applications of Evolutionary Computing","author":"S. Esquivel","year":"2001","unstructured":"Esquivel S., Gatica C., Gallard R.: Conventional and Multirecombinative Evolutionary Algorithms for the Parallel Task Scheduling Problem, LNCS 2037: \u201cApplications of Evolutionary Computing\u201d, pp. 223\u2013232, Springer, April 2001."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Bierwirth C., Mattfeld D., Kopfer H: On Permutation representations for Scheduling Problems, PPSN IV, Springer-Verlag. pp310\u2013318, 1996.","DOI":"10.1007\/3-540-61723-X_995"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46004-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T03:33:39Z","timestamp":1737171219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46004-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434320","9783540460046"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-46004-7_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}