{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T00:56:48Z","timestamp":1648515408074},"reference-count":17,"publisher":"Informa UK Limited","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cybernetics and Systems"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1080\/01969720290040650","type":"journal-article","created":{"date-parts":[[2002,9,13]],"date-time":"2002-09-13T15:23:17Z","timestamp":1031930597000},"page":"391-400","source":"Crossref","is-referenced-by-count":6,"title":["STUDS MATING IMMIGRANTS IN EVOLUTIONARY ALGORITHM TO SOLVE THE EARLINESS-TARDINESS SCHEDULING PROBLEM"],"prefix":"10.1080","volume":"33","author":[{"given":"D.","family":"Pandolfi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Vilanova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. De San","family":"Pedro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Villagra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. H.","family":"Gallard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1287\/opre.38.1.22"},{"key":"CIT0002","unstructured":"Beasley, J. E. (1998). Common due date scheduling OR Library, http:\/\/mscmga. ms.ic.ac.uk\/jeb\/orlib"},{"key":"CIT0003","unstructured":"Biskup, D., and M. Feldmann. (1998). Benchmarks for scheduling on a singlemachine against restrictive and unrestrictive common due dates. Discussion Paper No. 397, August (1998), University of Bielefeld, Bielefeld, Germany."},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(89)90100-8"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1997.5.3.347"},{"key":"CIT0006","unstructured":"Eiben, A. E., P.E. Raue, and Zs. Ruttkay. (1994). Genetic algorithms with multiparent recombination. Proceedings of the 3rd Conference on Parallel Problem Solving from Nature. H.P. Davidor, Schwefel and R. Manner, eds., SpringerVerlag, 78-87. Number 866 in LNCS."},{"key":"CIT0007","doi-asserted-by":"crossref","unstructured":"Eiben, A. E., C. H. M. van Kemenade, and J. N. Kok. (1995). Orgy in the computer Multi-parent reproduction in genetic algorithms. Proceedings of the 3rd European Conference on Artificial Life. F. Moran, A. Moreno, J. J. Merelo and P. Chacon, eds., Springer-Verlag, 934-945. Number 929 in LNAI.","DOI":"10.1007\/3-540-59496-5_354"},{"key":"CIT0008","doi-asserted-by":"crossref","unstructured":"Esquivel, S., A. Leiva, and R. Gallard. (1997). Multiple crossover per couple in genetic algorithms. Proceedings of the Fourth IEEE Conference on Evolutionary Computation (ICEC'97). Indianapolis, Indiana, April (1997), 103-106.","DOI":"10.1109\/ICEC.1997.592277"},{"key":"CIT0009","unstructured":"Esquivel, S., A. Leiva, and R. Gallard. (1998). Couple fitness based selection with multiple crossover per couple in genetic algorithms. Proceedings of the International Symposium on Engineering of Intelligent Systems (EIS'98). E. Alpaydin, ed., La Laguna, Tenerife, Spain, Canada\/Switzerland ICSC Academic Press, 1:235-241."},{"key":"CIT0010","doi-asserted-by":"crossref","unstructured":"Esquivel, S., H. Leiva, and R. Gallard. (1999). Multiple crossovers between multiple parents to improve search in evolutionary algorithms. Proceedings of the (1999) Congress on Evolutionary Computation. Washington, DC: IEEE, 1589-1594.","DOI":"10.1109\/CEC.1999.782673"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1287\/opre.39.5.836"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1016\/0360-8352(94)00197-U"},{"key":"CIT0013","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03315-9","volume-title":"Genetic Algorithms + Data Structures= Evolutions Programs","author":"Michalewicz Z","year":"1996","edition":"3"},{"key":"CIT0014","volume-title":"Heuristic scheduling systems","author":"Morton T.","year":"1993"},{"key":"CIT0015","first-page":"183","volume":"5","author":"Radcliffe N. J.","year":"1991","journal-title":"Complex Systems"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(93)E0014-K"},{"key":"CIT0017","unstructured":"Tsujimura, Y., M. Gen, and E. Kubota. (1995). Flow shop scheduling with fuzzy processing time using genetic algorithms. The 11th Fuzzy Systems Symposium pp. 248-252. Okinawa, Japan."}],"container-title":["Cybernetics and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/01969720290040650","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,29]],"date-time":"2017-11-29T23:33:23Z","timestamp":1511998403000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/01969720290040650"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["10.1080\/01969720290040650"],"URL":"https:\/\/doi.org\/10.1080\/01969720290040650","relation":{},"ISSN":["0196-9722","1087-6553"],"issn-type":[{"value":"0196-9722","type":"print"},{"value":"1087-6553","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}