{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T18:37:28Z","timestamp":1778783848438,"version":"3.51.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,8,12]],"date-time":"2012-08-12T00:00:00Z","timestamp":1344729600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s00521-012-1119-7","type":"journal-article","created":{"date-parts":[[2012,8,11]],"date-time":"2012-08-11T02:26:14Z","timestamp":1344651974000},"page":"1631-1641","source":"Crossref","is-referenced-by-count":27,"title":["Process plan and part routing optimization in a dynamic flexible job shop scheduling environment: an optimization via simulation approach"],"prefix":"10.1007","volume":"23","author":[{"given":"Faruk","family":"Geyik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ay\u015fe Tu\u011fba","family":"Dosdo\u011fru","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,8,12]]},"reference":[{"issue":"19","key":"1119_CR1","doi-asserted-by":"crossref","first-page":"5671","DOI":"10.1080\/00207540903055743","volume":"48","author":"M Amiri","year":"2010","unstructured":"Amiri M, Zandieh M, Yazdani M, Bagheri A (2010) A variable neighbourhood search algorithm for the flexible job shop scheduling problem. Int J Prod Res 48(19):5671\u20135689","journal-title":"Int J Prod Res"},{"key":"1119_CR2","volume-title":"Discrete event systems simulation","author":"J Banks","year":"2000","unstructured":"Banks J, Carson JS, Nelson BL, Nicol DM (2000) Discrete event systems simulation, 3rd edn. Prentice Hall, Englewood Cliffs, NJ","edition":"3"},{"key":"1119_CR3","volume-title":"Introduction the theory of scheduling","author":"KR Baker","year":"1974","unstructured":"Baker KR (1974) Introduction the theory of scheduling. Wiley, New York"},{"issue":"17","key":"1119_CR4","doi-asserted-by":"crossref","first-page":"4523","DOI":"10.1080\/00207540210147043","volume":"40","author":"A Baykasoglu","year":"2002","unstructured":"Baykasoglu A (2002) Linguistic-based meta-heuristic optimization model for flexible job shop scheduling. Int J Prod Res 40(17):4523\u20134543","journal-title":"Int J Prod Res"},{"issue":"2","key":"1119_CR5","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1108\/17410380810847909","volume":"19","author":"A Baykasoglu","year":"2008","unstructured":"Baykasoglu A, Ozbakir L (2008) Analysing the effect of flexiblity on manufacturing systems performance. J Manuf Technol Manag 19(2):172\u2013193","journal-title":"J Manuf Technol Manag"},{"key":"1119_CR6","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.ejor.2007.02.020","volume":"187","author":"A Baykasoglu","year":"2008","unstructured":"Baykasoglu A, G\u00f6\u00e7ken M, Unutmaz ZD (2008) New approaches to due date assignment in job shops. Eur J Oper Res 187:31\u201345","journal-title":"Eur J Oper Res"},{"key":"1119_CR7","doi-asserted-by":"crossref","unstructured":"Chen H, Ihlow J, Lehmann C (1999) A genetic algorithm for flexible job-shop scheduling. In: Proceedings of the 1999 IEEE international conference on robotics and automation, vol 2, pp 1120\u20131125. Detroit, Michigan","DOI":"10.1109\/ROBOT.1999.772512"},{"key":"1119_CR8","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0360-8352(99)00136-9","volume":"36","author":"R Cheng","year":"1999","unstructured":"Cheng R, Gen M, Tsujimura Y (1999) A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies. Comput Ind Eng 36:343\u2013364","journal-title":"Comput Ind Eng"},{"issue":"3","key":"1119_CR9","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/ijoc.14.3.192.113","volume":"14","author":"MC Fu","year":"2002","unstructured":"Fu MC (2002) Optimization for simulation: theory versus practice. INFORMS J Comput 14(3):192\u2013215","journal-title":"INFORMS J Comput"},{"key":"1119_CR10","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:149\u2013162","journal-title":"Comput Ind Eng"},{"key":"1119_CR11","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:2892\u20132907","journal-title":"Comput Oper Res"},{"key":"1119_CR12","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 flow shop and job shop scheduling. Math Oper Res 1:117\u2013129","journal-title":"Math Oper Res"},{"issue":"20","key":"1119_CR13","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1023\/B:JIMS.0000034106.86434.46","volume":"15","author":"F Geyik","year":"2004","unstructured":"Geyik F, Cedimo\u011flu IH (2004) The strategies and parameters of Tabu Search technique for job-shop scheduling. J Intell Manuf 15(20):439\u2013448","journal-title":"J Intell Manuf"},{"key":"1119_CR14","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/j.knosys.2010.07.010","volume":"24","author":"C Guti\u00e9rrez","year":"2011","unstructured":"Guti\u00e9rrez C, Garc\u00eda-Magari\u00f1o I (2011) Modular design of a hybrid genetic algorithm for a flexible job: shop scheduling problem. Knowl-Based Syst 24:102\u2013112","journal-title":"Knowl-Based Syst"},{"issue":"12","key":"1119_CR15","doi-asserted-by":"crossref","first-page":"3585","DOI":"10.1080\/00207543.2010.481293","volume":"49","author":"Z Jia","year":"2011","unstructured":"Jia Z, Lu X, Yang J, Jia D (2011) Research on job shop scheduling problem based on genetic algorithm. Int J Prod Res 49(12):3585\u20133604","journal-title":"Int J Prod Res"},{"issue":"1","key":"1119_CR16","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 (2002) Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Transact Syst Man Cybernet 32(1):1\u201313","journal-title":"IEEE Transact Syst Man Cybernet"},{"key":"1119_CR17","doi-asserted-by":"crossref","first-page":"1151","DOI":"10.1016\/S0305-0548(02)00063-1","volume":"30","author":"YK Kim","year":"2003","unstructured":"Kim YK, Park K, Ko J (2003) A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling. Comput Oper Res 30:1151\u20131171","journal-title":"Comput Oper Res"},{"key":"1119_CR18","volume-title":"Simulation modeling and analysis","author":"AM Law","year":"2000","unstructured":"Law AM, Kelton WD (2000) Simulation modeling and analysis, 3rd edn. McGraw-Hill, New York","edition":"3"},{"key":"1119_CR19","doi-asserted-by":"crossref","first-page":"174","DOI":"10.15837\/ijccc.2007.2.2350","volume":"2","author":"N Liouane","year":"2007","unstructured":"Liouane N, Saad I, Hammadi S, Borne P (2007) Ant systems and local search optimization for flexible job shop scheduling production. Int J Comput Commun Control 2:174\u2013184","journal-title":"Int J Comput Commun Control"},{"issue":"21","key":"1119_CR20","doi-asserted-by":"crossref","first-page":"4551","DOI":"10.1080\/00207540500534405","volume":"44","author":"I Moon","year":"2006","unstructured":"Moon I, Cha BC, Bae HC (2006) Hybrid genetic algorithm for group technology economic lot scheduling problem. Int J Prod Res 44(21):4551\u20134568","journal-title":"Int J Prod Res"},{"issue":"10","key":"1119_CR21","doi-asserted-by":"crossref","first-page":"2695","DOI":"10.1080\/00207540701244820","volume":"46","author":"I Moon","year":"2008","unstructured":"Moon I, Lee S, Bae H (2008) Genetic Algorithms for job shop scheduling problems with alternative routings. Int J Product Res 46(10):2695\u20132705","journal-title":"Int J Product Res"},{"key":"1119_CR22","doi-asserted-by":"crossref","first-page":"10770","DOI":"10.1016\/j.eswa.2011.01.129","volume":"38","author":"F Musharavati","year":"2011","unstructured":"Musharavati F, Hamouda ASM (2011) Modified genetic algorithms for manufacturing process planning in multiple parts manufacturing lines. Expert Syst Appl 38:10770\u201310779","journal-title":"Expert Syst Appl"},{"key":"1119_CR23","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":"1119_CR24","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":"1119_CR25","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/j.rcim.2006.06.004","volume":"23","author":"A Rossi","year":"2007","unstructured":"Rossi A, Dini G (2007) Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method. Robot Comput Integr Manuf 23:503\u2013516","journal-title":"Robot Comput Integr Manuf"},{"key":"1119_CR26","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s00170-005-0375-4","volume":"32","author":"M Saidi-Mehrabad","year":"2007","unstructured":"Saidi-Mehrabad M, Fattahi P (2007) Flexible job shop scheduling with tabu search algorithms. Int J Adv Manuf Technol 32:563\u2013570","journal-title":"Int J Adv Manuf Technol"},{"issue":"3","key":"1119_CR27","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1080\/00207540310001613683","volume":"42","author":"T Siwamogsatham","year":"2004","unstructured":"Siwamogsatham T, Saygin C (2004) Auction-based distributed scheduling and control scheme for flexible manufacturing systems. Int J Prod Res 42(3):542\u2013572","journal-title":"Int J Prod Res"},{"key":"1119_CR28","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.asoc.2004.03.013","volume":"5","author":"IT Tanev","year":"2004","unstructured":"Tanev IT, Uozumi T, Morotome Y (2004) Hybrid evolutionary algorithm-based real-world flexible job shop scheduling problem: application service provider approach. Appl Soft Comput 5:87\u2013100","journal-title":"Appl Soft Comput"},{"key":"1119_CR29","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1016\/j.cie.2007.08.008","volume":"54","author":"JC Tay","year":"2008","unstructured":"Tay JC, Ho NB (2008) Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Comput Ind Eng 54:453\u2013473","journal-title":"Comput Ind Eng"},{"key":"1119_CR30","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1016\/j.eswa.2009.06.007","volume":"37","author":"M Yazdani","year":"2010","unstructured":"Yazdani M, Amiri M, Zandieh M (2010) Flexible job-shop scheduling with parallel variable neighborhood search algorithm. Expert Syst Appl 37:678\u2013687","journal-title":"Expert Syst Appl"},{"key":"1119_CR31","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. Expert Syst Appl 38:3563\u20133573","journal-title":"Expert Syst Appl"},{"issue":"11","key":"1119_CR32","doi-asserted-by":"crossref","first-page":"2903","DOI":"10.1080\/00207540701644219","volume":"47","author":"R Zhou","year":"2009","unstructured":"Zhou R, Nee AYC, Lee HP (2009) Performance of an ant colony optimisation algorithm in dynamic job shop scheduling problems. Int J Prod Res 47(11):2903\u20132920","journal-title":"Int J Prod Res"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-012-1119-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-012-1119-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-012-1119-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T20:00:08Z","timestamp":1743969608000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-012-1119-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,12]]},"references-count":32,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["1119"],"URL":"https:\/\/doi.org\/10.1007\/s00521-012-1119-7","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,12]]}}}