{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T06:43:10Z","timestamp":1781246590176,"version":"3.54.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,9,14]],"date-time":"2018-09-14T00:00:00Z","timestamp":1536883200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cogn Comput"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s12559-018-9595-4","type":"journal-article","created":{"date-parts":[[2018,9,14]],"date-time":"2018-09-14T04:27:12Z","timestamp":1536899232000},"page":"195-205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":52,"title":["Extracting New Dispatching Rules for Multi-objective Dynamic Flexible Job Shop Scheduling with Limited Buffer Spaces"],"prefix":"10.1007","volume":"12","author":[{"given":"Aydin","family":"Teymourifar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gurkan","family":"Ozturk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zehra Kamisli","family":"Ozturk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ozan","family":"Bahadir","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,9,14]]},"reference":[{"key":"9595_CR1","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/j.ijpe.2008.11.007","volume":"117.2","author":"SQ Liu","year":"2009","unstructured":"Liu SQ, Kozan E. Scheduling a flow shop with combined buffer conditions. Int J Prod Econ 2009;117.2: 371\u201380. \nhttps:\/\/doi.org\/10.1016\/j.ijpe.2008.11.007\n\n.","journal-title":"Int J Prod Econ"},{"key":"9595_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.cor.2016.04.023","volume":"I","author":"SQ Liu","year":"2016","unstructured":"Liu SQ, Kozan E. Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements. Comput Oper Res 2016;I:31\u201341. \nhttps:\/\/doi.org\/10.1016\/j.cor.2016.04.023\n\n.","journal-title":"Comput Oper Res"},{"key":"9595_CR3","doi-asserted-by":"publisher","first-page":"2840","DOI":"10.1016\/j.cor.2008.12.012","volume":"36.10","author":"SQ Liu","year":"2009","unstructured":"Liu SQ, Kozan E. Scheduling trains as a blocking parallel-machine job shop scheduling problem. Comput Oper Res 2009;36.10:2840\u201352. \nhttps:\/\/doi.org\/10.1016\/j.cor.2008.12.012\n\n.","journal-title":"Comput Oper Res"},{"key":"9595_CR4","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s00291-005-0008-1","volume":"28.2","author":"P Brucker","year":"2006","unstructured":"Brucker P, Heitmann S, Hurink J, Nieberg T. Job-shop scheduling with limited capacity buffers. OR Spectrum 2006;28.2:151\u201376. \nhttps:\/\/doi.org\/10.1007\/s00291-005-0008-1\n\n.","journal-title":"OR Spectrum"},{"key":"9595_CR5","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/j.ins.2014.10.009","volume":"316","author":"J Li","year":"2015","unstructured":"Li J, Pan Q. Solving the large-scale hybrid flow shop scheduling problem with limited buffers by a hybrid artificial bee colony algorithm. Inf Sci 2015;316:487\u2013502. \nhttps:\/\/doi.org\/10.1016\/j.ins.2014.10.009\n\n.","journal-title":"Inf Sci"},{"key":"9595_CR6","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1080\/0951192X.2013.814165","volume":"27.5","author":"F Zhao","year":"2014","unstructured":"Zhao F, Tang J, Wang J, Jonrinaldi J. An improved particle swarm optimisation with a linearly decreasing disturbance term for flow shop scheduling with limited buffers. Int J Comput Integr Manuf 2014;27.5:488\u201399. \nhttps:\/\/doi.org\/10.1080\/0951192X.2013.814165\n\n.","journal-title":"Int J Comput Integr Manuf"},{"key":"9595_CR7","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1016\/j.asoc.2014.08.028","volume":"24","author":"C Zeng","year":"2014","unstructured":"Zeng C, Tang J, Yan C. Scheduling of no buffer job shop cells with blocking constraints and automated guided vehicles. Appl Soft Comput 2014;24:1033\u201346. \nhttps:\/\/doi.org\/10.1016\/j.asoc.2014.08.028\n\n.","journal-title":"Appl Soft Comput"},{"key":"9595_CR8","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.jmsy.2016.05.001","volume":"40","author":"H Ye","year":"2016","unstructured":"Ye H, Li W, Miao E. An effective heuristic for no-wait flow shop production to minimize makespan. J Manuf Syst 2016;40:2\u20137. \nhttps:\/\/doi.org\/10.1016\/j.jmsy.2016.05.001\n\n.","journal-title":"J Manuf Syst"},{"key":"9595_CR9","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.ejor.2003.03.002","volume":"161.1","author":"A Soukhal","year":"2005","unstructured":"Soukhal A, Oulamara A, Martineau P. Complexity of flow shop scheduling problems with transportation constraints. Eur J Oper Res 2005;161.1:32\u201341. \nhttps:\/\/doi.org\/10.1016\/j.ejor.2003.03.002\n\n.","journal-title":"Eur J Oper Res"},{"key":"9595_CR10","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1109\/TEVC.2012.2227326","volume":"17.5","author":"S Nguyen","year":"2013","unstructured":"Nguyen S, Zhang M, Johnston M, Tan KC. A computational study of representations in genetic programming to evolve dispatching rules for the job shop scheduling problem. IEEE Trans Evol Comput 2013;17.5: 621\u201339. \nhttps:\/\/doi.org\/10.1109\/TEVC.2012.2227326\n\n.","journal-title":"IEEE Trans Evol Comput"},{"key":"9595_CR11","doi-asserted-by":"publisher","unstructured":"Hildebrandt T, Heger J, Scholz-Reiter B. Towards improved dispatching rules for complex shop floor scenarios: a genetic programming approach. Proceedings of the 12th annual conference on Genetic and evolutionary computation. ACM; 2010. \nhttps:\/\/doi.org\/10.1145\/1830483.1830530\n\n.","DOI":"10.1145\/1830483.1830530"},{"key":"9595_CR12","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1016\/j.cie.2007.08.008","volume":"54.3","author":"JC Tay","year":"2008","unstructured":"Tay JC, Ho NB. Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Comput Ind Eng 2008;54.3:453\u201373. \nhttps:\/\/doi.org\/10.1016\/j.cie.2007.08.008\n\n.","journal-title":"Comput Ind Eng"},{"key":"9595_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ijpe.2012.10.016","volume":"145.1","author":"CW Pickardt","year":"2013","unstructured":"Pickardt CW, Hildebrandt T, Branke J, Heger J, Scholz-Reiter B. Evolutionary generation of dispatching rule sets for complex dynamic scheduling problems. Int J Prod Econ 2013;145.1:67\u201377. \nhttps:\/\/doi.org\/10.1016\/j.ijpe.2012.10.016\n\n.","journal-title":"Int J Prod Econ"},{"key":"9595_CR14","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s10951-006-5591-8","volume":"9.1","author":"CD Geiger","year":"2006","unstructured":"Geiger CD, Geiger CD, Uzsoy R, Aytu H. Rapid modeling and discovery of priority dispatching rules: an autonomous learning approach. J Sched 2006;9.1:7\u201334. \nhttps:\/\/doi.org\/10.1007\/s10951-006-5591-8\n\n.","journal-title":"J Sched"},{"key":"9595_CR15","doi-asserted-by":"publisher","unstructured":"Pickardt C, Branke J, Hildebrandt T, Heger J, Scholz-Reiter B. Generating dispatching rules for semiconductor manufacturing to minimize weighted tardiness. Proceedings of the 2010 Winter Simulation Conference (WSC). IEEE; 2010. \nhttps:\/\/doi.org\/10.1109\/WSC.2010.5678946\n\n.","DOI":"10.1109\/WSC.2010.5678946"},{"key":"9595_CR16","volume-title":"Evolutionary algorithms for solving multi-objective problems, Vol. 5","author":"CAC Coello","year":"2007","unstructured":"Coello CAC, Lamont GB, Van-Veldhuizen DA, Vol. 5. Evolutionary algorithms for solving multi-objective problems. New York: Springer; 2007."},{"key":"9595_CR17","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6.2","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol comput 2002;6.2:182\u201397. \nhttps:\/\/doi.org\/10.1109\/4235.996017\n\n.","journal-title":"IEEE Trans Evol comput"},{"key":"9595_CR18","doi-asserted-by":"publisher","first-page":"595","DOI":"10.12693\/APhysPolA.132.595","volume":"132","author":"ZK Ozturk","year":"2017","unstructured":"Ozturk ZK, Uluel M. A hybrid NSGA -II algorithm for multi-objective quadratic assignment problems. Acta Phys Polonica A 2017;132:595\u2013962. \nhttps:\/\/doi.org\/10.12693\/APhysPolA.132.959\n\n.","journal-title":"Acta Phys Polonica A"},{"key":"9595_CR19","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.cor.2014.01.010","volume":"47","author":"S Jia","year":"2014","unstructured":"Jia S, Hu ZH. Path-relinking tabu search for the multi-objective flexible job shop scheduling problem. Comput Oper Res 2014;47:11\u201326. \nhttps:\/\/doi.org\/10.1016\/j.cor.2014.01.010\n\n.","journal-title":"Comput Oper Res"},{"key":"9595_CR20","doi-asserted-by":"publisher","first-page":"82","DOI":"10.4018\/978-1-59140-312-8.ch005","volume-title":"Recent Developments in Biologically Inspired Computing","author":"C\u00e2ndida Ferreira","year":"2005","unstructured":"Ferreira C. 2004. Gene expression programming and the evolution of computer programs. Recent Develop Biol Inspired Comput, 82\u2013103. \nhttps:\/\/doi.org\/10.4018\/978-1-59140-312-8.ch005\n\n."},{"issue":"1","key":"9595_CR21","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/s12559-013-9201-8","volume":"6","author":"J Swan","year":"2014","unstructured":"Swan J, Woodward J, zcan E, Kendall G, Burke E. Searching the hyper-heuristic design space. Cogn Computat 2014;6(1):66\u201373. \nhttps:\/\/doi.org\/10.1007\/s12559-013-9201-8\n\n.","journal-title":"Cogn Computat"},{"key":"9595_CR22","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s12559-015-9368-2","volume":"8.3","author":"JC Ortiz-Bayliss","year":"2016","unstructured":"Ortiz-Bayliss JC, Terashima-Marn H, Conant-Pablos SE. A neuro-evolutionary hyper-heuristic approach for constraint satisfaction problems. Cogn Comput 2016;8.3:429\u201341. \nhttps:\/\/doi.org\/10.1007\/s12559-015-9368-2\n\n.","journal-title":"Cogn Comput"},{"key":"9595_CR23","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1007\/s12559-015-9370-8","volume":"7.6","author":"N Siddique","year":"2015","unstructured":"Siddique N, Adeli H. Nature inspired computing: an overview and some future directions. Cogn Comput 2015; 7.6:706\u201314. \nhttps:\/\/doi.org\/10.1007\/s12559-015-9370-8\n\n.","journal-title":"Cogn Comput"},{"key":"9595_CR24","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s12559-017-9485-1","volume":"9.4","author":"N Siddique","year":"2017","unstructured":"Siddique N, Adeli H. Nature-inspired chemical reaction optimisation algorithms. Cogn Comput 2017;9.4: 411\u201322. \nhttps:\/\/doi.org\/10.1007\/s12559-017-9485-1\n\n.","journal-title":"Cogn Comput"},{"issue":"1","key":"9595_CR25","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1080\/19942060.2018.1452296","volume":"12","author":"S Faizollahzadeh Ardabili","year":"2018","unstructured":"Faizollahzadeh Ardabili S, Najafi B, Shamshirband S, Minaei Bidgoli B, Deo RC, Chau KW. Computational intelligence approach for modeling hydrogen production: a review. Eng Appl Comput Fluid Mech 2018; 12(1):438\u201358. \nhttps:\/\/doi.org\/10.1080\/19942060.2018.1452296\n\n.","journal-title":"Eng Appl Comput Fluid Mech"},{"issue":"1","key":"9595_CR26","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1080\/19942060.2018.1448896","volume":"12","author":"F Fotovatikhah","year":"2018","unstructured":"Fotovatikhah F, Herrera M, Shamshirband S, Chau KW, Faizollahzadeh Ardabili S, Piran MJ. Survey of computational intelligence as basis to big flood management: challenges, research directions and future work. Eng Appl Comput Fluid Mech 2018;12(1):411\u201337. \nhttps:\/\/doi.org\/10.1080\/19942060.2018.1448896\n\n.","journal-title":"Eng Appl Comput Fluid Mech"},{"key":"9595_CR27","doi-asserted-by":"publisher","first-page":"1060","DOI":"10.1016\/j.jhydrol.2015.09.028","volume":"529","author":"V Gholami","year":"2015","unstructured":"Gholami V, Chau KW, Fadaee F, Torkaman J, Ghaffari A. Modeling of groundwater level fluctuations using dendrochronology in alluvial aquifers. J Hydrology 2015;529:1060\u20139. \nhttps:\/\/doi.org\/10.1016\/j.jhydrol.2015.09.028\n\n.","journal-title":"J Hydrology"},{"issue":"4","key":"9595_CR28","doi-asserted-by":"publisher","first-page":"1377","DOI":"10.2166\/hydro.2013.134","volume":"15","author":"WC Wang","year":"2013","unstructured":"Wang WC, Xu DM, Chau KW, Chen S. Improved annual rainfall-runoff forecasting using PSO\u2013SVM model based on EEMD. J Hydroinformatics 2013;15(4):1377\u201390. \nhttps:\/\/doi.org\/10.2166\/hydro.2013.134\n\n.","journal-title":"J Hydroinformatics"},{"key":"9595_CR29","doi-asserted-by":"publisher","first-page":"1788","DOI":"10.1016\/j.jhydrol.2015.08.008","volume":"529","author":"R Taormina","year":"2015","unstructured":"Taormina R, Chau KW, Sivakumar B. Neural network river forecasting through baseflow separation and binary-coded swarm optimization. J Hydrology 2015;529:1788\u201397. \nhttps:\/\/doi.org\/10.1016\/j.jhydrol.2015.08.008\n\n.","journal-title":"J Hydrology"},{"key":"9595_CR30","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1007\/978-3-642-04070-2_100","volume-title":"Emerging Intelligent Computing Technology and Applications","author":"Shanwen Zhang","year":"2009","unstructured":"Zhang S, Chau KW. Dimension reduction using semi-supervised locally linear embedding for plant leaf classification. International Conference on Intelligent Computing. Berlin: Springer; 2009. p. 948\u2013955."},{"key":"9595_CR31","unstructured":"Ozturk G, Bahadir O, Teymourifar A. Extracting priority rules for dynamic multi-objective flexible job shop scheduling problems using gene expression programming. submitted to the International Journal of Production Research."},{"issue":"2","key":"9595_CR32","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s12559-016-9447-z","volume":"9","author":"SS Kim","year":"2017","unstructured":"Kim SS, McLoone S, Byeon JH, Lee S, Liu H. Cognitively inspired artificial bee colony clustering for cognitive wireless sensor networks. Cogn Comput 2017;9(2):207\u201324. \nhttps:\/\/doi.org\/10.1007\/s12559-016-9447-z\n\n.","journal-title":"Cogn Comput"},{"issue":"3","key":"9595_CR33","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/s12559-017-9542-9","volume":"10","author":"Ibrahim Aljarah","year":"2018","unstructured":"Aljarah I, AlaM AZ, Faris H, Hassonah MA, Mirjalili S, Saadeh H. 2018. Simultaneous feature selection and support vector machine optimization using the grasshopper optimization algorithm. Cogn Comput, 1\u201318. \nhttps:\/\/doi.org\/10.1007\/s12559-017-9542-9\n\n.","journal-title":"Cognitive Computation"},{"issue":"6","key":"9595_CR34","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1007\/s12559-017-9508-y","volume":"9","author":"S Chakraborty","year":"2017","unstructured":"Chakraborty S, Dey N, Samanta S, Ashour AS, Barna C, Balas MM. Optimization of non-rigid demons registration using cuckoo search algorithm. Cogn Comput 2017;9(6):817\u201326. \nhttps:\/\/doi.org\/10.1007\/s12559-017-9508-y\n\n.","journal-title":"Cogn Comput"},{"issue":"2","key":"9595_CR35","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s12559-017-9519-8","volume":"10","author":"M Anbar","year":"2018","unstructured":"Anbar M, Abdullah R, Al-Tamimi BN, Hussain A. A machine learning approach to detect router advertisement flooding attacks in next-generation IPv6 networks. Cogn Comput 2018;10(2):201\u201314. \nhttps:\/\/doi.org\/10.1007\/s12559-017-9519-8\n\n.","journal-title":"Cogn Comput"},{"issue":"5","key":"9595_CR36","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1007\/s12559-015-9324-1","volume":"7","author":"HM Dubey","year":"2015","unstructured":"Dubey HM, Pandit M, Panigrahi BK. A biologically inspired modified flower pollination algorithm for solving economic dispatch problems in modern power systems. Cogn Comput 2015;7(5):594\u2013608. \nhttps:\/\/doi.org\/10.1007\/s12559-015-9324-1\n\n.","journal-title":"Cogn Comput"},{"issue":"5","key":"9595_CR37","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1007\/s12559-016-9389-5","volume":"8","author":"A Gepperth","year":"2016","unstructured":"Gepperth A, Karaoguz C. A bio-inspired incremental learning architecture for applied perceptual problems. Cogn Comput 2016;8(5):924\u201334. \nhttps:\/\/doi.org\/10.1007\/s12559-016-9389-5\n\n.","journal-title":"Cogn Comput"},{"key":"9595_CR38","volume-title":"Test instances for the flexible job shop scheduling problem with work centers","author":"D Behnke","year":"2012","unstructured":"Behnke D, Geiger MJ. Test instances for the flexible job shop scheduling problem with work centers. Hamburg: Technical Report. Helmut-Schmidt-Universitat; 2012."},{"issue":"9","key":"9595_CR39","doi-asserted-by":"publisher","first-page":"3274","DOI":"10.1080\/00207543.2017.1401240","volume":"56","author":"Shi Qiang Liu","year":"2017","unstructured":"Liu SQ, Kozan E, Masoud M, Zhang Y, Chan FT. 2017. Job shop scheduling with a combination of four buffering constraints. Int J Prod Res, 1\u201320. \nhttps:\/\/doi.org\/10.1080\/00207543.2017.1401240\n\n.","journal-title":"International Journal of Production Research"}],"container-title":["Cognitive Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12559-018-9595-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12559-018-9595-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12559-018-9595-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T18:06:32Z","timestamp":1580580392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12559-018-9595-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,14]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["9595"],"URL":"https:\/\/doi.org\/10.1007\/s12559-018-9595-4","relation":{},"ISSN":["1866-9956","1866-9964"],"issn-type":[{"value":"1866-9956","type":"print"},{"value":"1866-9964","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,14]]},"assertion":[{"value":"21 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 September 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interest"}}]}}