{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T14:10:44Z","timestamp":1744207844923,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T00:00:00Z","timestamp":1635552000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T00:00:00Z","timestamp":1635552000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10878-021-00809-y","type":"journal-article","created":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T13:02:38Z","timestamp":1635598958000},"page":"223-241","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A variable neighborhood search algorithm for human resource selection and optimization problem in the home appliance manufacturing industry"],"prefix":"10.1007","volume":"44","author":[{"given":"Xing","family":"Ji","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1009-1842","authenticated-orcid":false,"given":"Baoyu","family":"Liao","sequence":"additional","affiliation":[]},{"given":"Shanlin","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,30]]},"reference":[{"key":"809_CR1","doi-asserted-by":"publisher","first-page":"105162","DOI":"10.1016\/j.cor.2020.105162","volume":"128","author":"V Abu-Marrul","year":"2020","unstructured":"Abu-Marrul V, Martinelli R, Hamacher S, Gribkovskaia I (2020) Matheuristics for a parallel machine scheduling problem with non-anticipatory family setup times: application in the offshore oil and gas industry. Comput Oper Res 128:105162","journal-title":"Comput Oper Res"},{"issue":"7","key":"809_CR2","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1142\/S0218194019400072","volume":"29","author":"H Chen","year":"2019","unstructured":"Chen H, Zhao Y, Ji Y, Wang S, Ge W, Su A (2019) Optimization location selection analysis of energy storage unit in energy internet system based on tabu search. Int J Softw Eng Knowl Eng 29(7):941\u2013954","journal-title":"Int J Softw Eng Knowl Eng"},{"issue":"1\u20134","key":"809_CR3","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1023\/A:1019216726076","volume":"98","author":"T Cheng","year":"2000","unstructured":"Cheng T, Wang G (2000) Single machine scheduling with learning effect considerations. Ann Oper Res 98(1\u20134):273\u2013290","journal-title":"Ann Oper Res"},{"issue":"1","key":"809_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0207001","volume":"7","author":"EG Coffman","year":"1978","unstructured":"Coffman EG, Garey MR, Johnson DS (1978) An application of bin-packing to multiprocessor scheduling. SIAM J Comput 7(1):1\u201317","journal-title":"SIAM J Comput"},{"key":"809_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106545","author":"A Costa","year":"2020","unstructured":"Costa A, Fernandez-Viagas V, Framinan JM (2020) Solving the hybrid flow shop scheduling problem with limited human resource constraint. Comput Ind Eng. https:\/\/doi.org\/10.1016\/j.cie.2020.106545","journal-title":"Comput Ind Eng"},{"key":"809_CR6","doi-asserted-by":"publisher","DOI":"10.1201\/9781003202653","volume-title":"Metaheuristics for resource deployment under uncertainty in complex systems","author":"S Ding","year":"2021","unstructured":"Ding S, Chen C, Zhang Q, Xin B, Pardalos PM (2021) Metaheuristics for resource deployment under uncertainty in complex systems. CRC Press, Boca Raton"},{"key":"809_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2008.12.005","volume-title":"A fuzzy-mixed-integer goal programming model for a parallel-machine scheduling problem with sequence-dependent setup times and release dates","author":"AH Gharehgozli","year":"2009","unstructured":"Gharehgozli AH, Tavakkoli-Moghaddam R, Zaerpour N (2009) A fuzzy-mixed-integer goal programming model for a parallel-machine scheduling problem with sequence-dependent setup times and release dates. Pergamon Press, Inc., Oxford"},{"issue":"2","key":"809_CR8","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1002\/nav.3800330209","volume":"33","author":"BL Golden","year":"2010","unstructured":"Golden BL, Skiscim CC (2010) Using simulated annealing to solve routing and location problems. Nav Res Logist Q 33(2):261\u2013279","journal-title":"Nav Res Logist Q"},{"issue":"1","key":"809_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Kan AHGR (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5(1):287\u2013326","journal-title":"Ann Discrete Math"},{"issue":"13","key":"809_CR10","doi-asserted-by":"publisher","first-page":"5019","DOI":"10.1007\/s00500-018-3165-2","volume":"23","author":"Y Guo","year":"2019","unstructured":"Guo Y, Ji J, Ji J, Gong D, Cheng J, Shen X (2019) Firework-based software project scheduling method considering the learning and forgetting effect. Soft Comput 23(13):5019\u20135034","journal-title":"Soft Comput"},{"key":"809_CR11","volume-title":"Inequalities","author":"GH Hardy","year":"1967","unstructured":"Hardy GH, Littlewood JE, Polya G (1967) Inequalities. Cambridge University Press, London"},{"issue":"3","key":"809_CR12","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1016\/j.ejor.2007.08.048","volume":"195","author":"VC Hemmelmayr","year":"2009","unstructured":"Hemmelmayr VC, Doerner KF, Hartl RF (2009) A variable neighborhood search heuristic for periodic routing problems. Eur J Oper Res 195(3):791\u2013802","journal-title":"Eur J Oper Res"},{"issue":"1\u20134","key":"809_CR13","first-page":"49","volume":"166","author":"P Jin","year":"2004","unstructured":"Jin P, Liu B (2004) Parallel machine scheduling models with fuzzy processing times. Inf Sci 166(1\u20134):49\u201366","journal-title":"Inf Sci"},{"key":"809_CR14","doi-asserted-by":"publisher","first-page":"107286","DOI":"10.1016\/j.cie.2021.107286","volume":"156","author":"M Kong","year":"2021","unstructured":"Kong M, Xu J, Zhang T, Lu S, Fang C, Mladenovic N (2021) Energy-efficient rescheduling with time-of-use energy cost: application of variable neighborhood search algorithm. Comput Ind Eng 156:107286","journal-title":"Comput Ind Eng"},{"issue":"3","key":"809_CR15","first-page":"546","volume":"13","author":"D Kurniawan","year":"2020","unstructured":"Kurniawan D, Raja AC, Suprayogi S, Halim AH (2020) A flow shop batch scheduling and operator assignment model with time-changing effects of learning and forgetting to minimize total actual flow time. J Ind Eng Manag 13(3):546","journal-title":"J Ind Eng Manag"},{"issue":"99","key":"809_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TSMC.2018.2841063","volume":"PP","author":"X Li","year":"2018","unstructured":"Li X, Jiang Y, Ruiz R (2018) Methods for scheduling problems considering experience, learning, and forgetting effects. IEEE Trans Syst Man Cybern Syst PP(99):1\u201312","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"809_CR17","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.asoc.2018.02.018","volume":"66","author":"S Lu","year":"2018","unstructured":"Lu S, Liu X, Pei J, Thai MT, Pardalos PM (2018) A hybrid ABC-TS algorithm for the unrelated parallel-batching machines scheduling problem with deteriorating jobs and maintenance activity. Appl Soft Comput 66:168\u2013182","journal-title":"Appl Soft Comput"},{"issue":"11","key":"809_CR18","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovic","year":"1997","unstructured":"Mladenovic N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11):1097\u20131100","journal-title":"Comput Oper Res"},{"issue":"3","key":"809_CR19","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1016\/S0377-2217(00)00175-2","volume":"132","author":"G Mosheiov","year":"2001","unstructured":"Mosheiov G (2001) Scheduling problems with a learning effect. Eur J Oper Res 132(3):687\u2013693","journal-title":"Eur J Oper Res"},{"key":"809_CR20","first-page":"1","volume":"15","author":"S Mutu","year":"2020","unstructured":"Mutu S, Eren T (2020) The single machine scheduling problem with setup times under an extension of the general learning and forgetting effects. Optim Lett 15:1\u201317","journal-title":"Optim Lett"},{"key":"809_CR21","doi-asserted-by":"publisher","first-page":"106736","DOI":"10.1016\/j.asoc.2020.106736","volume":"98","author":"M Ranjbar","year":"2021","unstructured":"Ranjbar M, Saber RG (2021) A variable neighborhood search algorithm for transshipment scheduling of multi products at a single station. Appl Soft Comput J 98:106736","journal-title":"Appl Soft Comput J"},{"issue":"3","key":"809_CR22","doi-asserted-by":"publisher","first-page":"2015","DOI":"10.1007\/s00500-020-05272-1","volume":"25","author":"O Roeva","year":"2021","unstructured":"Roeva O, Zoteva D, Castillo O (2021) Joint set-up of parameters in genetic algorithms and the artificial bee colony algorithm: an approach for cultivation process modelling. Soft Comput 25(3):2015\u20132038","journal-title":"Soft Comput"},{"issue":"3","key":"809_CR23","first-page":"617","volume":"2","author":"M Taghi","year":"2011","unstructured":"Taghi M, Javanshir H, Roueintan MA, Soleimany E (2011) Multi-objective group scheduling with learning effect in the cellular manufacturing system. Int J Ind Eng Comput 2(3):617\u2013630","journal-title":"Int J Ind Eng Comput"},{"issue":"4","key":"809_CR24","doi-asserted-by":"publisher","first-page":"2364","DOI":"10.1016\/j.apm.2012.05.029","volume":"37","author":"JB Wang","year":"2013","unstructured":"Wang JB, Wang JJ (2013) Scheduling tasks with a general learning effect model. Appl Math Model 37(4):2364\u20132373","journal-title":"Appl Math Model"},{"issue":"4","key":"809_CR25","doi-asserted-by":"publisher","first-page":"122","DOI":"10.2514\/8.155","volume":"3","author":"TP Wright","year":"1936","unstructured":"Wright TP (1936) Factors affecting the cost of airplanes. J Aeronaut Sci 3(4):122\u2013128","journal-title":"J Aeronaut Sci"},{"issue":"3","key":"809_CR26","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1016\/j.ejor.2006.03.065","volume":"187","author":"WH Yang","year":"2008","unstructured":"Yang WH, Chand S (2008) Learning and forgetting effects on a group scheduling problem. Eur J Oper Res 187(3):1033\u20131044","journal-title":"Eur J Oper Res"},{"issue":"3","key":"809_CR27","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1016\/j.cie.2011.05.009","volume":"61","author":"C Zhao","year":"2011","unstructured":"Zhao C, Min J, Tang H (2011) Parallel-machine scheduling with an availability constraint. Comput Ind Eng 61(3):778\u2013781","journal-title":"Comput Ind Eng"},{"issue":"7","key":"809_CR28","doi-asserted-by":"publisher","first-page":"598","DOI":"10.3390\/math7070598","volume":"7","author":"Z Zuo","year":"2019","unstructured":"Zuo Z, Li Y, Fu J, Wu J (2019) Human resource scheduling model and algorithm with time windows and multi-skill constraints. Mathematics 7(7):598","journal-title":"Mathematics"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00809-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00809-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00809-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T07:28:42Z","timestamp":1659079722000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00809-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,30]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["809"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00809-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2021,10,30]]},"assertion":[{"value":"11 September 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}