{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:43:48Z","timestamp":1773326628669,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540665489","type":"print"},{"value":"9783540481591","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48159-1_25","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:27:36Z","timestamp":1184603256000},"page":"357-368","source":"Crossref","is-referenced-by-count":11,"title":["Genetic Algorithms for Solving Open Shop Scheduling Problems"],"prefix":"10.1007","author":[{"given":"Sami","family":"Khuri","sequence":"first","affiliation":[]},{"given":"Sowmya Rao","family":"Miryala","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,2,11]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1080\/02331939208843762","volume":"23","author":"H. Brasel","year":"1992","unstructured":"Brasel, H., Kleinau, M.: On the Number of Feasible Schedules of the Open Shop Problem-An Application of Special Latin Rectangles: Optimization, 23 (1992) 251\u2013260","journal-title":"Optimization"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02243845","volume":"51","author":"H. Brasel","year":"1993","unstructured":"Brasel, H., Tautenhan, T., Werner, F.: Constructive Heuristic Algorithms for the Open Shop Problem: Computing, 51 (1993) 95\u2013110","journal-title":"Computing"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0166-218X(96)00116-3","volume":"76","author":"P. Brucker","year":"1997","unstructured":"Brucker, P., Hurink, J., Jirisch, B., Wostmann, B.: Branch and Bound Algorithm for the Open Shop Problem: Discrete Applied Mathematics, 76 (1997) 43\u201359","journal-title":"Discrete Applied Mathematics"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Corcoran A., Wainwright, R.: LibGA: A User-Friendly Workbench for Order-Based Genetic Algorithm Research. Proceedings of the 1993 ACM\/SIGAPP Symposium on Applied Computing, ACM Press, (1993) 111\u2013117","DOI":"10.1145\/162754.162828"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Corno, F., Reorda, M., Squillero, G.: The Selfish Gene Algorithm: A New Evolutionary Optimization Strategy. ACM\/SAC. (1998)","DOI":"10.1145\/330560.330838"},{"key":"25_CR6","unstructured":"Dawkins, R.: The Selfish Gene. Oxford University Press (1989)"},{"key":"25_CR7","unstructured":"Fang, H., Ross, P., Corne, D.: A Promising Hybrid GA\/Heuristic Approach for Open Shop Scheduling Problems. DAI Research Paper No. 699, Proceedings of the 11th European Conference on Artificial Intelligence. John Wiley and Sons (1994) 590\u2013594"},{"key":"25_CR8","unstructured":"Fang, H., Ross, P., Corne, D.: A Promising Genetic Algorithm Approach to Job Shop Scheduling, Rescheduling and Open Shop Scheduling Problems. DAI Research Paper No. 623, Proceedings of the Fifth International Conference on Genetic Algorithms. (1993) 375\u2013382"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolutionary Programs. Springer Verlag. 3rd edition (1996)","DOI":"10.1007\/978-3-662-03315-9"},{"key":"25_CR10","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 Operations Research. 64 (1993) 278\u2013285","journal-title":"European Journal of Operations Research"},{"issue":"4","key":"25_CR11","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","volume":"23","author":"G. Teofilo","year":"1976","unstructured":"Teofilo, G., Sahni, S.: Open Shop Scheduling to Minimize Finish Time. Journal of the Association for Computing Machinery. 23(4) (1976) 665\u2013679","journal-title":"Journal of the Association for Computing Machinery"}],"container-title":["Lecture Notes in Computer Science","Progress in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48159-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T03:38:13Z","timestamp":1556681893000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48159-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665489","9783540481591"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-48159-1_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}