{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T05:20:12Z","timestamp":1769750412668,"version":"3.49.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,6,12]],"date-time":"2012-06-12T00:00:00Z","timestamp":1339459200000},"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":[[2012,9]]},"DOI":"10.1007\/s12293-012-0084-0","type":"journal-article","created":{"date-parts":[[2012,6,11]],"date-time":"2012-06-11T07:45:15Z","timestamp":1339400715000},"page":"231-245","source":"Crossref","is-referenced-by-count":18,"title":["A memetic algorithm for job shop scheduling using a critical-path-based local search heuristic"],"prefix":"10.1007","volume":"4","author":[{"given":"Mohammad R.","family":"Raeesi N.","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziad","family":"Kobti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,6,12]]},"reference":[{"issue":"3","key":"84_CR1","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. Manag Sci 34(3): 391\u2013401","journal-title":"Manag Sci"},{"key":"84_CR2","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0360-8352(02)00019-0","volume":"42","author":"M Asano","year":"2002","unstructured":"Asano M, Ohta H (2002) A heuristic for job shop scheduling to minimize total weighted tardiness. Comput Ind Eng 42: 137\u2013147","journal-title":"Comput Ind Eng"},{"key":"84_CR3","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/j.future.2009.10.004","volume":"26","author":"A Bagheri","year":"2010","unstructured":"Bagheri A, Zandieh M, Mahdavi I, Yazdani M (2010) An artificial immune algorithm for the flexible job-shop scheduling problem. Future Gen Comput Syst 26: 533\u2013541","journal-title":"Future Gen Comput Syst"},{"key":"84_CR4","doi-asserted-by":"crossref","unstructured":"Becerra RL, Coello CA (2005) A cultural algorithm for solving the job-shop scheduling problem. In: Knowledge incorporation in evolutionary computation, studies in fuzziness and soft computing, vol 167. Springer, Berlin, pp 37\u201355","DOI":"10.1007\/978-3-540-44511-1_3"},{"key":"84_CR5","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02023073","volume":"41","author":"P Brandimarte","year":"1993","unstructured":"Brandimarte P (1993) Routing and scheduling in a flexible job shop by taboo search. Ann Oper Res 41: 157\u2013183","journal-title":"Ann Oper Res"},{"key":"84_CR6","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF02238804","volume":"45","author":"P Brucker","year":"1990","unstructured":"Brucker P, Schlie R (1990) Job-shop scheduling with multi-purpose machines. Computing 45: 369\u2013375","journal-title":"Computing"},{"issue":"7","key":"84_CR7","doi-asserted-by":"crossref","first-page":"2331","DOI":"10.1016\/j.cor.2006.11.007","volume":"35","author":"A Caumond","year":"2008","unstructured":"Caumond A, Lacomme P, Tcherneva N (2008) A memetic algorithm for the job-shop with time-lags. Comput Oper Res 35(7): 2331\u20132356","journal-title":"Comput Oper Res"},{"key":"84_CR8","doi-asserted-by":"crossref","unstructured":"Chen H, Ihlow J, Lehmann C (1999) A genetic algorithm for flexible job-shop scheduling. In: IEEE international conference on robotics and automation, Detroit, pp 1120\u20131125","DOI":"10.1109\/ROBOT.1999.772512"},{"issue":"5","key":"84_CR9","doi-asserted-by":"crossref","first-page":"5986","DOI":"10.1016\/j.eswa.2010.11.022","volume":"38","author":"T-C Chiang","year":"2011","unstructured":"Chiang T-C, Cheng H-C, Fu L-C (2011) NNMA: an effective memetic algorithm for solving multiobjective permutation flow shop scheduling problems. Exp Syst Appl 38(5): 5986\u20135999","journal-title":"Exp Syst Appl"},{"key":"84_CR10","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"},{"issue":"4","key":"84_CR11","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S1474-0346(03)00005-3","volume":"16","author":"DJ Fonseca","year":"2002","unstructured":"Fonseca DJ, Navaresse D (2002) Artificial neural networks for job shop simulation. Adv Eng Inform 16(4): 241\u2013246","journal-title":"Adv Eng Inform"},{"issue":"1","key":"84_CR12","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.cie.2007.04.010","volume":"53","author":"J Gao","year":"2007","unstructured":"Gao J, Gen M, Sun L, Zhao X (2007) A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems. Comput Ind Eng 53(1): 149\u2013162","journal-title":"Comput Ind Eng"},{"issue":"9","key":"84_CR13","doi-asserted-by":"crossref","first-page":"2892","DOI":"10.1016\/j.cor.2007.01.001","volume":"35","author":"J Gao","year":"2008","unstructured":"Gao J, Sun L, Gen M (2008) A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput Oper Res 35(9): 2892\u20132907","journal-title":"Comput Oper Res"},{"key":"84_CR14","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":"84_CR15","unstructured":"Goncalves JF, de Magalhaes Mendes JJ, Resende MGC (2002) A hybrid genetic algorithm for the job shop scheduling problem. Technical report TD-5EAL6J, AT&T Labs"},{"key":"84_CR16","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":"84_CR17","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\u2013 3811"},{"key":"84_CR18","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":"84_CR19","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s12293-008-0004-5","volume":"1","author":"SMK Hasan","year":"2008","unstructured":"Hasan SMK, Sarker R, Essam D, Cornforth D (2008) Memetic algorithms for solving job-shop scheduling problems. Memetic Comp 1: 69\u201383","journal-title":"Memetic Comp"},{"issue":"4","key":"84_CR20","doi-asserted-by":"crossref","first-page":"1030","DOI":"10.1016\/j.cor.2006.07.003","volume":"35","author":"KL Huang","year":"2008","unstructured":"Huang KL, Liao CJ (2008) Ant colony optimization combined with taboo search for the job shop scheduling problem. Comput Oper Res 35(4): 1030\u20131046","journal-title":"Comput Oper Res"},{"key":"84_CR21","doi-asserted-by":"crossref","first-page":"2093","DOI":"10.1016\/S0305-0548(03)00243-0","volume":"31","author":"WQ Huang","year":"2004","unstructured":"Huang WQ, Yin AH (2004) An improved shifting bottleneck procedure for the job shop scheduling problem. Comput Oper Res 31: 2093\u20132110","journal-title":"Comput Oper Res"},{"key":"84_CR22","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF01719451","volume":"15","author":"E Hurink","year":"1994","unstructured":"Hurink E, Jurisch B, Thole M (1994) Tabu search for the job shop scheduling problem with multi-purpose machines. Oper Res Spectrum 15: 205\u2013215","journal-title":"Oper Res Spectrum"},{"issue":"1","key":"84_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TSMCC.2002.1009117","volume":"32","author":"I Kacem","year":"2002","unstructured":"Kacem I, Hammadi S, Borne P (2002) Approach by localization and multi objective evolutionary optimization for flexible job-shop scheduling problems. IEEE Trans Syst Man Cybernet Part C 32(1): 1\u201313","journal-title":"IEEE Trans Syst Man Cybernet Part C"},{"key":"84_CR24","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0378-4754(02)00019-8","volume":"60","author":"I Kacem","year":"2002","unstructured":"Kacem I, Hammadi S, Borne P (2002) Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. J Math Comput Simul 60: 245\u2013276","journal-title":"J Math Comput Simul"},{"key":"84_CR25","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0377-2217(97)00420-7","volume":"113","author":"M Kolonko","year":"1999","unstructured":"Kolonko M (1999) Some new results on simulated annealing applied to the job-shop scheduling problem. Eur J Oper Res 113: 123\u2013136","journal-title":"Eur J Oper Res"},{"key":"84_CR26","unstructured":"Lawrence D (1985) Job shop scheduling with genetic algorithms. In: First international conference on genetic algorithms, Mahwah, New Jersey, pp 136\u2013140"},{"key":"84_CR27","unstructured":"Lawrence S (1984) Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Master\u2019s thesis, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, Pennsylvania"},{"key":"84_CR28","first-page":"60","volume":"2","author":"KM Lee","year":"1998","unstructured":"Lee KM, Yamakawa T, Lee KM (1998) A genetic algorithm for general machine scheduling problems. Int J Knowl-Based Electron 2: 60\u201366","journal-title":"Int J Knowl-Based Electron"},{"key":"84_CR29","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1016\/j.simpat.2010.01.015","volume":"18","author":"I Mahdavi","year":"2010","unstructured":"Mahdavi I, Shirazi B, Solimanpur M (2010) Development of a simulation-based decision support system for controlling stochastic flexible job shop manufacturing systems. Simul Model Pract Theory 18: 768\u2013786","journal-title":"Simul Model Pract Theory"},{"key":"84_CR30","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1016\/S0377-2217(03)00016-X","volume":"155","author":"DC Mattfeld","year":"2004","unstructured":"Mattfeld DC, Bierwirth C (2004) An efficient genetic algorithm for job shop scheduling with tardiness objectives. Eur J Oper Res 155: 616\u2013630","journal-title":"Eur J Oper Res"},{"issue":"2","key":"84_CR31","doi-asserted-by":"crossref","first-page":"1975","DOI":"10.1016\/j.asoc.2010.06.013","volume":"11","author":"M Mobini","year":"2011","unstructured":"Mobini M, Mobini Z, Rabbani M (2011) An artificial immune algorithm for the project scheduling problem under resource constraints. Appl Soft Comput 11(2): 1975\u20131982","journal-title":"Appl Soft Comput"},{"key":"84_CR32","first-page":"219","volume":"14","author":"P Moscato","year":"1999","unstructured":"Moscato P (1999) Memetic algorithms: a short introduction. New Ideas Optim 14: 219\u2013234","journal-title":"New Ideas Optim"},{"key":"84_CR33","unstructured":"Raeesi N. MR, Kobti Z (2011) A machine operation lists based memetic algorithm for job shop scheduling. In: IEEE congress on evolutionary computation (CEC), New Orleans, LA, USA, June 2011, pp 2436\u20132443"},{"issue":"5","key":"84_CR34","doi-asserted-by":"crossref","first-page":"1275","DOI":"10.1016\/j.cam.2010.08.013","volume":"235","author":"B Naderi","year":"2011","unstructured":"Naderi B, Fatemi Ghomi SMT, Aminnayeri M, Zandieh M (2011) Scheduling open shops with parallel machines to minimize total completion time. J Comput Appl Math 235(5): 1275\u20131287","journal-title":"J Comput Appl Math"},{"key":"84_CR35","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":"84_CR36","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":"84_CR37","doi-asserted-by":"crossref","unstructured":"Ong ZX, Tay JC, Kwoh CK (2005) Applying the clonal selection principle to find flexible job-shop schedules. In: LNCS, vol 3627, pp 442\u2013455","DOI":"10.1007\/11536444_34"},{"key":"84_CR38","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":"84_CR39","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0377-2217(99)00158-7","volume":"120","author":"F Pezzella","year":"2000","unstructured":"Pezzella F, Merelli E (2000) A tabu search method guided by shifting bottleneck for the job shop scheduling problem. Eur J Oper Res 120: 297\u2013310","journal-title":"Eur J Oper Res"},{"issue":"10","key":"84_CR40","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 jobshop scheduling problem. Comput Oper Res 35(10): 3202\u20133212","journal-title":"Comput Oper Res"},{"issue":"7","key":"84_CR41","first-page":"820","volume":"10","author":"CQ Wang","year":"2005","unstructured":"Wang CQ, Cao YF, Dai GZ (2005) Bi-directional convergence aco for job-shop scheduling. Comput Integr Manuf Syst 10(7): 820\u2013824","journal-title":"Comput Integr Manuf Syst"},{"key":"84_CR42","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1016\/j.cie.2004.12.008","volume":"48","author":"M Watanabe","year":"2005","unstructured":"Watanabe M, Ida K, Gen M (2005) A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem. Comput Ind Eng 48: 743\u2013752","journal-title":"Comput Ind Eng"},{"key":"84_CR43","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/j.asoc.2008.04.013","volume":"9","author":"L-N Xing","year":"2009","unstructured":"Xing L-N, Chen Y-W, Yang K-W (2009) Multi-objective flexible job shop schedule: design and evaluation by simulation modeling. Appl Soft Comput 9: 362\u2013376","journal-title":"Appl Soft Comput"},{"issue":"2","key":"84_CR44","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S1672-6529(08)60014-1","volume":"5","author":"J-H Yang","year":"2008","unstructured":"Yang J-H, Sun L, Lee HP, Qian Y, Liang Y-C (2008) Clonal selection based memetic algorithm for job shop scheduling problems. J Bionic Eng 5(2): 111\u2013119","journal-title":"J Bionic Eng"},{"issue":"4","key":"84_CR45","doi-asserted-by":"crossref","first-page":"3563","DOI":"10.1016\/j.eswa.2010.08.145","volume":"38","author":"G Zhang","year":"2011","unstructured":"Zhang G, Gao L, Shi Y (2011) An effective genetic algorithm for the flexible job-shop scheduling problem. Exp Syst Appl 38(4): 3563\u20133573","journal-title":"Exp Syst Appl"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-012-0084-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-012-0084-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-012-0084-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,29]],"date-time":"2019-06-29T14:05:32Z","timestamp":1561817132000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-012-0084-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,12]]},"references-count":45,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["84"],"URL":"https:\/\/doi.org\/10.1007\/s12293-012-0084-0","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,12]]}}}