{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:35:13Z","timestamp":1725518113583},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540875581"},{"type":"electronic","value":"9783540875598"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-87559-8_16","type":"book-chapter","created":{"date-parts":[[2008,8,28]],"date-time":"2008-08-28T16:06:31Z","timestamp":1219939591000},"page":"150-158","source":"Crossref","is-referenced-by-count":0,"title":["Distribution Stream of Tasks in Dual-Processor System"],"prefix":"10.1007","author":[{"given":"Michael","family":"Kryzhanovsky","sequence":"first","affiliation":[]},{"given":"Magomed","family":"Malsagov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Casavant, T.L., Kuhl, J.G.: A taxonomy of scheduling in general-purpose distributed computing system. IEEE Trans. on Software Engineering\u00a014(2) (1988)","DOI":"10.1109\/32.4634"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Bruno, J., Coffman, E.G., Sethi, R.: Scheduling independent tasks to reduce mean finishing time. Communications of the ACM\u00a017(7) (1974)","DOI":"10.1145\/361011.361064"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Coffman, E.G., Graham, R.L.: Optimal scheduling for two processor systems. Acta Informatica\u00a01(3) (1972)","DOI":"10.1007\/BF00288685"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Coffman, E.G., Sethi, R.: Algorithms minimizing mean flow-time. Acta Informatica\u00a06(1) (1976)","DOI":"10.1007\/BF00263740"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Horn, W.A.: Minimizing average flow time with parallel machines. Opera- Operations Research\u00a021(3) (1973)","DOI":"10.1287\/opre.21.3.846"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Kleinrock, L., Nikon, A.: On optimal scheduling algorithms for time-shared systems. Journal of the ACM\u00a028(3) (1981)","DOI":"10.1145\/322261.322266"},{"key":"16_CR7","volume-title":"Neural Networks. A Comprehensive Foundation","author":"S. Haykin","year":"1999","unstructured":"Haykin, S.: Neural Networks. A Comprehensive Foundation. Prentice Hall Inc., Englewood Cliffs (1999)"},{"key":"16_CR8","unstructured":"Kryzhanovsky, B.V., Magomedov, B.M., Mikaelian, A.L.: Relationship between Depth of Local Minimum and Probability of His Detection in Generalized Hopfield Model. Lectures of Academy of Sciences 40(3) (2005) (in Russian)"}],"container-title":["Lecture Notes in Computer Science","Artificial Neural Networks - ICANN 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87559-8_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T12:01:34Z","timestamp":1619524894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87559-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540875581","9783540875598"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87559-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}