{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T20:44:55Z","timestamp":1775594695057,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,12,12]],"date-time":"2008-12-12T00:00:00Z","timestamp":1229040000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2009,3]]},"DOI":"10.1007\/s12293-008-0004-5","type":"journal-article","created":{"date-parts":[[2008,12,11]],"date-time":"2008-12-11T09:00:15Z","timestamp":1228986015000},"page":"69-83","source":"Crossref","is-referenced-by-count":120,"title":["Memetic algorithms for solving job-shop scheduling problems"],"prefix":"10.1007","volume":"1","author":[{"given":"S. M. Kamrul","family":"Hasan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruhul","family":"Sarker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daryl","family":"Essam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Cornforth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,12,12]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1287\/ijoc.6.2.118","volume":"6","author":"EHL Aarts","year":"1994","unstructured":"Aarts EHL, Van Laarhoven PJM, Lenstra JK, Ulder NLJ (1994) A computational study of local search algorithms for job shop scheduling. ORSA J Comput 6: 118\u2013125","journal-title":"ORSA J Comput"},{"key":"4_CR2","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J Adams","year":"1988","unstructured":"Adams J, Balas E, Zawack D (1988) The shifting bottleneck procedure for job shop scheduling. Manage Sci 34: 391\u2013401","journal-title":"Manage Sci"},{"key":"4_CR3","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0360-8352(90)90082-W","volume":"19","author":"JE Biegel","year":"1990","unstructured":"Biegel JE, Davern JJ (1990) Genetic algorithms and job shop scheduling. Comput Ind Eng 19: 81\u201391","journal-title":"Comput Ind Eng"},{"key":"4_CR4","first-page":"58","volume-title":"A GRASP for job shop scheduling. Essays and surveys on metaheuristics","author":"S Binato","year":"2001","unstructured":"Binato S, Hery WJ, Loewenstern DM, Resende MGC (2001) A GRASP for job shop scheduling. Essays and surveys on metaheuristics. Kluwer Academic Publishers, Boston, MA, pp 58\u201379"},{"key":"4_CR5","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0305-0548(93)E0015-L","volume":"22","author":"FD Croce","year":"1995","unstructured":"Croce FD, Tadei R, Volta G (1995) A genetic algorithm for the job shop problem. Comput Oper Res 22: 15\u201324","journal-title":"Comput Oper Res"},{"key":"4_CR6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0305-0548(93)E0016-M","volume":"22","author":"U Dorndorf","year":"1995","unstructured":"Dorndorf U, Pesch E (1995) Evolution based learning in a job shop scheduling environment. Comput Oper Res 22: 25\u201340","journal-title":"Comput Oper Res"},{"key":"4_CR7","volume-title":"Computers and intractability : a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability : a guide to the theory of NP-completeness. W. H. Freeman, San Francisco"},{"key":"4_CR8","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1: 117\u2013129","journal-title":"Math Oper Res"},{"key":"4_CR9","volume-title":"Genetic algorithms in search, optimization, and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley Pub. Co., Reading, MA"},{"key":"4_CR10","unstructured":"Hasan SMK, Sarker R, Cornforth D (2008) GA with priority rules for solving job-shop scheduling problems. In: IEEE world congress on computational intelligence, Hong Kong, pp 1913\u20131920"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Hasan SMK, Sarker R, Cornforth D (2007) Hybrid genetic algorithm for solving job-shop scheduling problem. In: 6th IEEE\/ACIS international conference on computer and information science, Melbourne, pp 519\u2013524","DOI":"10.1109\/ICIS.2007.107"},{"key":"4_CR12","unstructured":"Hasan SMK, Sarker R, Cornforth D (2007) Modified genetic algorithm for job-shop scheduling: a gap-utilization technique. In: IEEE congress on evolutionary computation, Singapore, pp 3804\u20133811"},{"key":"4_CR13","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1109\/5326.704576","volume":"28","author":"H Ishibuchi","year":"1998","unstructured":"Ishibuchi H, Murata T (1998) A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Trans Syst Man Cybernet Part C 28: 392\u2013403","journal-title":"IEEE Trans Syst Man Cybernet Part C"},{"key":"4_CR14","unstructured":"Lawrence D (1985) Job shop scheduling with genetic algorithms. In: First international conference on genetic algorithms, Mahwah, New Jersey, pp 136\u2013140"},{"key":"4_CR15","unstructured":"Lawrence S (1984) Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, Pennsylvania"},{"key":"4_CR16","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0167-5060(08)70821-5","volume":"4","author":"JK Lenstra","year":"1979","unstructured":"Lenstra JK, Rinnooy Kan AHG (1979) Computational complexity of discrete optimization problems. Ann Discrete Math 4: 121\u2013140","journal-title":"Ann Discrete Math"},{"key":"4_CR17","unstructured":"Nakano R, Yamada T (1991) Conventional genetic algorithm for job shop problems. In: Fourth international conference on genetic algorithms, Morgan Kaufmann, San Mateo, CA, pp 474\u2013479"},{"key":"4_CR18","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1023\/B:APIN.0000027769.48098.91","volume":"21","author":"BM Ombuki","year":"2004","unstructured":"Ombuki BM, Ventresca M (2004) Local search genetic algorithms for the job shop scheduling problem. Appl Intell 21: 99\u2013109","journal-title":"Appl Intell"},{"key":"4_CR19","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1109\/TEVC.2003.819944","volume":"8","author":"YS Ong","year":"2004","unstructured":"Ong YS, Keane AJ (2004) Meta-Lamarckian learning in memetic algorithms. IEEE Trans Evol Comput 8: 99\u2013110","journal-title":"IEEE Trans Evol Comput"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Paredis J (1997) Exploiting constraints as background knowledge for evolutionary algorithms. Handbook of evolutionary computation. Institute of Physics Publishing and Oxford University Press, Bristol, New York, G1.2:1\u20136","DOI":"10.1887\/0750308958\/b386c88"},{"key":"4_CR21","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/S0360-8352(03)00077-9","volume":"45","author":"BJ Park","year":"2003","unstructured":"Park BJ, Choi HR, Kim HS (2003) A hybrid genetic algorithm for the job shop scheduling problems. Comput Ind Eng 45: 597\u2013613","journal-title":"Comput Ind Eng"},{"key":"4_CR22","doi-asserted-by":"crossref","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","volume":"35","author":"F Pezzella","year":"2008","unstructured":"Pezzella F, Morganti G, Ciaschetti G (2008) A genetic algorithm for the flexible job-shop scheduling problem. Comput Oper Res 35: 3202\u20133212","journal-title":"Comput Oper Res"},{"key":"4_CR23","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1080\/095372801750397680","volume":"12","author":"SG Ponnambalam","year":"2001","unstructured":"Ponnambalam SG, Aravindan P, Rao PS (2001) Comparative evaluation of genetic algorithms for job-shop scheduling. Prod Plan Control 12: 560\u2013674","journal-title":"Prod Plan Control"},{"key":"4_CR24","unstructured":"Shigenob K, Isao O, Masayuki Y (1995) An efficient genetic algorithm for job shop scheduling problems. In: 6th International conference on genetic algorithms, Pittsburgh, PA, pp 506\u2013511"},{"key":"4_CR25","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1243\/0954405001517685","volume":"214","author":"W Wang","year":"2000","unstructured":"Wang W, Brunn P (2000) An effective genetic algorithm for job shop scheduling. Proc Inst Mech Eng Part B: J Eng Manuf 214: 293\u2013300","journal-title":"Proc Inst Mech Eng Part B: J Eng Manuf"},{"key":"4_CR26","volume-title":"Studies on metaheuristics for jobshop and flowshop scheduling problems. Doctor of Informatics, Department of Applied Mathematics and Physics","author":"T Yamada","year":"2003","unstructured":"Yamada T (2003) Studies on metaheuristics for jobshop and flowshop scheduling problems. Doctor of Informatics, Department of Applied Mathematics and Physics. Kyoto University, Kyoto, Japan"},{"key":"4_CR27","first-page":"67","volume-title":"Genetic algorithms for job-shop scheduling problems. Modern Heuristic for Decision Support","author":"T Yamada","year":"1997","unstructured":"Yamada T, Nakano R (1997) Genetic algorithms for job-shop scheduling problems. Modern Heuristic for Decision Support. UNICOM seminar, London, pp 67\u201381"},{"key":"4_CR28","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1049\/PBCE055E_ch7","volume-title":"Job-shop scheduling. Genetic algorithms in engineering systems","author":"T Yamada","year":"1997","unstructured":"Yamada T, Nakano R (1997) Job-shop scheduling. Genetic algorithms in engineering systems. Cambridge University Press, New York, pp 134\u2013160"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-008-0004-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-008-0004-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-008-0004-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T03:45:52Z","timestamp":1559447152000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-008-0004-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12,12]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["4"],"URL":"https:\/\/doi.org\/10.1007\/s12293-008-0004-5","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12,12]]}}}