{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T17:01:41Z","timestamp":1778605301562,"version":"3.51.4"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2011,3,5]],"date-time":"2011-03-05T00:00:00Z","timestamp":1299283200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Manuf"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s10845-011-0522-8","type":"journal-article","created":{"date-parts":[[2011,3,5]],"date-time":"2011-03-05T15:21:00Z","timestamp":1299338460000},"page":"1949-1958","source":"Crossref","is-referenced-by-count":25,"title":["A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times"],"prefix":"10.1007","volume":"23","author":[{"given":"Krzysztof","family":"Fleszar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoforos","family":"Charalambous","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khalil S.","family":"Hindi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,3,5]]},"reference":[{"key":"522_CR1","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"R. K. Ahuja","year":"2002","unstructured":"Ahuja R. K., Ergun O., Orlin J. B., Punnen A. P. (2002) A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics 123: 75\u2013102","journal-title":"Discrete Applied Mathematics"},{"key":"522_CR2","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s101070100234","volume":"91","author":"R. K. Ahuja","year":"2001","unstructured":"Ahuja R. K., Orlin J. B., Sharma D. (2001) New neighborhood search structures for the capacitated minimum spanning tree problem. Mathematical Programming 91: 71\u201397","journal-title":"Mathematical Programming"},{"key":"522_CR3","first-page":"177","volume":"17","author":"A. Al-Salem","year":"2004","unstructured":"Al-Salem A. (2004) Scheduling to minimize makespan on unrelated parallel machines with sequence dependent setup times. Engineering Journal of the University of Qatar 17: 177\u2013187","journal-title":"Engineering Journal of the University of Qatar"},{"issue":"1","key":"522_CR4","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/trsc.1070.0204","volume":"42","author":"C. Archetti","year":"2008","unstructured":"Archetti C., Speranza M. G., Savelsbergh M. W. P. (2008) An optimization-based heuristic for the split delivery vehicle routing problem. Transportation Science 42(1): 22\u201331","journal-title":"Transportation Science"},{"issue":"6","key":"522_CR5","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1007\/s10845-009-0246-1","volume":"21","author":"J. P. Arnaout","year":"2010","unstructured":"Arnaout J. P., Rabadi G., Musa R. (2010) A two-stage ant colony optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times. Journal of Intelligent Manufacturing 21(6): 693\u2013701","journal-title":"Journal of Intelligent Manufacturing"},{"key":"522_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03217-6","volume-title":"Scheduling computer and manufacturing processes","author":"J. Blazewicz","year":"1996","unstructured":"Blazewicz J., Ecker K. H., Pesch E., Schmidt G., Weglarz J. (1996) Scheduling computer and manufacturing processes. Springer, Berlin"},{"key":"522_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24804-0","volume-title":"Scheduling algorithms","author":"P. Brucker","year":"2004","unstructured":"Brucker P. (2004) Scheduling algorithms. Springer, Berlin"},{"issue":"2\u20133","key":"522_CR8","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10107-005-0662-8","volume":"105","author":"R. De Franceschi","year":"2006","unstructured":"De Franceschi R., Fischetti M., Toth P. (2006) A new ILP-based refinement heuristic for vehicle routing problems. Mathematical Programming 105(2\u20133): 471\u2013499","journal-title":"Mathematical Programming"},{"issue":"1\u20132","key":"522_CR9","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10732-006-5561-5","volume":"12","author":"\u00d6. Ergun","year":"2006","unstructured":"Ergun \u00d6., Orlin J. B., Steele-Feldman A. (2006) Creating very large scale neighborhoods out of smaller ones by compounding moves. Journal of Heuristics 12(1\u20132): 115\u2013140","journal-title":"Journal of Heuristics"},{"issue":"3","key":"522_CR10","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1287\/trsc.1070.0227","volume":"42","author":"D. Espinoza","year":"2008","unstructured":"Espinoza D., Garcia R., Goycoolea M., Nemhauser G.L., Savelsbergh M.W.P. (2008) Per-seat, on-demand air transportation part I: problem description and an integer multicommodity flow model. Transportation Science 42(3): 263\u2013278","journal-title":"Transportation Science"},{"issue":"3","key":"522_CR11","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1016\/j.ejor.2006.12.055","volume":"191","author":"K. Fleszar","year":"2008","unstructured":"Fleszar K., Hindi K.S. (2008) An effective VNS for the capacitated p-median problem. European Journal of Operational Research 191(3): 612\u2013622","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"522_CR12","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1016\/j.cor.2008.03.003","volume":"36","author":"K. Fleszar","year":"2009","unstructured":"Fleszar K., Hindi K.S. (2009) Fast, effective heuristics for the 0\u20131 multi-dimensional knapsack problem. Computers and Operations Research 36(5): 1602\u20131607","journal-title":"Computers and Operations Research"},{"key":"522_CR13","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1023\/B:JOCO.0000031420.05971.29","volume":"8","author":"A. Frangioni","year":"2004","unstructured":"Frangioni A., Necciari E., Scutella M. G. (2004) A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems. Journal of Combinatorial Optimization 8: 195\u2013220","journal-title":"Journal of Combinatorial Optimization"},{"issue":"2","key":"522_CR14","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/j.ejor.2004.04.015","volume":"165","author":"M. Ghirardi","year":"2005","unstructured":"Ghirardi M., Potts C. N. (2005) Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach. European Journal of Operational Research 165(2): 457\u2013467","journal-title":"European Journal of Operational Research"},{"key":"522_CR15","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1016\/S0377-2217(99)00468-3","volume":"129","author":"F. Glover","year":"2001","unstructured":"Glover F., Gutin G., Yeo A., Zverovich A. (2001) Construction heuristics for the asymmetric TSP. European Journal of Operational Research 129: 555\u2013568","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"522_CR16","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1023\/A:1011336210885","volume":"7","author":"P. Hansen","year":"2001","unstructured":"Hansen P., Mladenovi\u0107 M., Perez-Britos D. (2001) Variable neighborhood decomposition search. Journal of Heuristics 7(4): 335\u2013350","journal-title":"Journal of Heuristics"},{"issue":"3","key":"522_CR17","first-page":"182","volume":"3","author":"M. Helal","year":"2006","unstructured":"Helal M., Rabadi G., Al-Salem A. (2006) A tabu search algorithm to minimize the makespan for the unrelated parallel machines scheduling problem with setup times. International Journal of Operations Research 3(3): 182\u2013192","journal-title":"International Journal of Operations Research"},{"key":"522_CR18","unstructured":"Hoogeveen, J., Lenstra, J. K., & van de Velde, S. L (1997). Sequencing and scheduling: An annotated bibliography. Eindhoven University of Technology, Department of Mathematics and Computing Science."},{"key":"522_CR19","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF02278710","volume":"38","author":"R. Jonker","year":"1987","unstructured":"Jonker R., Volgenant A. (1987) A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing 38: 325\u2013340","journal-title":"Computing"},{"key":"522_CR20","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0736-5845(02)00077-7","volume":"19","author":"D.-W. Kim","year":"2003","unstructured":"Kim D.-W., Na D.-G., Chen F. F. (2003) Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective. Robotics and Computer Integrated Manufacturing 19: 173\u2013181","journal-title":"Robotics and Computer Integrated Manufacturing"},{"key":"522_CR21","unstructured":"Lee, C-Y., & Pinedo, M. (2002). Optimization and heuristics of scheduling. In P.M. Pardalos, & M.G.C. Resende, Handbook of applied optimization. New York: Oxford University Press."},{"key":"522_CR22","doi-asserted-by":"crossref","first-page":"1777","DOI":"10.1016\/S0305-0548(02)00105-3","volume":"30","author":"C. F. Liaw","year":"2003","unstructured":"Liaw C. F., Lin Y. K., Chen C. Y., Chen M. (2003) Scheduling unrelated parallel machines to minimize total weighted tardiness. Computers and Operations Research 30: 1777\u20131789","journal-title":"Computers and Operations Research"},{"issue":"11","key":"522_CR23","doi-asserted-by":"crossref","first-page":"3420","DOI":"10.1016\/j.cor.2006.02.006","volume":"34","author":"R. Logendran","year":"2007","unstructured":"Logendran R., McDonell B., Smucker B. (2007) Scheduling unrelated parallel machines with sequence-dependent setups. Computers and Operations Research 34(11): 3420\u20133438","journal-title":"Computers and Operations Research"},{"key":"522_CR24","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0166-218X(96)00087-X","volume":"75","author":"S. Martello","year":"1997","unstructured":"Martello S., Soumis F., Toth P. (1997) Exact and approximation algorithms for makespan minimization on unrelated parallel machines. Discrete Applied Mathematics 75: 169\u2013188","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"522_CR25","first-page":"193","volume":"18","author":"E. Mokotoff","year":"2001","unstructured":"Mokotoff E. (2001) Parallel machine scheduling problems: A survey. Asia-Pacific Journal of Operational Research 18(2): 193\u2013242","journal-title":"Asia-Pacific Journal of Operational Research"},{"issue":"3","key":"522_CR26","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1016\/S0377-2217(01)00270-3","volume":"141","author":"E. Mokotoff","year":"2002","unstructured":"Mokotoff E., Chretienne P. (2002) A cutting plane algorithm for the unrelated parallel machine scheduling problem. European Journal of Operational Research 141(3): 515\u2013525","journal-title":"European Journal of Operational Research"},{"issue":"1\u20134","key":"522_CR27","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1023\/A:1021569406280","volume":"117","author":"E. Mokotoff","year":"2002","unstructured":"Mokotoff E., Jimeno J. L. (2002) Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem. Annals of Operations Research 117(1\u20134): 133\u2013150","journal-title":"Annals of Operations Research"},{"issue":"3","key":"522_CR28","doi-asserted-by":"crossref","first-page":"1508","DOI":"10.1016\/j.ejor.2005.11.001","volume":"176","author":"M. J. Pereira Lopes","year":"2007","unstructured":"Pereira Lopes M. J., de Carvalho J. M. V. (2007) A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times. European Journal of Operational Research 176(3): 1508\u20131527","journal-title":"European Journal of Operational Research"},{"key":"522_CR29","volume-title":"Scheduling: theory, algorithms, and systems","author":"M. Pinedo","year":"2002","unstructured":"Pinedo M. (2002) Scheduling: theory, algorithms, and systems. Prentice Hall, New Jersey"},{"key":"522_CR30","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10845-005-5514-0","volume":"17","author":"G. Rabadi","year":"2006","unstructured":"Rabadi G., Moraga R. J., Al-Salem A. (2006) Heuristics for the unrelated parallel machine scheduling problem with setup times. Journal of Intelligent Manufacturing 17: 85\u201397","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"4","key":"522_CR31","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1504\/IJOR.2007.014169","volume":"2","author":"M. G. Ravetti","year":"2007","unstructured":"Ravetti M. G., Mateus G. R., Rocha P. L., Pardalos P. M. (2007) A scheduling problem with unrelated parallel machines and sequence dependent setups. International Journal of Operational Research 2(4): 380\u2013399","journal-title":"International Journal of Operational Research"},{"issue":"4","key":"522_CR32","doi-asserted-by":"crossref","first-page":"1250","DOI":"10.1016\/j.cor.2006.07.015","volume":"35","author":"P. L. Rocha","year":"2008","unstructured":"Rocha P. L., Ravetti M. G., Mateus G. R., Pardalos P. M. (2008) Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times. Computers and Operations Research 35(4): 1250\u20131264","journal-title":"Computers and Operations Research"},{"issue":"6","key":"522_CR33","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1002\/nav.20157","volume":"53","author":"E. Shchepin","year":"2006","unstructured":"Shchepin E., Vakhania N. (2006) An absolute approximation algorithm for scheduling unrelated machines. Naval Research Logistics 53(6): 502\u2013507","journal-title":"Naval Research Logistics"},{"issue":"2","key":"522_CR34","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.orl.2004.05.004","volume":"33","author":"E. V. Shchepin","year":"2005","unstructured":"Shchepin E. V., Vakhania N. (2005) An optimal rounding gives a better approximation for scheduling unrelated machines. Operations Research Letters 33(2): 127\u2013133","journal-title":"Operations Research Letters"},{"key":"522_CR35","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0925-5273(00)00066-9","volume":"70","author":"M. Weng","year":"2001","unstructured":"Weng M., Lu J., Ren H. (2001) Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective. International Journal of Production Economics 70: 215\u2013226","journal-title":"International Journal of Production Economics"}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-011-0522-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10845-011-0522-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-011-0522-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:11:50Z","timestamp":1559254310000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10845-011-0522-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,5]]},"references-count":35,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["522"],"URL":"https:\/\/doi.org\/10.1007\/s10845-011-0522-8","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,5]]}}}