{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:32Z","timestamp":1740122372907,"version":"3.37.3"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,5,18]],"date-time":"2024-05-18T00:00:00Z","timestamp":1715990400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,18]],"date-time":"2024-05-18T00:00:00Z","timestamp":1715990400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s10878-024-01176-0","type":"journal-article","created":{"date-parts":[[2024,5,18]],"date-time":"2024-05-18T18:01:32Z","timestamp":1716055292000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An intensification approach based on fitness landscape characteristics for job shop scheduling problem"],"prefix":"10.1007","volume":"47","author":[{"given":"Aparecida de F\u00e1tima","family":"Castello Rosa","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6075-5566","authenticated-orcid":false,"given":"Fabio Henrique","family":"Pereira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,18]]},"reference":[{"issue":"3","key":"1176_CR1","doi-asserted-by":"publisher","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(3):391\u2013401. https:\/\/doi.org\/10.1287\/mnsc.34.3.391","journal-title":"Manage Sci"},{"issue":"4","key":"1176_CR2","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0167-8191(03)00014-0","volume":"29","author":"R Aiex","year":"2003","unstructured":"Aiex R, Binato S, Resende MGC (2003) Parallel GRASP with path-relinking for job shop scheduling. Parallel Comput 29(4):393\u2013430. https:\/\/doi.org\/10.1016\/S0167-8191(03)00014-0","journal-title":"Parallel Comput"},{"issue":"2","key":"1176_CR3","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/S0377-2217(03)00415-6","volume":"159","author":"C Akkan","year":"2004","unstructured":"Akkan C, Karabati S (2004) The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm. Eur J Oper Res 159(2):420\u2013429. https:\/\/doi.org\/10.1016\/S0377-2217(03)00415-6","journal-title":"Eur J Oper Res"},{"key":"1176_CR4","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1016\/j.asoc.2016.08.037","volume":"49","author":"K Akram","year":"2016","unstructured":"Akram K, Kamal K, Zeb A (2016) Fast simulated annealing hybridized with quenching for solving job shop scheduling problem. Appl Soft Comput J 49:510\u201352. https:\/\/doi.org\/10.1016\/j.asoc.2016.08.037","journal-title":"Appl Soft Comput J"},{"key":"1176_CR5","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/j.cie.2015.04.006","volume":"85","author":"L Asadzadeh","year":"2015","unstructured":"Asadzadeh L (2015) A local search genetic algorithm for the job shop scheduling problem with intelligent agents. Comput Ind Eng 85:376\u2013383. https:\/\/doi.org\/10.1016\/j.cie.2015.04.006","journal-title":"Comput Ind Eng"},{"key":"1176_CR6","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/j.cie.2016.06.025","volume":"102","author":"L Asadzadeh","year":"2016","unstructured":"Asadzadeh L (2016) A parallel artificial bee colony algorithm for the job shop scheduling problem with a dynamic migration strategy. Comput Ind Eng 102:359\u2013367. https:\/\/doi.org\/10.1016\/j.cie.2016.06.025","journal-title":"Comput Ind Eng"},{"issue":"11","key":"1176_CR7","doi-asserted-by":"publisher","first-page":"1957","DOI":"10.1016\/j.mcm.2010.04.019","volume":"52","author":"L Asadzadeh","year":"2010","unstructured":"Asadzadeh L, Zamanifar K (2010) An agent-based parallel approach for the job shop scheduling problem with genetic algorithms. Math Comput Modell 52(11):1957\u20131965. https:\/\/doi.org\/10.1016\/j.mcm.2010.04.019","journal-title":"Math Comput Modell"},{"key":"1176_CR8","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1016\/j.asoc.2015.01.047","volume":"30","author":"M Basseur","year":"2015","unstructured":"Basseur M, Go\u00ebffon A (2015) Climbing combinatorial fitness landscapes. Appl Soft Comput 30:688\u201370. https:\/\/doi.org\/10.1016\/j.asoc.2015.01.047","journal-title":"Appl Soft Comput"},{"issue":"1","key":"1176_CR9","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J Beasley","year":"1990","unstructured":"Beasley J (1990) OR-library: distributing test problems by electronic mail. J Oper Res Soc 41(1):1069\u2013107. https:\/\/doi.org\/10.1057\/jors.1990.166","journal-title":"J Oper Res Soc"},{"issue":"3","key":"1176_CR10","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1016\/j.ejor.2017.03.030","volume":"261","author":"C Bierwirth","year":"2017","unstructured":"Bierwirth C, Kuhpfahl J (2017) Extended GRASP for the job shop scheduling problem with total weighted tardiness objective. Eur J Oper Res 261(3):835\u201384. https:\/\/doi.org\/10.1016\/j.ejor.2017.03.030","journal-title":"Eur J Oper Res"},{"key":"1176_CR11","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-1-4615-1507-4_3","volume-title":"A grasp for job shop scheduling","author":"S Binato","year":"2002","unstructured":"Binato S, Hery WJ, Loewenstern DM et al (2002) A grasp for job shop scheduling. Springer, Boston, MA, pp 59\u201379. https:\/\/doi.org\/10.1007\/978-1-4615-1507-4_3"},{"issue":"3","key":"1176_CR12","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10479-005-3971-7","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv 35(3):189\u2013213. https:\/\/doi.org\/10.1007\/s10479-005-3971-7","journal-title":"ACM Comput Surv"},{"key":"1176_CR13","doi-asserted-by":"publisher","unstructured":"Bo\u017cejko W, Smutnicki C, Uchro\u0144ski M, et\u00a0al (2017) Big valley in scheduling problems landscape - Metaheuristics with reduced searching area. In: 2017 22nd International conference on methods and models in automation and robotics, MMAR 2017 pp 458\u201346. https:\/\/doi.org\/10.1109\/MMAR.2017.8046871","DOI":"10.1109\/MMAR.2017.8046871"},{"key":"1176_CR14","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-319-74718-7-54","volume-title":"Computer aided systems theory\u2014EUROCAST 2017","author":"W Bo\u017cejko","year":"2018","unstructured":"Bo\u017cejko W, Gnatowski A, Smutnicki C et al (2018) Local search metaheuristics with reduced searching diameter. In: Pichler F, Quesada-Arencibia A (eds) Computer aided systems theory\u2014EUROCAST 2017, vol 1. Springer, Berlin, pp 447\u2013454. https:\/\/doi.org\/10.1007\/978-3-319-74718-7-54"},{"key":"1176_CR15","first-page":"225","volume-title":"Industrial scheduling","author":"H Fisher","year":"1963","unstructured":"Fisher H, Thompson GL (1963) Probabilistic learning combinations of local job-shop scheduling rules. In: Muth J, Thompson G (eds) Industrial scheduling. Prentice Hall, Hoboken, pp 225\u2013251"},{"issue":"12","key":"1176_CR16","doi-asserted-by":"publisher","first-page":"3265","DOI":"10.1109\/TFUZZ.2020.3003506","volume":"28","author":"D Gao","year":"2020","unstructured":"Gao D, Wang GG, Pedrycz W (2020) Solving fuzzy job-shop scheduling problem using de algorithm improved by a selection mechanism. IEEE Trans Fuzzy Syst 28(12):3265\u2013327. https:\/\/doi.org\/10.1109\/TFUZZ.2020.3003506","journal-title":"IEEE Trans Fuzzy Syst"},{"issue":"4","key":"1176_CR17","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1016\/j.cie.2011.01.003","volume":"60","author":"L Gao","year":"2011","unstructured":"Gao L, Zhang G, Zhang L et al (2011) An efficient memetic algorithm for solving the job shop scheduling problem. Comput Ind Eng 60(4):699\u2013705. https:\/\/doi.org\/10.1016\/j.cie.2011.01.003","journal-title":"Comput Ind Eng"},{"key":"1176_CR18","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.cie.2015.08.002","volume":"88","author":"L Gao","year":"2015","unstructured":"Gao L, Li X, Wen X et al (2015) A hybrid algorithm based on a new neighborhood structure evaluation method for job shop scheduling problem. Comput Ind Eng 88:417\u2013429. https:\/\/doi.org\/10.1016\/j.cie.2015.08.002","journal-title":"Comput Ind Eng"},{"key":"1176_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-1-4615-4102-8-1","volume-title":"Interfaces in computer science and operations research: advances in metaheuristics, optimization, and stochastic modeling technologies","author":"F Glover","year":"1997","unstructured":"Glover F (1997) Tabu search and adaptive memory programming\u2013advances, applications and challenges. In: Barr RS, Helgason RV, Kennington JL (eds) Interfaces in computer science and operations research: advances in metaheuristics, optimization, and stochastic modeling technologies. Springer, Boston, MA, pp 1\u20137. https:\/\/doi.org\/10.1007\/978-1-4615-4102-8-1"},{"key":"1176_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F Glover","year":"1997","unstructured":"Glover F, Laguna M (1997) Tabu search. Springer, Boston, MA. https:\/\/doi.org\/10.1007\/978-1-4615-6089-0"},{"issue":"4","key":"1176_CR21","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s10732-019-09409-w","volume":"25","author":"F Glover","year":"2019","unstructured":"Glover F, Samorani M (2019) Intensification, diversification and learning in metaheuristic optimization. J Heurist 25(4):517\u2013520. https:\/\/doi.org\/10.1007\/s10732-019-09409-w","journal-title":"J Heurist"},{"issue":"1","key":"1176_CR22","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.ejor.2004.03.012","volume":"167","author":"JF Gon\u00e7alves","year":"2005","unstructured":"Gon\u00e7alves JF, Mendes JJdM, Resende MGC (2005) A hybrid genetic algorithm for the job shop scheduling problem. Eur J Oper Res 167(1):77\u20139. https:\/\/doi.org\/10.1016\/j.ejor.2004.03.012","journal-title":"Eur J Oper Res"},{"key":"1176_CR23","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/2486001.2486037","volume-title":"A very fast tabu search algorithm for job shop problem","author":"J Grabowski","year":"2005","unstructured":"Grabowski J, Wodecki M (2005) A very fast tabu search algorithm for job shop problem, vol 30. Springer, Berlin, pp 117\u2013144. https:\/\/doi.org\/10.1145\/2486001.2486037"},{"key":"1176_CR24","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-319-51133-7_21","volume-title":"Advances in production management systems. Initiatives for a sustainable world","author":"F Grassi","year":"2016","unstructured":"Grassi F, Schimit PHT, Pereira FH (2016) Dynamic seed genetic algorithm to solve job shop scheduling problems. In: N\u00e4\u00e4s I, Vendrametto O, Mendes Reis J et al (eds) Advances in production management systems. Initiatives for a sustainable world. Springer, Cham, pp 170\u2013177. https:\/\/doi.org\/10.1007\/978-3-319-51133-7_21"},{"issue":"1","key":"1176_CR25","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s12293-008-0004-5","volume":"1","author":"SM Hasan","year":"2009","unstructured":"Hasan SM, Sarker R, Essam D et al (2009) Memetic algorithms for solving job-shop scheduling problems. Memet Comput 1(1):69\u201383. https:\/\/doi.org\/10.1007\/s12293-008-0004-5","journal-title":"Memet Comput"},{"issue":"1","key":"1176_CR26","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1109\/TII.2021.3056425","volume":"18","author":"L He","year":"2022","unstructured":"He L, Chiong R, Li W et al (2022) Multiobjective optimization of energy-efficient job-shop scheduling with dynamic reference point-based fuzzy relative entropy. IEEE Trans Industr Inf 18(1):600\u2013610. https:\/\/doi.org\/10.1109\/TII.2021.3056425","journal-title":"IEEE Trans Industr Inf"},{"issue":"10","key":"1176_CR27","doi-asserted-by":"publisher","first-page":"2291","DOI":"10.1016\/j.cor.2011.12.005","volume":"39","author":"R Qing-dao-er ji","year":"2012","unstructured":"Qing-dao-er ji R, Wang Y (2012) A new hybrid genetic algorithm for job shop scheduling problem. Comput Op Res 39(10):2291\u20132299. https:\/\/doi.org\/10.1016\/j.cor.2011.12.005","journal-title":"Comput Op Res"},{"key":"1176_CR28","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.cor.2015.07.011","volume":"66","author":"J Kuhpfahl","year":"2016","unstructured":"Kuhpfahl J, Bierwirth C (2016) A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective. Comput Op Res 66:44\u20135. https:\/\/doi.org\/10.1016\/j.cor.2015.07.011","journal-title":"Comput Op Res"},{"key":"1176_CR29","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.cor.2015.10.005","volume":"67","author":"M Kurdi","year":"2016","unstructured":"Kurdi M (2016) An effective new island model genetic algorithm for job shop scheduling problem. Comput Op Res 67:132\u2013142. https:\/\/doi.org\/10.1016\/j.cor.2015.10.005","journal-title":"Comput Op Res"},{"key":"1176_CR30","unstructured":"Lawrence S (1984) Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (Supplement). PhD thesis, Graduate School of Industrial Administration, Carnegie-Mellon University"},{"issue":"8","key":"1176_CR31","doi-asserted-by":"publisher","first-page":"4991","DOI":"10.1016\/j.asoc.2011.06.001","volume":"11","author":"D Lei","year":"2011","unstructured":"Lei D (2011) Simplified multi-objective genetic algorithms for stochastic job shop scheduling. Appl Soft Comput J 11(8):4991\u20134996. https:\/\/doi.org\/10.1016\/j.asoc.2011.06.001","journal-title":"Appl Soft Comput J"},{"key":"1176_CR32","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/j.ins.2021.12.122","volume":"589","author":"M Li","year":"2022","unstructured":"Li M, Wang GG (2022) A review of green shop scheduling problem. Inf Sci 589:478\u201349. https:\/\/doi.org\/10.1016\/j.ins.2021.12.122","journal-title":"Inf Sci"},{"issue":"3","key":"1176_CR33","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/j.cor.2009.02.010","volume":"37","author":"M Lozano","year":"2010","unstructured":"Lozano M, Garc\u00eda-Mart\u00ednez C (2010) Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report. Comput Oper Res 37(3):481\u2013497. https:\/\/doi.org\/10.1016\/j.cor.2009.02.010","journal-title":"Comput Oper Res"},{"key":"1176_CR34","doi-asserted-by":"publisher","unstructured":"Malan KM, Engelbrecht AP (2014) Fitness landscape analysis for metaheuristic performance prediction. In: Recent advances in the theory and application of fitness landscapes. Emergence, complexity and computation, vol\u00a06. Springer, Berlin, Heidelberg, pp 103\u2013113. https:\/\/doi.org\/10.1007\/978-3-642-41888-4-4","DOI":"10.1007\/978-3-642-41888-4-4"},{"key":"1176_CR35","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1023\/A:1018979424002","volume":"86","author":"DC Mattfeld","year":"1999","unstructured":"Mattfeld DC, Bierwirth C, Kopfer H (1999) A search space analysis of the job shop scheduling problem. Ann Oper Res 86:441\u2013453. https:\/\/doi.org\/10.1023\/A:1018979424002","journal-title":"Ann Oper Res"},{"key":"1176_CR36","doi-asserted-by":"publisher","unstructured":"Morita M, Ochiai H, Tamura K, et\u00a0al (2016) Multi-point search combinatorial optimization method based on neighborhood search using evaluation of big valley structure. In: Proceedings\u20142015 IEEE international conference on systems, man, and cybernetics, SMC 2015, pp 2835\u20132840,https:\/\/doi.org\/10.1109\/SMC.2015.494","DOI":"10.1109\/SMC.2015.494"},{"issue":"3","key":"1176_CR37","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1162\/evco-a-00177","volume":"25","author":"I Moser","year":"2017","unstructured":"Moser I, Gheorghita M, Aleti A (2017) Identifying features of fitness landscapes and relating them to problem difficulty. Evol Comput 25(3):407\u201343. https:\/\/doi.org\/10.1162\/evco-a-00177","journal-title":"Evol Comput"},{"key":"1176_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2011.11.003","volume":"2","author":"F Neri","year":"2012","unstructured":"Neri F, Cotta C (2012) Memetic algorithms and memetic computing optimization: a literature review. Swarm Evol Comput 2:1\u201314. https:\/\/doi.org\/10.1016\/j.swevo.2011.11.003","journal-title":"Swarm Evol Comput"},{"issue":"6","key":"1176_CR39","doi-asserted-by":"publisher","first-page":"797","DOI":"10.2307\/2634595","volume":"42","author":"E Nowicki","year":"1996","unstructured":"Nowicki E, Smutnicki C (1996) A fast taboo search algorithm for the job shop problem. Manage Sci 42(6):797\u201381. https:\/\/doi.org\/10.2307\/2634595","journal-title":"Manage Sci"},{"issue":"2","key":"1176_CR40","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10951-005-6364-5","volume":"8","author":"E Nowicki","year":"2005","unstructured":"Nowicki E, Smutnicki C (2005) An advanced tabu search algorithm for the job shop problem. J Sched 8(2):145\u2013159. https:\/\/doi.org\/10.1007\/s10951-005-6364-5","journal-title":"J Sched"},{"issue":"1","key":"1176_CR41","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10589-008-9206-5","volume":"47","author":"PM Pardalos","year":"2010","unstructured":"Pardalos PM, Shylo OV, Vazacopoulos A (2010) Solving job shop scheduling problems utilizing the properties of backbone and \"big valley\u201c. Comput Optim Appl 47(1):61\u201376. https:\/\/doi.org\/10.1007\/s10589-008-9206-5","journal-title":"Comput Optim Appl"},{"key":"1176_CR42","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.cor.2014.08.006","volume":"53","author":"B Peng","year":"2015","unstructured":"Peng B, L\u00fc Z, Cheng T (2015) A tabu search\/path relinking algorithm to solve the job shop scheduling problem. Comput Op. Res. 53:154\u2013164. https:\/\/doi.org\/10.1016\/j.cor.2014.08.006","journal-title":"Comput Op. Res."},{"issue":"3\u20134","key":"1176_CR43","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1023\/A:1024649709582","volume":"14","author":"E P\u00e9rez","year":"2003","unstructured":"P\u00e9rez E, Herrera F, Hern\u00e1ndez C (2003) Finding multiple solutions in job shop scheduling by niching genetic algorithms. J Intell Manuf 14(3\u20134):323\u201333. https:\/\/doi.org\/10.1023\/A:1024649709582","journal-title":"J Intell Manuf"},{"issue":"3","key":"1176_CR44","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10845-010-0385-4","volume":"23","author":"E P\u00e9rez","year":"2012","unstructured":"P\u00e9rez E, Posada M, Herrera F (2012) Analysis of new niching genetic algorithms for finding multiple solutions in the job shop scheduling. J Intell Manuf 23(3):341\u2013356. https:\/\/doi.org\/10.1007\/s10845-010-0385-4","journal-title":"J Intell Manuf"},{"key":"1176_CR45","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-2361-4","volume-title":"Scheduling: theory, algorithms, and systems","author":"ML Pinedo","year":"2012","unstructured":"Pinedo ML (2012) Scheduling: theory, algorithms, and systems, 4th edn. Springer, Boston, MA","edition":"4"},{"key":"1176_CR46","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-1-4939-6530-4-4","volume-title":"Local search","author":"MGC Resende","year":"2016","unstructured":"Resende MGC, Ribeiro CC (2016) Local search, vol 4. Springer, New York, Chap, pp 63\u201369. https:\/\/doi.org\/10.1007\/978-1-4939-6530-4-4"},{"issue":"2","key":"1176_CR47","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s10732-011-9167-1","volume":"18","author":"CC Ribeiro","year":"2012","unstructured":"Ribeiro CC, Resende MGC (2012) Path-relinking intensification methods for stochastic local search algorithms. J Heurist 18(2):193\u2013214. https:\/\/doi.org\/10.1007\/s10732-011-9167-1","journal-title":"J Heurist"},{"issue":"4","key":"1176_CR48","doi-asserted-by":"publisher","DOI":"10.1016\/j.eij.2023.100420","volume":"24","author":"W Shao","year":"2023","unstructured":"Shao W, Xiao T, Su Z et al (2023) A hybridization of granular adaptive tabu search with path relinking for the multi-depot open vehicle routing problem. Egypt Inform J 24(4):100420. https:\/\/doi.org\/10.1016\/j.eij.2023.100420","journal-title":"Egypt Inform J"},{"key":"1176_CR49","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-319-74718-7_46","volume-title":"Computer aided systems theory\u2014EUROCAST 2017","author":"C Smutnicki","year":"2018","unstructured":"Smutnicki C, Bo\u017cejko W (2018) Tabu search and solution space analyses. The job shop case. In: Moreno-D\u00edaz R, Pichler F, Quesada-Arencibia A (eds) Computer aided systems theory\u2014EUROCAST 2017. Springer, Cham, pp 383\u2013391"},{"key":"1176_CR50","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1613\/jair.2013","volume":"26","author":"MJ Streeter","year":"2006","unstructured":"Streeter MJ, Smith SF (2006) How the landscape of random job shop scheduling instances depends on the ratio of jobs to machines. J Art Intell Resarch 26:247\u2013287. https:\/\/doi.org\/10.1613\/jair.2013","journal-title":"J Art Intell Resarch"},{"issue":"12","key":"1176_CR51","doi-asserted-by":"publisher","first-page":"8519","DOI":"10.1109\/TII.2022.3165636","volume":"18","author":"GG Wang","year":"2022","unstructured":"Wang GG, Gao D, Pedrycz W (2022) Solving multiobjective fuzzy job-shop scheduling problem by a hybrid adaptive differential evolution algorithm. IEEE Trans Industr Inf 18(12):8519\u20138528. https:\/\/doi.org\/10.1109\/TII.2022.3165636","journal-title":"IEEE Trans Industr Inf"},{"key":"1176_CR52","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.cie.2014.04.006","volume":"73","author":"X Wang","year":"2014","unstructured":"Wang X, Duan H (2014) A hybrid biogeography-based optimization algorithm for job shop scheduling problem. Comput Ind Eng 73:96\u2013114. https:\/\/doi.org\/10.1016\/j.cie.2014.04.006","journal-title":"Comput Ind Eng"},{"key":"1176_CR53","doi-asserted-by":"publisher","unstructured":"Watson JP (2010) An introduction to fitness landscape analysis and cost models for local search. In: Handbook of metaheuristics. pp 599\u2013623. https:\/\/doi.org\/10.1007\/978-1-4419-1665-5-20","DOI":"10.1007\/978-1-4419-1665-5-20"},{"key":"1176_CR54","doi-asserted-by":"publisher","unstructured":"Wong LP, Puan CY, Low MYH, et\u00a0al (2008) Bee colony optimization algorithm with big valley landscape exploitation for job shop scheduling problems. In: 2008 winter simulation conference, pp 2050\u2013205. https:\/\/doi.org\/10.1109\/WSC.2008.4736301","DOI":"10.1109\/WSC.2008.4736301"},{"issue":"2","key":"1176_CR55","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1504\/IJBIC.2010.032125","volume":"2","author":"LP Wong","year":"2010","unstructured":"Wong LP, Puan CY, Low MYH et al (2010) Bee colony optimisation algorithm with big valley landscape exploitation for job shop scheduling problems. Int J Bio Inspir Comput 2(2):85\u201399. https:\/\/doi.org\/10.1504\/IJBIC.2010.032125","journal-title":"Int J Bio Inspir Comput"},{"key":"1176_CR56","doi-asserted-by":"publisher","first-page":"3361","DOI":"10.1016\/j.jclepro.2015.09.097","volume":"112","author":"R Zhang","year":"2016","unstructured":"Zhang R, Chiong R (2016) Solving the energy-efficient job shop scheduling problem: a multi-objective genetic algorithm with enhanced local search for minimizing the total weighted tardiness and total energy consumption. J Clean Prod 112:3361\u20133375. https:\/\/doi.org\/10.1016\/j.jclepro.2015.09.097","journal-title":"J Clean Prod"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01176-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01176-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01176-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T14:39:36Z","timestamp":1721659176000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01176-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,18]]},"references-count":56,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["1176"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01176-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,5,18]]},"assertion":[{"value":"24 April 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no financial or non-financial interests that are directly or indirectly related to the work submitted for publication.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"77"}}