{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T01:34:02Z","timestamp":1791250442981,"version":"4.1.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2011,7,1]],"date-time":"2011-07-01T00:00:00Z","timestamp":1309478400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1007\/s10472-011-9264-8","type":"journal-article","created":{"date-parts":[[2011,8,12]],"date-time":"2011-08-12T08:35:30Z","timestamp":1313138130000},"page":"371-402","source":"Crossref","is-referenced-by-count":7,"title":["Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis"],"prefix":"10.1007","volume":"62","author":[{"given":"Angelo","family":"Oddi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Riccardo","family":"Rasconi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amedeo","family":"Cesta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephen F.","family":"Smith","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2011,8,13]]},"reference":[{"issue":"3","key":"9264_CR1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J Adams","year":"1988","unstructured":"Adams, J., Balas, E., Zawack, D.: The shifting bottleneck procedure for job shop scheduling. Manage. Sci. 34(3), 391\u2013401 (1988)","journal-title":"Manage. Sci."},{"issue":"3","key":"9264_CR2","doi-asserted-by":"crossref","first-page":"978","DOI":"10.1016\/j.ejor.2006.09.010","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi, A., Soroush, H.: The significance of reducing setup times\/setup costs. Eur. J. Oper. Res. 187(3), 978\u2013984 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9264_CR3","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi, A., Ng, C., Cheng, T., Kovalyov, M.: A survey of scheduling problems with setup times or costs. Eur. J. Oper. Res. 187(3), 985\u20131032 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9264_CR4","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s10479-007-0283-0","volume":"159","author":"C Artigues","year":"2008","unstructured":"Artigues, C., Feillet, D.: A branch and bound method for the job-shop problem with sequence-dependent setup times. Ann. Oper. Res. 159(1), 135\u2013159 (2008)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"9264_CR5","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s10951-008-0067-7","volume":"11","author":"E Balas","year":"2008","unstructured":"Balas, E., Simonetti, N., Vazacopoulos, A.: Job shop scheduling with setup times, deadlines and precedence constraints. J. Sched. 11(4), 253\u2013262 (2008)","journal-title":"J. Sched."},{"key":"9264_CR6","unstructured":"Birattari, M.: Race: Racing methods for the selection of the best. http:\/\/CRAN.R-project.org\/package=race , R package version 0.1.58 (2010)"},{"key":"9264_CR7","unstructured":"Birattari, M., St\u00fctzle, T., Paquete, L., Varrentrapp, K.,: A racing algorithm for configuring metaheuristics. In: GECCO, pp. 11\u201318 2002"},{"issue":"1\u20133","key":"9264_CR8","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0166-218X(94)90204-6","volume":"49","author":"P Brucker","year":"1994","unstructured":"Brucker, P., Jurisch, B., Sievers, B.: A branch and bound algorithm for the job-shop scheduling problem. Discrete Appl. Math. 49(1\u20133), 107\u2013127 (1994)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"9264_CR9","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01539706","volume":"18","author":"P Brucker","year":"1996","unstructured":"Brucker, P., Thiele, O.: A branch & bound method for the general-shop problem with sequence dependent setup-times. OR Spectrum 18(3), 145\u2013161 (1996)","journal-title":"OR Spectrum"},{"key":"9264_CR10","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"P Brucker","year":"1977","unstructured":"Brucker, P., Lenstra, J., Kan, A.R.: Complexity of machine scheduling problems. Ann. Discrete Math. 1, 343\u2013362 (1977)","journal-title":"Ann. Discrete Math."},{"key":"9264_CR11","unstructured":"Cambazard, H., Hebrard, E., Barry, O., Papadopoulos, A.: Local search and constraint programming for the post-enrolment-based course timetabling problem. In: PATAT \u201908\u2014Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling (2008)"},{"issue":"1","key":"9264_CR12","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/A:1013617802515","volume":"8","author":"A Cesta","year":"2002","unstructured":"Cesta, A., Oddi, A., Smith, S.F.: A constraint-based method for project scheduling with time windows. J. Heuristics 8(1), 109\u2013136 (2002)","journal-title":"J. Heuristics"},{"key":"9264_CR13","unstructured":"Cheng, C., Smith, S.: Generating feasible schedules under complex metric constraints. In: Proceedings 12th National Conference on AI (AAAI-94) (1994)"},{"key":"9264_CR14","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R Dechter","year":"1991","unstructured":"Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artif. Intell. 49, 61\u201395 (1991)","journal-title":"Artif. Intell."},{"issue":"1","key":"9264_CR15","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0377-2217(97)00019-2","volume":"109","author":"E Demirkol","year":"1998","unstructured":"Demirkol, E., Mehta, S., Uzsoy, R.: Benchmarks for shop scheduling problems. Eur. J. Oper. Res. 109(1), 137\u2013141 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"9264_CR16","unstructured":"Focacci, F., Laborie, P., Nuijten, W.: Solving scheduling problems with setup times and alternative resources. In: AIPS, pp. 92\u2013111 (2000)"},{"key":"9264_CR17","doi-asserted-by":"crossref","unstructured":"Gonz\u00e1lez, M.A., Vela, C.R., Varela, R.: A Tabu search algorithm to minimize lateness in scheduling problems with setup times. In: Proceedings of the CAEPIA-TTIA 2009 13th Conference of the Spanish Association on Artificial Intellegence (2009)","DOI":"10.1007\/978-3-642-14264-2_22"},{"key":"9264_CR18","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","volume":"7","author":"U Montanari","year":"1974","unstructured":"Montanari, U.: Networks of constraints: fundamental properties and applications to picture processing. Inf. Sci. 7, 95\u2013132 (1974)","journal-title":"Inf. Sci."},{"issue":"2","key":"9264_CR19","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10951-005-6364-5","volume":"8","author":"E Nowicki","year":"2005","unstructured":"Nowicki, E., Smutnicki, C.: An advanced tabu search algorithm for the job shop problem. J. Sched. 8(2), 145\u2013159 (2005)","journal-title":"J. Sched."},{"key":"9264_CR20","unstructured":"Oddi, A., Smith, S.: Stochastic procedures for generating feasible schedules. In: Proceedings 14th National Conference on AI (AAAI-97), pp. 308\u2013314 (1997)"},{"issue":"2","key":"9264_CR21","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0278-6125(94)90023-X","volume":"13","author":"I Ovacik","year":"1994","unstructured":"Ovacik, I., Uzsoy, R.: Exploiting shop floor status information to schedule complex job shops. J. Manuf. Syst. 13(2), 73\u201384 (1994)","journal-title":"J. Manuf. Syst."},{"key":"9264_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6329-7","volume-title":"Decomposition Methods for Complex Factory Scheduling Problems","author":"I Ovacik","year":"1997","unstructured":"Ovacik, I., Uzsoy, R.: Decomposition Methods for Complex Factory Scheduling Problems. Kluwer Academic, Dordrecht (1997)"},{"issue":"3","key":"9264_CR23","first-page":"163","volume":"20","author":"N Policella","year":"2007","unstructured":"Policella, N., Cesta, A., Oddi, A., Smith, S.: From precedence constraint posting to partial order schedules. AI Commun. 20(3), 163\u2013180 (2007)","journal-title":"AI Commun."},{"key":"9264_CR24","unstructured":"R Development Core Team (2010) R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria, http:\/\/www.R-project.org\/ . ISBN 3-900051-07-0 (2010)"},{"issue":"3","key":"9264_CR25","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0166-218X(93)E0169-Y","volume":"59","author":"YN Sotskov","year":"1995","unstructured":"Sotskov, Y.N., Shakhlevich, N.V.: Np-hardness of shop-scheduling problems with three jobs. Discrete Appl. Math. 59(3), 237\u2013266 (1995). doi: 10.1016\/0166-218X(93)E0169-Y","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"9264_CR26","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s10732-008-9094-y","volume":"16","author":"CR Vela","year":"2008","unstructured":"Vela, C.R., Varela, R., Gonz\u00e1lez, MA.: Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times. J. Heuristics 16(2):139\u2013165 (2008). http:\/\/www.springerlink.com\/index\/10.1007\/s10732-008-9094-y","journal-title":"J. Heuristics"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-011-9264-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-011-9264-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-011-9264-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T08:09:00Z","timestamp":1638259740000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-011-9264-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":26,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["9264"],"URL":"https:\/\/doi.org\/10.1007\/s10472-011-9264-8","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7]]}}}