{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T06:24:08Z","timestamp":1779171848779,"version":"3.51.4"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,6,14]],"date-time":"2017-06-14T00:00:00Z","timestamp":1497398400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001711","name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","doi-asserted-by":"publisher","award":["P2FRP2_161720"],"award-info":[{"award-number":["P2FRP2_161720"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s10951-017-0532-2","type":"journal-article","created":{"date-parts":[[2017,6,14]],"date-time":"2017-06-14T10:45:08Z","timestamp":1497437108000},"page":"391-422","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["A neighborhood for complex job shop scheduling problems with regular objectives"],"prefix":"10.1007","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0349-4275","authenticated-orcid":false,"given":"Reinhard","family":"B\u00fcrgy","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,14]]},"reference":[{"issue":"2","key":"532_CR1","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D Applegate","year":"1991","unstructured":"Applegate, D., & Cook, W. (1991). A computational study of the job-shop scheduling problem. ORSA Journal on Computing, 3(2), 149\u2013156.","journal-title":"ORSA Journal on Computing"},{"issue":"4","key":"532_CR2","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. (2008). Job shop scheduling with setup times, deadlines and precedence constraints. Journal of Scheduling, 11(4), 253\u2013262.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"532_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0377-2217(95)00362-2","volume":"93","author":"J Blazewicz","year":"1996","unstructured":"Blazewicz, J., Domschke, W., & Pesch, E. (1996). The job shop scheduling problem: Conventional and new solution techniques. European Journal of Operational Research, 93(1), 1\u201333.","journal-title":"European Journal of Operational Research"},{"key":"532_CR4","volume-title":"Complex scheduling","author":"P Brucker","year":"2011","unstructured":"Brucker, P., & Knust, S. (2011). Complex scheduling (2nd ed.). Berlin: Springer.","edition":"2"},{"issue":"3","key":"532_CR5","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01539706","volume":"18","author":"P Brucker","year":"1996","unstructured":"Brucker, P., & Thiele, O. (1996). A branch and bound method for the general-shop problem with sequence dependent setup-times. OR Spectrum, 18(3), 145\u2013161.","journal-title":"OR Spectrum"},{"issue":"1","key":"532_CR6","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. (1994). A branch and bound algorithm for the job-shop scheduling problem. Discrete Applied Mathematics, 49(1), 107\u2013127.","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"532_CR7","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10951-012-0270-4","volume":"16","author":"K B\u00fclb\u00fcl","year":"2013","unstructured":"B\u00fclb\u00fcl, K., & Kaminsky, P. (2013). A linear programming-based method for job shop scheduling. Journal of Scheduling, 16(2), 161\u2013183.","journal-title":"Journal of Scheduling"},{"key":"532_CR8","unstructured":"B\u00fcrgy, R. (2014). Complex Job Shop Scheduling: A General Model and Method. PhD thesis, Department of Informatics, University of Fribourg."},{"issue":"1","key":"532_CR9","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s10878-014-9723-3","volume":"31","author":"R B\u00fcrgy","year":"2016","unstructured":"B\u00fcrgy, R., & Gr\u00f6flin, H. (2016). The blocking job shop with rail-bound transportation. Journal of Combinatorial Optimization, 31(1), 151\u2013181.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1","key":"532_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/00207546708929764","volume":"6","author":"S Eilon","year":"1967","unstructured":"Eilon, S., & Hodgson, R. (1967). Job shops scheduling with due dates. International Journal of Production Research, 6(1), 1\u201313.","journal-title":"International Journal of Production Research"},{"key":"532_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"FW Glover","year":"1997","unstructured":"Glover, F. W., & Laguna, M. (1997). Tabu search. Norwell: Kluwer."},{"issue":"2","key":"532_CR12","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1111\/itor.12044","volume":"21","author":"JF Gon\u00e7alves","year":"2014","unstructured":"Gon\u00e7alves, J. F., & Resende, M. G. C. (2014). An extended Akers graphical method with a biased random-key genetic algorithm for job-shop scheduling. International Transactions in Operational Research, 21(2), 215\u2013246.","journal-title":"International Transactions in Operational Research"},{"key":"532_CR13","unstructured":"Gonz\u00e1lez, M. A., Vela, C. R., Sierra, M., Varela, R. (2010). Tabu search and genetic algorithm for scheduling with total flow time minimization. In COPLAS 2010: ICAPS Workshop on constraint satisfaction techniques for planning and scheduling problems (pp. 33\u201341)."},{"issue":"12","key":"532_CR14","doi-asserted-by":"crossref","first-page":"2097","DOI":"10.1007\/s00500-012-0880-y","volume":"16","author":"M\u00c1 Gonz\u00e1lez","year":"2012","unstructured":"Gonz\u00e1lez, M. \u00c1., Gonz\u00e1lez-Rodr\u00edguez, I., Vela, C. R., & Varela, R. (2012a). An efficient hybrid evolutionary algorithm for scheduling with setup times and weighted tardiness minimization. Soft Computing, 16(12), 2097\u20132113.","journal-title":"Soft Computing"},{"issue":"1","key":"532_CR15","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s11047-011-9300-y","volume":"11","author":"MA Gonz\u00e1lez","year":"2012","unstructured":"Gonz\u00e1lez, M. A., Vela, C. R., & Varela, R. (2012b). A competent memetic algorithm for complex scheduling. Natural Computing, 11(1), 151\u2013160.","journal-title":"Natural Computing"},{"key":"532_CR16","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"2","key":"532_CR17","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1287\/ijoc.2014.0625","volume":"27","author":"D Grimes","year":"2015","unstructured":"Grimes, D., & Hebrard, E. (2015). Solving variants of the job shop scheduling problem through conflict-directed search. INFORMS Journal on Computing, 27(2), 268\u2013284.","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"532_CR18","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1016\/j.ejor.2005.12.025","volume":"177","author":"H Gr\u00f6flin","year":"2007","unstructured":"Gr\u00f6flin, H., & Klinkert, A. (2007). Feasible insertions in job shop scheduling, short cycles and stable sets. European Journal of Operational Research, 177(2), 763\u2013785.","journal-title":"European Journal of Operational Research"},{"issue":"17","key":"532_CR19","doi-asserted-by":"crossref","first-page":"3643","DOI":"10.1016\/j.dam.2009.02.020","volume":"157","author":"H Gr\u00f6flin","year":"2009","unstructured":"Gr\u00f6flin, H., & Klinkert, A. (2009). A new neighborhood and tabu search for the blocking job shop. Discrete Applied Mathematics, 157(17), 3643\u20133655.","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"532_CR20","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s10878-009-9278-x","volume":"22","author":"H Gr\u00f6flin","year":"2011","unstructured":"Gr\u00f6flin, H., Pham, D. N., & B\u00fcrgy, R. (2011). The flexible blocking job shop with transfer and set-up times. Journal of Combinatorial Optimization, 22(2), 121\u2013144.","journal-title":"Journal of Combinatorial Optimization"},{"key":"532_CR21","doi-asserted-by":"crossref","unstructured":"Hooker, J. N. (1995). Testing heuristics: We have it all wrong. Journal of Heuristics, 1(1), 33\u201342.","DOI":"10.1007\/BF02430364"},{"key":"532_CR22","volume-title":"Supplement to resource constrained project scheduling: An experimental investigation of heuristic scheduling techniques","author":"S Lawrence","year":"1984","unstructured":"Lawrence, S. (1984). Supplement to resource constrained project scheduling: An experimental investigation of heuristic scheduling techniques. Pittsburgh, PA: GSIA: Carnegie Mellon University."},{"issue":"3","key":"532_CR23","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/S0377-2217(01)00338-1","volume":"143","author":"A Mascis","year":"2002","unstructured":"Mascis, A., & Pacciarelli, D. (2002). Job-shop scheduling with blocking and no-wait constraints. European Journal of Operational Research, 143(3), 498\u2013517.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"532_CR24","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.ejor.2011.01.046","volume":"212","author":"Y Mati","year":"2011","unstructured":"Mati, Y., Dauz\u00e8re-P\u00e9r\u00e8s, S., & Lahlou, C. (2011). A general approach for optimizing regular criteria in the job-shop scheduling problem. European Journal of Operational Research, 212(1), 33\u201342.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"532_CR25","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E Nowicki","year":"1996","unstructured":"Nowicki, E., & Smutnicki, C. (1996). A fast taboo search algorithm for the job shop problem. Management Science, 42(6), 797\u2013813.","journal-title":"Management Science"},{"issue":"2","key":"532_CR26","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. (2005). An advanced tabu search algorithm for the job shop problem. Journal of Scheduling, 8(2), 145\u2013159.","journal-title":"Journal of Scheduling"},{"key":"532_CR27","doi-asserted-by":"crossref","unstructured":"Oddi, A., Rasconi, R., Cesta, A., Smith, S. F. (2012). Iterative improvement algorithms for the blocking job shop. In Twenty-second international conference on automated planning and scheduling.","DOI":"10.1609\/icaps.v22i1.13530"},{"key":"532_CR28","doi-asserted-by":"crossref","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. C. E. (2015). A tabu search\/path relinking algorithm to solve the job shop scheduling problem. Computers and Operations Research, 53, 154\u2013164.","journal-title":"Computers and Operations Research"},{"key":"532_CR29","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1023\/A:1018903912673","volume":"83","author":"M Perregaard","year":"1998","unstructured":"Perregaard, M., & Clausen, J. (1998). Parallel branch-and-bound methods for the job-shop scheduling problem. Annals of Operations Research, 83, 137\u2013160.","journal-title":"Annals of Operations Research"},{"key":"532_CR30","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-2361-4","volume-title":"Scheduling: Theory, algorithms, and systems","author":"ML Pinedo","year":"2012","unstructured":"Pinedo, M. L. (2012). Scheduling: Theory, algorithms, and systems (4th ed.). Berlin: Springer.","edition":"4"},{"key":"532_CR31","doi-asserted-by":"crossref","first-page":"S41","DOI":"10.1057\/jors.2009.2","volume":"60","author":"CN Potts","year":"2009","unstructured":"Potts, C. N., & Strusevich, V. A. (2009). Fifty years of scheduling: A survey of milestones. Journal of the Operational Research Society, 60, S41\u2013S68.","journal-title":"Journal of the Operational Research Society"},{"key":"532_CR32","doi-asserted-by":"crossref","unstructured":"Pranzo, M., Pacciarelli, D. (2015). An iterated greedy metaheuristic for the blocking job shop scheduling problem. Journal of Heuristics, 22(4), 587\u2013611.","DOI":"10.1007\/s10732-014-9279-5"},{"key":"532_CR33","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1287\/ijoc.6.2.108","volume":"6","author":"E Taillard","year":"1994","unstructured":"Taillard, E. (1994). Parallel taboo search techniques for the job shop scheduling problem. ORSA Journal on Computing, 6, 108\u2013108.","journal-title":"ORSA Journal on Computing"},{"key":"532_CR34","volume-title":"The visual display of quantitative information","author":"ER Tufte","year":"2001","unstructured":"Tufte, E. R. (2001). The visual display of quantitative information (2nd ed.). Norwich: Bertrams.","edition":"2"},{"key":"532_CR35","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s10732-008-9094-y","volume":"16","author":"C Vela","year":"2010","unstructured":"Vela, C., Varela, R., & Gonz\u00e1lez, M. (2010). Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times. Journal of Heuristics, 16, 139\u2013165.","journal-title":"Journal of Heuristics"},{"issue":"1","key":"532_CR36","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/j.cor.2006.02.024","volume":"35","author":"CY Zhang","year":"2008","unstructured":"Zhang, C. Y., Li, P., Rao, Y., & Guan, Z. (2008). A very fast TS\/SA algorithm for the job shop scheduling problem. Computers and Operations Research, 35(1), 282\u2013294.","journal-title":"Computers and Operations Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-017-0532-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0532-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0532-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,24]],"date-time":"2023-08-24T01:16:44Z","timestamp":1692839804000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-017-0532-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,14]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["532"],"URL":"https:\/\/doi.org\/10.1007\/s10951-017-0532-2","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6,14]]}}}