{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:41:27Z","timestamp":1775068887909,"version":"3.50.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"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. Comput. Sci. Technol."],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1007\/s11390-023-2007-6","type":"journal-article","created":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T08:01:46Z","timestamp":1721635306000},"page":"737-752","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Neighborhood Combination Search for Single-Machine Scheduling with Sequence-Dependent Setup Time"],"prefix":"10.1007","volume":"39","author":[{"given":"Xiao-Lu","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong-Yun","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia-Ming","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhou-Xing","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi-Peng","family":"Lyu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun-Wen","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,22]]},"reference":[{"key":"2007_CR1","unstructured":"Hoos H H, St\u00fctzle T. Stochastic Local Search: Foundations and Applications. Elsevier, 2004."},{"issue":"2","key":"2007_CR2","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S, Kernighan B W. An effective heuristic algorithm for the traveling-salesman problem. Operations Research, 1973, 21(2): 498\u2013516. DOI: https:\/\/doi.org\/10.1287\/opre.21.2.498.","journal-title":"Operations Research"},{"key":"2007_CR3","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 P, Cheng T C E. A tabu search\/path relinking algorithm to solve the job shop scheduling problem. Computers & Operations Research, 2015, 53: 154\u2013164. DOI: https:\/\/doi.org\/10.1016\/j.cor.2014.08.006.","journal-title":"Computers & Operations Research"},{"issue":"11","key":"2007_CR4","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107 N, Hansen P. Variable neighborhood search. Computers & Operations Research, 1997, 24(11): 1097\u20131100. DOI: https:\/\/doi.org\/10.1016\/S0305-0548(97)00031-2.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"2007_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10732-010-9128-0","volume":"17","author":"Z P L\u00fc","year":"2011","unstructured":"L\u00fc Z P, Hao J K, Glover F. Neighborhood analysis: A case study on curriculum-based course timetabling. Journal of Heuristics, 2011, 17(2): 97\u2013118. DOI: https:\/\/doi.org\/10.1007\/s10732-010-9128-0.","journal-title":"Journal of Heuristics"},{"issue":"3","key":"2007_CR6","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s10951-013-0351-z","volume":"17","author":"H Y Xu","year":"2014","unstructured":"Xu H Y, L\u00fc Z P, Cheng T C E. Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness. Journal of Scheduling, 2014, 17(3): 271\u2013287. DOI: https:\/\/doi.org\/10.1007\/s10951-013-0351-z.","journal-title":"Journal of Scheduling"},{"key":"2007_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.cor.2014.04.009","volume":"50","author":"H Y Xu","year":"2014","unstructured":"Xu H Y, L\u00fc Z P, Yin A H, Shen L J, Buscher U. A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times. Computers & Operations Research, 2014, 50: 47\u201360. DOI: https:\/\/doi.org\/10.1016\/j.cor.2014.04.009.","journal-title":"Computers & Operations Research"},{"issue":"2\/3","key":"2007_CR8","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s10732-017-9325-1","volume":"23","author":"M Gonz\u00e1lez","year":"2017","unstructured":"Gonz\u00e1lez M, Palacios J J, Vela C R, Hern\u00e1ndez-Arauzo A. Scatter search for minimizing weighted tardiness in a single machine scheduling with setups. Journal of Heuristics, 2017, 23(2\/3): 81\u2013110. DOI: https:\/\/doi.org\/10.1007\/s10732-017-9325-1.","journal-title":"Journal of Heuristics"},{"key":"2007_CR9","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1016\/j.asoc.2015.07.050","volume":"37","author":"M A Gonz\u00e1lez","year":"2015","unstructured":"Gonz\u00e1lez M A, Vela C R. An efficient memetic algorithm for total weighted tardiness minimization in a single machine with setups. Applied Soft Computing, 2015, 37: 506\u2013518. DOI: https:\/\/doi.org\/10.1016\/j.asoc.2015.07.050.","journal-title":"Applied Soft Computing"},{"key":"2007_CR10","doi-asserted-by":"publisher","unstructured":"Tasgetiren M F, Pan Q K, Ozturkoglu Y, Chen A H L. A memetic algorithm with a variable block insertion heuristic for single machine total weighted tardiness problem with sequence dependent setup times. In Proc. the 2016 IEEE Congress on Evolutionary Computation, Jul. 2016, pp.2911\u20132918. DOI: https:\/\/doi.org\/10.1109\/cec.2016.7744157.","DOI":"10.1109\/cec.2016.7744157"},{"key":"2007_CR11","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.cor.2016.10.008","volume":"79","author":"A Subramanian","year":"2017","unstructured":"Subramanian A, Farias K. Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times. Computers & Operations Research, 2017, 79: 190\u2013206. DOI: https:\/\/doi.org\/10.1016\/j.cor.2016.10.008.","journal-title":"Computers & Operations Research"},{"issue":"11","key":"2007_CR12","doi-asserted-by":"publisher","first-page":"3627","DOI":"10.1007\/s00500-018-3014-3","volume":"23","author":"C L Chen","year":"2019","unstructured":"Chen C L. Iterated population-based VND algorithms for single-machine scheduling with sequence-dependent setup times. Soft Computing, 2019, 23(11): 3627\u20133641. DOI: https:\/\/doi.org\/10.1007\/s00500-018-3014-3.","journal-title":"Soft Computing"},{"key":"2007_CR13","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R L Graham","year":"1979","unstructured":"Graham R L, Lawler E L, Lenstra J K, Kan A H G R. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 1979, 5: 287\u2013326. DOI: https:\/\/doi.org\/10.1016\/s0167-5060(08)70356-x.","journal-title":"Annals of Discrete Mathematics"},{"issue":"1","key":"2007_CR14","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.cor.2012.07.004","volume":"40","author":"S Tanaka","year":"2013","unstructured":"Tanaka S, Araki M. An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times. Computers & Operations Research, 2013, 40(1): 344\u2013352. DOI: https:\/\/doi.org\/10.1016\/j.cor.2012.07.004.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"2007_CR15","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10951-011-0242-0","volume":"15","author":"S Tanaka","year":"2012","unstructured":"Tanaka S, Fujikuma S. A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time. Journal of Scheduling, 2012, 15(3): 347\u2013361. DOI: https:\/\/doi.org\/10.1007\/s10951-011-0242-0.","journal-title":"Journal of Scheduling"},{"issue":"2\/3","key":"2007_CR16","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0166-218X(90)90103-J","volume":"26","author":"T S Abdul-Razaq","year":"1990","unstructured":"Abdul-Razaq T S, Potts C N, Van Wassenhove L N. A survey of algorithms for the single machine total weighted tardiness scheduling problem. Discrete Applied Mathematics, 1990, 26(2\/3): 235\u2013253. DOI: https:\/\/doi.org\/10.1016\/0166-218x(90)90103-j.","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"2007_CR17","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1287\/opre.33.2.363","volume":"33","author":"C N Potts","year":"1985","unstructured":"Potts C N, Van Wassenhove L N. A branch and bound algorithm for the total weighted tardiness problem. Operations Research, 1985, 33(2): 363\u2013377. DOI: https:\/\/doi.org\/10.1287\/opre.33.2.363.","journal-title":"Operations Research"},{"issue":"3","key":"2007_CR18","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/S0377-2217(87)80008-5","volume":"32","author":"C N Potts","year":"1987","unstructured":"Potts C N, Van Wassenhove L N. Dynamic programming and decomposition approaches for the single machine total tardiness problem. European Journal of Operational Research, 1987, 32(3): 405\u2013414. DOI: https:\/\/doi.org\/10.1016\/s0377-2217(87)80008-5.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2007_CR19","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1016\/j.amc.2006.05.127","volume":"183","author":"X C Luo","year":"2006","unstructured":"Luo X C, Chu F. A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness. Applied Mathematics and Computation, 2006, 183(1): 575\u2013588. DOI: https:\/\/doi.org\/10.1016\/j.amc.2006.05.127.","journal-title":"Applied Mathematics and Computation"},{"issue":"4","key":"2007_CR20","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/j.disopt.2008.04.001","volume":"5","author":"L P Bigras","year":"2008","unstructured":"Bigras L P, Gamache M, Savard G. The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times. Discrete Optimization, 2008, 5(4): 685\u2013699. DOI: https:\/\/doi.org\/10.1016\/j.disopt.2008.04.001.","journal-title":"Discrete Optimization"},{"issue":"8","key":"2007_CR21","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1287\/mnsc.33.8.1035","volume":"33","author":"A P J Vepsalainen","year":"1987","unstructured":"Vepsalainen A P J, Morton T E. Priority rules for job shops with weighted tardiness costs. Management Science, 1987, 33(8): 1035\u20131047. DOI: https:\/\/doi.org\/10.1287\/mnsc.33.8.1035.","journal-title":"Management Science"},{"issue":"1","key":"2007_CR22","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1080\/07408179708966311","volume":"29","author":"Y H Lee","year":"1997","unstructured":"Lee Y H, Bhaskaran K, Pinedo M. A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Trans., 1997, 29(1): 45\u201352. DOI: https:\/\/doi.org\/10.1080\/07408179708966311.","journal-title":"IIE Trans."},{"issue":"6","key":"2007_CR23","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1016\/S0305-0483(97)00024-8","volume":"25","author":"K C Tan","year":"1997","unstructured":"Tan K C, Narasimhan R. Minimizing tardiness on a single processor with sequence-dependent setup times: A simulated annealing approach. Omega, 1997, 25(6): 619\u2013634. DOI: https:\/\/doi.org\/10.1016\/s0305-0483(97)00024-8.","journal-title":"Omega"},{"issue":"7","key":"2007_CR24","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1080\/095372800432188","volume":"11","author":"V A Armentano","year":"2000","unstructured":"Armentano V A, Mazzini R. A genetic algorithm for scheduling on a single machine with set-up times and due dates. Production Planning & Control, 2000, 11(7): 713\u2013720. DOI: https:\/\/doi.org\/10.1080\/095372800432188.","journal-title":"Production Planning & Control"},{"issue":"1","key":"2007_CR25","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/S0377-2217(00)00140-5","volume":"132","author":"P M Franca","year":"2001","unstructured":"Franca P M, Mendes A, Moscato P. A memetic algorithm for the total tardiness single machine scheduling problem. European Journal of Operational Research, 2001, 132(1): 224\u2013242. DOI: https:\/\/doi.org\/10.1016\/s0377-2217(00)00140-5.","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"2007_CR26","doi-asserted-by":"publisher","first-page":"1899","DOI":"10.1016\/j.cor.2005.07.020","volume":"34","author":"C J Liao","year":"2007","unstructured":"Liao C J, Juan H C. An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups. Computers & Operations Research, 2007, 34(7): 1899\u20131909. DOI: https:\/\/doi.org\/10.1016\/j.cor.2005.07.020.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"2007_CR27","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1016\/j.ejor.2005.05.018","volume":"175","author":"S R Gupta","year":"2006","unstructured":"Gupta S R, Smith J S. Algorithms for single machine total tardiness scheduling with sequence dependent setups. European Journal of Operational Research, 2006, 175(2): 722\u2013739. DOI: https:\/\/doi.org\/10.1016\/j.ejor.2005.05.018.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"2007_CR28","doi-asserted-by":"publisher","first-page":"7087","DOI":"10.1016\/j.eswa.2008.08.033","volume":"36","author":"K C Ying","year":"2009","unstructured":"Ying K C, Lin S W, Huang C Y. Sequencing single-machine tardiness problems with sequence dependent setup times using an iterated greedy heuristic. Expert Systems with Applications, 2009, 36(3): 7087\u20137092. DOI: https:\/\/doi.org\/10.1016\/j.eswa.2008.08.033.","journal-title":"Expert Systems with Applications"},{"key":"2007_CR29","doi-asserted-by":"publisher","unstructured":"Tasgetiren M F, Sevkli M, Liang Y C, Gen\u00e7yilmaz G. Particle swarm optimization algorithm for single machine total weighted tardiness problem. In Proc. the 2004 Congress on Evolutionary Computation, Jun. 2004, pp.1412\u20131419. DOI: https:\/\/doi.org\/10.1109\/cec.2004.1331062.","DOI":"10.1109\/cec.2004.1331062"},{"issue":"22","key":"2007_CR30","doi-asserted-by":"publisher","first-page":"4737","DOI":"10.1080\/00207540600620849","volume":"44","author":"M Fatih Tasgetiren","year":"2006","unstructured":"Fatih Tasgetiren M, Liang Y C, Sevkli M, Gencyilmaz G. Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem. International Journal of Production Research, 2006, 44(22): 4737\u20134754. DOI: https:\/\/doi.org\/10.1080\/00207540600620849.","journal-title":"International Journal of Production Research"},{"issue":"3","key":"2007_CR31","doi-asserted-by":"publisher","first-page":"1423","DOI":"10.1016\/j.ejor.2005.10.030","volume":"176","author":"\u00dc Bilge","year":"2007","unstructured":"Bilge \u00dc, Kurtulan M, Kira\u00e7 F. A tabu search algorithm for the single machine total weighted tardiness problem. European Journal of Operational Research, 2007, 176(3): 1423\u20131435. DOI: https:\/\/doi.org\/10.1016\/j.ejor.2005.10.030.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"2007_CR32","doi-asserted-by":"publisher","first-page":"3857","DOI":"10.1016\/j.eswa.2008.02.040","volume":"36","author":"F D Chou","year":"2009","unstructured":"Chou F D. An experienced learning genetic algorithm to solve the single machine total weighted tardiness scheduling problem. Expert Systems with Applications, 2009, 36(2): 3857\u20133865. DOI: https:\/\/doi.org\/10.1016\/j.eswa.2008.02.040.","journal-title":"Expert Systems with Applications"},{"issue":"6","key":"2007_CR33","doi-asserted-by":"publisher","first-page":"2105","DOI":"10.1016\/j.cor.2008.07.009","volume":"36","author":"X P Wang","year":"2009","unstructured":"Wang X P, Tang L X. A population-based variable neighborhood search for the single machine total weighted tardiness problem. Computers & Operations Research, 2009, 36(6): 2105\u20132110. DOI: https:\/\/doi.org\/10.1016\/j.cor.2008.07.009.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"2007_CR34","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10732-005-6997-8","volume":"11","author":"V A Cicirello","year":"2005","unstructured":"Cicirello V A, Smith S F. Enhancing stochastic search performance by value-biased randomization of heuristics. Journal of Heuristics, 2005, 11(1): 5\u201334. DOI: https:\/\/doi.org\/10.1007\/s10732-005-6997-8.","journal-title":"Journal of Heuristics"},{"key":"2007_CR35","doi-asserted-by":"publisher","unstructured":"Cicirello V A. Non-wrapping order crossover: An order preserving crossover operator that respects absolute position. In Proc. the 8th Annual Conference on Genetic and Evolutionary Computation, Jul. 2006, pp.1125\u20131132. DOI: https:\/\/doi.org\/10.1145\/1143997.1144177.","DOI":"10.1145\/1143997.1144177"},{"issue":"1","key":"2007_CR36","first-page":"44","volume":"5","author":"D Anghinolfi","year":"2008","unstructured":"Anghinolfi D, Paolucci M. A new ant colony optimization approach for the single machine total weighted tardiness scheduling problem. International Journal of Operations Research, 2008, 5(1): 44\u201360.","journal-title":"International Journal of Operations Research"},{"issue":"11\/12","key":"2007_CR37","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1007\/s00170-006-0693-1","volume":"34","author":"S W Lin","year":"2007","unstructured":"Lin S W, Ying K C. Solving single-machine total weighted tardiness problems with sequence-dependent setup times by meta-heuristics. The International Journal of Advanced Manufacturing Technology, 2007, 34(11\/12): 1183\u20131190. DOI: https:\/\/doi.org\/10.1007\/s00170-006-0693-1.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"7","key":"2007_CR38","doi-asserted-by":"publisher","first-page":"2388","DOI":"10.1016\/j.cor.2006.11.004","volume":"35","author":"J M S Valente","year":"2008","unstructured":"Valente J M S, Alves R A F S. Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups. Computers & Operations Research, 2008, 35(7): 2388\u20132405. DOI: https:\/\/doi.org\/10.1016\/j.cor.2006.11.004.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"2007_CR39","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.ejor.2007.10.044","volume":"193","author":"D Anghinolfi","year":"2009","unstructured":"Anghinolfi D, Paolucci M. A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times. European Journal of Operational Research, 2009, 193(1): 73\u201385. DOI: https:\/\/doi.org\/10.1016\/j.ejor.2007.10.044.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"2007_CR40","doi-asserted-by":"publisher","first-page":"1900","DOI":"10.1016\/j.cor.2008.06.007","volume":"36","author":"M F Tasgetiren","year":"2009","unstructured":"Tasgetiren M F, Pan Q K, Liang Y C. A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times. Computers & Operations Research, 2009, 36(6): 1900\u20131915. DOI: https:\/\/doi.org\/10.1016\/j.cor.2008.06.007.","journal-title":"Computers & Operations Research"},{"issue":"7","key":"2007_CR41","doi-asserted-by":"publisher","first-page":"1506","DOI":"10.1016\/j.cor.2011.08.022","volume":"39","author":"G Kirlik","year":"2012","unstructured":"Kirlik G, Oguz C. A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine. Computers & Operations Research, 2012, 39(7): 1506\u20131520. DOI: https:\/\/doi.org\/10.1016\/j.cor.2011.08.022.","journal-title":"Computers & Operations Research"},{"issue":"9","key":"2007_CR42","doi-asserted-by":"publisher","first-page":"2729","DOI":"10.1080\/00207543.2014.883472","volume":"52","author":"A Subramanian","year":"2014","unstructured":"Subramanian A, Battarra M, Potts C N. An iterated local search heuristic for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times. International Journal of Production Research, 2014, 52(9): 2729\u20132742. DOI: https:\/\/doi.org\/10.1080\/00207543.2014.883472.","journal-title":"International Journal of Production Research"},{"issue":"1","key":"2007_CR43","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10852-005-9032-z","volume":"5","author":"L Di Gaspero","year":"2006","unstructured":"Di Gaspero L, Schaerf A. Neighborhood portfolio approach for local search applied to timetabling problems. Journal of Mathematical Modelling and Algorithms, 2006, 5(1): 65\u201389. DOI: https:\/\/doi.org\/10.1007\/s10852-005-9032-z.","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"issue":"2","key":"2007_CR44","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0272-6963(84)90027-5","volume":"4","author":"F Glover","year":"1984","unstructured":"Glover F, McMillan C, Glover R. A heuristic programming approach to the employee scheduling problem and some thoughts on \u201cmanagerial robots\u201d. Journal of Operations Management, 1984,4(2): 113\u2013128. DOI: https:\/\/doi.org\/10.1016\/0272-6963(84)90027-5.","journal-title":"Journal of Operations Management"},{"issue":"1","key":"2007_CR45","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0305-0548(93)E0021-K","volume":"22","author":"P A Rubin","year":"1995","unstructured":"Rubin P A, Ragatz G L. Scheduling in a sequence dependent setup environment with genetic search. Computers & Operations Research, 1995, 22(1): 85\u201399. DOI: https:\/\/doi.org\/10.1016\/0305-0548(93)e0021-k.","journal-title":"Computers & Operations Research"},{"issue":"8","key":"2007_CR46","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1057\/palgrave.jors.2601390","volume":"53","author":"C Gagn\u00e9","year":"2002","unstructured":"Gagn\u00e9 C, Price W L, Gravel M. Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times. Journal of the Operational Research Society, 2002, 53(8): 895\u2013906. DOI: https:\/\/doi.org\/10.1057\/palgrave.jors.2601390.","journal-title":"Journal of the Operational Research Society"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-023-2007-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11390-023-2007-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-023-2007-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T09:10:20Z","timestamp":1721639420000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11390-023-2007-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["2007"],"URL":"https:\/\/doi.org\/10.1007\/s11390-023-2007-6","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5]]},"assertion":[{"value":"31 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 April 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"<b>Conflict of Interest<\/b> The authors declare that they have no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics"}}]}}