{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T01:31:02Z","timestamp":1770082262902,"version":"3.49.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,1,18]],"date-time":"2015-01-18T00:00:00Z","timestamp":1421539200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s10732-014-9279-5","type":"journal-article","created":{"date-parts":[[2015,1,17]],"date-time":"2015-01-17T05:04:04Z","timestamp":1421471044000},"page":"587-611","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":59,"title":["An iterated greedy metaheuristic for the blocking job shop scheduling problem"],"prefix":"10.1007","volume":"22","author":[{"given":"Marco","family":"Pranzo","sequence":"first","affiliation":[]},{"given":"Dario","family":"Pacciarelli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,1,18]]},"reference":[{"issue":"3","key":"9279_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. Manag. Sci. 34(3), 391\u2013401 (1988)","journal-title":"Manag. Sci."},{"issue":"2","key":"9279_CR2","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.: A computational study of the job shop scheduling problem. ORSA J. Comput. 3(2), 149\u2013156 (1991)","journal-title":"ORSA J. Comput."},{"key":"9279_CR3","unstructured":"Cesta, A., Oddi, A., Smith, S.F.: Iterative flattening: a scalable method for solving multi-capacity scheduling problems. In: Proceedings of the National Conference on Artificial Intelligence, pp. 742\u2013747 (2000)"},{"issue":"2","key":"9279_CR4","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1016\/j.ejor.2006.10.034","volume":"183","author":"A D\u2019Ariano","year":"2007","unstructured":"D\u2019Ariano, A., Pacciarelli, D., Pranzo, M.: A branch and bound algorithm for scheduling trains in a railway network. Eur. J. Oper. Res. 183(2), 643\u2013657 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9279_CR5","doi-asserted-by":"crossref","unstructured":"D\u2019Ariano, A., D\u2019Urgolo, P., Pacciarelli, D.: Optimal sequencing of aircrafts take-off and landing at a busy airport. In: Proceedings of the 13th IEEE Conference on Intelligent Transportation Systems, pp. 1569\u20131574 (2010)","DOI":"10.1109\/ITSC.2010.5625114"},{"key":"9279_CR6","volume-title":"Industrial Scheduling","author":"H Fisher","year":"1963","unstructured":"Fisher, H., Thompson, G.L.: Probabilistic learning combinations of local job-shop scheduling rules. In: Muth, J.F., Thompson, G.L. (eds.) Industrial Scheduling. Prentice-Hall, New Jersey, Englewood Cliffs (1963)"},{"key":"9279_CR7","doi-asserted-by":"crossref","unstructured":"Gabel, T., Riedmiller, M.: On a successful application of multi-agent reinforcement learning to operations research benchmarks. In: Proceedings of the 2007 IEEE Symposium on Approximate Dynamic Programming and Reinforcement Learning (ADPRL), pp. 68\u201375 (2007)","DOI":"10.1109\/ADPRL.2007.368171"},{"key":"9279_CR8","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1016\/S0377-2217(99)00224-6","volume":"125","author":"J Grabowski","year":"2000","unstructured":"Grabowski, J., Pempera, J.: Sequencing of jobs in some production system. Eur. J. Oper. Res. 125, 535\u2013550 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9279_CR9","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.: The flexible blocking job shop with transfer and set-up times. J. Comb. Optim. 22(2), 121\u2013144 (2011)","journal-title":"J. Comb. Optim."},{"issue":"17","key":"9279_CR10","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.: A new neighborhood and tabu search for the blocking job shop. Discret. Appl. Math. 157(17), 3643\u20133655 (2009)","journal-title":"Discret. Appl. Math."},{"key":"9279_CR11","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1287\/opre.44.3.510","volume":"44","author":"NG Hall","year":"1996","unstructured":"Hall, N.G., Sriskandarajah, C.: A survey of machine scheduling problems with blocking and no-wait in process. Oper. Res. 44, 510\u2013525 (1996)","journal-title":"Oper. Res."},{"key":"9279_CR12","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0004-3702(02)00362-4","volume":"143","author":"P Laborie","year":"2003","unstructured":"Laborie, P.: Algorithms for propagating resource constraints in AI planning and scheduling: existing approaches and new results. Artif. Intell. 143, 151\u2013188 (2003)","journal-title":"Artif. Intell."},{"key":"9279_CR13","unstructured":"Laborie, P., Godard, D.: Self-adapting large neighborhood search: application to single-mode scheduling problems. In: Proceedings MISTA-07 (2007)"},{"key":"9279_CR14","volume-title":"Supplement to Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques","author":"S Lawrence","year":"1984","unstructured":"Lawrence, S.: Supplement to Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques. GSIA, Carnagie Mellon University, Pittsburg, PA (1984)"},{"key":"9279_CR15","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1016\/S0377-2217(96)00272-X","volume":"97","author":"E Levner","year":"1997","unstructured":"Levner, E., Kats, V.B., Levit, V.E.: An improved algorithm for a cyclic robotic scheduling problem. Eur. J. Oper. Res. 97, 500\u2013508 (1997)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9279_CR16","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1287\/trsc.1100.0332","volume":"45","author":"SQ Liu","year":"2011","unstructured":"Liu, S.Q., Kozan, E.: Scheduling trains with priorities: a no-wait blocking parallel-machine job-shop scheduling model. Transp. Sci. 45(2), 175\u2013198 (2011)","journal-title":"Transp. Sci."},{"key":"9279_CR17","doi-asserted-by":"crossref","unstructured":"Marchiori, E., Steenbeek, A.: An evolutionary algorithm for large set covering problems with applications to airline crew scheduling. Real-World Applications of Evolutionary Computing, EvoWorkshops. Lecture Notes in Computer Science, pp. 367\u2013381 (2000)","DOI":"10.1007\/3-540-45561-2_36"},{"issue":"3","key":"9279_CR18","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.: Job-shop scheduling with blocking and no-wait constraints. Eur. J. Oper. Res. 143(3), 498\u2013517 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"9279_CR19","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1109\/70.975998","volume":"17","author":"Y Mati","year":"2001","unstructured":"Mati, Y., Rezg, N., Xie, X.L.: Geometric approach and taboo search for scheduling flexible manufacturing systems. IEEE Trans. Robot. Autom. 17(6), 805\u2013818 (2001)","journal-title":"IEEE Trans. Robot. Autom."},{"issue":"5\u20136","key":"9279_CR20","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1023\/A:1012260622596","volume":"12","author":"Y Mati","year":"2001","unstructured":"Mati, Y., Rezg, N., Xie, X.L.: A taboo search approach for deadlock-free scheduling of automated manufacturing systems. J. Intell. Manuf. 12(5\u20136), 535\u2013552 (2001)","journal-title":"J. Intell. Manuf."},{"issue":"1","key":"9279_CR21","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1109\/TASE.2010.2052356","volume":"8","author":"Y Mati","year":"2011","unstructured":"Mati, Y., Xie, X.: Multiresource shop scheduling with resource flexibility and blocking. IEEE Trans. Autom. Sci. Eng. 8(1), 175\u2013189 (2011)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"9279_CR22","unstructured":"Meersmans, P.J.M.: Optimization of container handling systems. Ph.D. Thesis, Erasmus University Rotterdam (2002)"},{"issue":"1\u20134","key":"9279_CR23","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1023\/B:ANOR.0000039520.24932.4b","volume":"131","author":"C Meloni","year":"2004","unstructured":"Meloni, C., Pacciarelli, D., Pranzo, M.: A rollout metaheuristic for job shop scheduling problems. Ann. Oper. Res. 131(1\u20134), 215\u2013235 (2004)","journal-title":"Ann. Oper. Res."},{"key":"9279_CR24","doi-asserted-by":"crossref","unstructured":"Oddi, A., Rasconi, R., Cesta, A., Smith, S.F.: Iterative improvement algorithms for the blocking job shop. In: Twenty-Second International Conference on Automated Planning and Scheduling (2012)","DOI":"10.1609\/icaps.v22i1.13530"},{"issue":"15","key":"9279_CR25","doi-asserted-by":"crossref","first-page":"3641","DOI":"10.1080\/00207540210136478","volume":"40","author":"D Pacciarelli","year":"2004","unstructured":"Pacciarelli, D.: Alternative graph formulation for solving complex factory-scheduling problems. Int. J. Prod. Res. 40(15), 3641\u20133653 (2004)","journal-title":"Int. J. Prod. Res."},{"issue":"12","key":"9279_CR26","doi-asserted-by":"crossref","first-page":"2823","DOI":"10.1016\/j.compchemeng.2004.08.031","volume":"28","author":"D Pacciarelli","year":"2004","unstructured":"Pacciarelli, D., Pranzo, M.: Production scheduling in a steelmaking-continuous casting plant. Comput. Chem. Eng. 28(12), 2823\u20132835 (2004)","journal-title":"Comput. Chem. Eng."},{"issue":"3","key":"9279_CR27","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1016\/j.ejor.2006.03.059","volume":"185","author":"D-N Pham","year":"2008","unstructured":"Pham, D.-N., Klinkert, A.: Surgical case scheduling as a generalized job shop scheduling problem. Eur. J. Oper. Res. 185(3), 1011\u20131025 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"9279_CR28","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/3-540-44867-5_19","volume":"2647","author":"M Pranzo","year":"2003","unstructured":"Pranzo, M., Meloni, C., Pacciarelli, D.: A new class of greedy heuristics for job shop scheduling problems. Proceedings of the 4th International Conference on Experimental and Efficient Algorithms 2647, 223\u2013236 (2003)","journal-title":"Proceedings of the 4th International Conference on Experimental and Efficient Algorithms"},{"issue":"3","key":"9279_CR29","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/j.omega.2010.07.007","volume":"39","author":"I Ribas","year":"2011","unstructured":"Ribas, I., Companys, R., Tort-Martorell, X.: An iterated greedy algorithm for the flowshop scheduling problem with blocking. Omega Int. J. Manag. Sci. 39(3), 293\u2013301 (2011)","journal-title":"Omega Int. J. Manag. Sci."},{"issue":"4","key":"9279_CR30","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40(4), 455\u2013472 (2006)","journal-title":"Transp. Sci."},{"issue":"3","key":"9279_CR31","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1016\/j.ejor.2004.09.004","volume":"171","author":"S Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: A unified heuristic for a large class of vehicle routing problems with backhauls. Eur. J. Oper. Res. 171(3), 750\u2013775 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9279_CR32","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","volume":"177","author":"R Ruiz","year":"2007","unstructured":"Ruiz, R., St\u00fctzle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur. J. Oper. Res. 177(3), 2033\u20132049 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9279_CR33","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.1016\/j.ejor.2006.07.029","volume":"187","author":"R Ruiz","year":"2008","unstructured":"Ruiz, R., St\u00fctzle, T.: An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. Eur. J. Oper. Res. 187(3), 1143\u20131159 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9279_CR34","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1006\/jcph.1999.6413","volume":"159","author":"G Schrimpf","year":"2000","unstructured":"Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., Dueck, G.: Record breaking optimization results using the ruin and recreate principle. J. Comput. Phys. 159(2), 139\u2013171 (2000)","journal-title":"J. Comput. Phys."},{"key":"9279_CR35","unstructured":"Shaw, P.: A new local search algorithm providing high quality solutions to vehicle routing problems. Departement of Computer Sciences, University of Strathclyde, Glasgow, Scotland, Technical Report, APES group (1997)"},{"key":"9279_CR36","doi-asserted-by":"crossref","unstructured":"Zhu, J., Li, X.P.: An efficient metaheuristic for the blocking job shop problem with the makespan minimization. In: International IEEE Conference on Machine Learning and Cybernetics (ICMLC), pp. 1352\u20131357 (2011)","DOI":"10.1109\/ICMLC.2011.6016867"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-014-9279-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-014-9279-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-014-9279-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T02:10:45Z","timestamp":1690855845000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-014-9279-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,18]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["9279"],"URL":"https:\/\/doi.org\/10.1007\/s10732-014-9279-5","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,18]]}}}