{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:26:12Z","timestamp":1725542772445},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540259121"},{"type":"electronic","value":"9783540320654"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11427391_124","type":"book-chapter","created":{"date-parts":[[2009,12,29]],"date-time":"2009-12-29T08:05:42Z","timestamp":1262073942000},"page":"776-781","source":"Crossref","is-referenced-by-count":1,"title":["An Effective Algorithm Based on GENET Neural Network Model for Job Shop Scheduling with Release Dates and Due Dates"],"prefix":"10.1007","author":[{"given":"Xin","family":"Feng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hofung","family":"Leung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lixin","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,4,23]]},"reference":[{"key":"124_CR1","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1287\/mnsc.30.9.1093","volume":"30","author":"K.R. Baker","year":"1984","unstructured":"Baker, K.R.: Sequencing Rules and Due-Date Assignments in a Job Shop. Management Science\u00a030, 1093\u20131104 (1984)","journal-title":"Management Science"},{"key":"124_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(01)00181-3","volume":"139","author":"V. Gordon","year":"2002","unstructured":"Gordon, V., Proth, J.M., Chu, C.: A Survey of the State-of-the-art of Common Due Date Assignment and Scheduling Research. European Journal of Operational Research\u00a0139, 1\u201325 (2002)","journal-title":"European Journal of Operational Research"},{"key":"124_CR3","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1016\/S0377-2217(01)00068-6","volume":"136","author":"Z.L. Chen","year":"2002","unstructured":"Chen, Z.L., Lee, C.Y.: Parallel Machine Scheduling with a Common Due Window. European Journal of Operational Research\u00a0136, 512\u2013527 (2002)","journal-title":"European Journal of Operational Research"},{"key":"124_CR4","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1016\/S0305-0548(03)00018-2","volume":"31","author":"G. Mosheiov","year":"2004","unstructured":"Mosheiov, G., Oron, D.: A Note on the SPT Heuristic for Solving Scheduling Problems with Generalized Due Dates. Computers & Operations Research\u00a031, 645\u2013655 (2004)","journal-title":"Computers & Operations Research"},{"key":"124_CR5","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0377-2217(94)00361-0","volume":"91","author":"Z. He","year":"1996","unstructured":"He, Z., Yang, T., Tiger, A.: An Exchange Heuristic Imbedded with Simulated Annealing for Due-Dates Job-Shop Scheduling. European Journal of Operational Research\u00a091, 99\u2013117 (1996)","journal-title":"European Journal of Operational Research"},{"key":"124_CR6","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0925-5273(99)00014-6","volume":"63","author":"V.A. Armentano","year":"2000","unstructured":"Armentano, V.A., Scrich, C.R.: Tabu Search for Minimizing Total Tardiness in a Job Shop. Int. J. Production Economics\u00a063, 131\u2013140 (2000)","journal-title":"Int. J. Production Economics"},{"key":"124_CR7","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1016\/S0377-2217(03)00016-X","volume":"155","author":"D.C. Mattfeld","year":"2004","unstructured":"Mattfeld, D.C., Bierwirth, C.: An Efficient Genetic Algorithm for Job Shop Scheduling with Tardiness Objectives. European Journal of Operational Research\u00a0155, 616\u2013630 (2004)","journal-title":"European Journal of Operational Research"},{"key":"124_CR8","unstructured":"Davenport, A., Tsang, E., Wang, C.J., Zhu, K.: Genet: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement. In: Proc. 12th National Conference on Artificial Intelligence, pp. 325\u2013330 (1994)"},{"key":"124_CR9","doi-asserted-by":"crossref","unstructured":"Lam, B.C.H., Leung, H.F.: Progressive Stochastic Search for Solving Constraint Satisfaction Problems. In: Proc. 15th IEEE International Conference on Tools with Artificial Intelligence, pp. 487\u2013491 (2003)","DOI":"10.1109\/TAI.2003.1250229"},{"key":"124_CR10","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1287\/opre.49.6.854.10014","volume":"49","author":"N.G. Hall","year":"2001","unstructured":"Hall, N.G., Posner, M.E.: Generation Experimental Data For Computational Testing with Machine Scheduling Applications. Operations Research\u00a049, 854\u2013865 (2001)","journal-title":"Operations Research"},{"key":"124_CR11","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E. Taillard","year":"1993","unstructured":"Taillard, E.: Benchmarks for Basic Scheduling Problems. European Journal of Operational Research\u00a064, 278\u2013285 (1993)","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Advances in Neural Networks \u2014 ISNN 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11427391_124.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:07:07Z","timestamp":1619507227000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11427391_124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540259121","9783540320654"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11427391_124","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2005]]}}}