{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T02:50:20Z","timestamp":1649213420913},"reference-count":12,"publisher":"Informa UK Limited","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[2000,1]]},"DOI":"10.1080\/00207160008804963","type":"journal-article","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T20:24:30Z","timestamp":1182803070000},"page":"21-40","source":"Crossref","is-referenced-by-count":0,"title":["Solving multiple processor and multiple resource constrained scheduling problems using a genetic algorithm approach"],"prefix":"10.1080","volume":"75","author":[{"given":"S. A.","family":"Hussain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. P.","family":"Chakrabarti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. U. K.","family":"Sastry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00149-X"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1995.1003"},{"key":"CIT0003","volume":"23","author":"Clyde W. H.","year":"1993","journal-title":"IEEE transaction on systems, man and cybernetics"},{"key":"CIT0004","doi-asserted-by":"crossref","unstructured":"Coffman, E. G. Jr., Garey, M. R. and Johnson, D. S. 1984. \u201cApproximation Algorithms for Bin-Packing: An updated survey\u201d. New Jersey: Bell laboratories, Murray Hill. 07971","DOI":"10.1007\/978-3-7091-4338-4_3"},{"key":"CIT0005","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/0377-2217(93)E0228-P","volume":"80","author":"Chuen-Leung C.","journal-title":"European Journal of Operational Research"},{"key":"CIT0006","volume-title":"Computers and Interactibility: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979"},{"key":"CIT0007","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1137\/0204035","volume":"4","author":"Garey M. R.","journal-title":"SIAM J. Computing"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(76)90001-7"},{"key":"CIT0009","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"Goldberg D. E.","year":"1989"},{"key":"CIT0010","volume":"60","author":"Hussain S. A.","year":"1997","journal-title":"International Journal of Computer Mathematics"},{"key":"CIT0011","unstructured":"Holland, J. H. 1975. \u201cAdaption in Natural and Artificial Systems\u201d. Ann Arbor, MI: The University of Michigan Press."},{"key":"CIT0012","first-page":"17","volume-title":"Lecture notes on Computer Science, Parallel Processing","volume":"24","author":"Yao C.-C.","year":"1975"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207160008804963","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T15:53:23Z","timestamp":1556553203000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/00207160008804963"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["10.1080\/00207160008804963"],"URL":"https:\/\/doi.org\/10.1080\/00207160008804963","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}