{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:13:40Z","timestamp":1760645620176},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,11,13]],"date-time":"2008-11-13T00:00:00Z","timestamp":1226534400000},"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":[[2010,2]]},"DOI":"10.1007\/s10845-008-0163-8","type":"journal-article","created":{"date-parts":[[2008,11,11]],"date-time":"2008-11-11T23:55:38Z","timestamp":1226447738000},"page":"17-30","source":"Crossref","is-referenced-by-count":16,"title":["Iterative flattening search for resource constrained scheduling"],"prefix":"10.1007","volume":"21","author":[{"given":"Angelo","family":"Oddi","sequence":"first","affiliation":[]},{"given":"Amedeo","family":"Cesta","sequence":"additional","affiliation":[]},{"given":"Nicola","family":"Policella","sequence":"additional","affiliation":[]},{"given":"Stephen F.","family":"Smith","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,11,13]]},"reference":[{"issue":"3","key":"163_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. (1988) The shifting bottleneck procedure for job shop scheduling. Management Science 34(3): 391\u2013401","journal-title":"Management Science"},{"issue":"1","key":"163_CR2","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","volume":"5","author":"J. Blazewicz","year":"1983","unstructured":"Blazewicz J., Lenstra J.K., Rinnoy Kan A.H.G. (1983) Scheduling projects subject to resource constraints: Classification and complexity. Discrete Applied Mathematics 5(1): 11\u201324","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"163_CR3","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C. Blum","year":"2003","unstructured":"Blum C., Roli A. (2003) Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys 35(3): 268\u2013308","journal-title":"ACM Computing Surveys"},{"key":"163_CR4","unstructured":"Cesta, A., Oddi, A., & Smith, S. F. (1998). Profile based algorithms to solve multiple capacitated metric scheduling problems. In AIPS-98. Proceedings of the 4th International Conference on Artificial Intelligence Planning Systems (pp. 214\u2013223)."},{"key":"163_CR5","unstructured":"Cesta, A., Oddi, A., & Smith, S. F. (2000) Iterative flattening: A scalable method for solving multi-capacity scheduling problems. In AAAI00. Proceedings of the 17th National Conference on Artificial Intelligence (pp. 742\u2013747)."},{"issue":"1","key":"163_CR6","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. (2002) A constraint-based method for project scheduling with time windows. Journal of Heuristics 8(1): 109\u2013136","journal-title":"Journal of Heuristics"},{"key":"163_CR7","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. (1991) Temporal constraint networks. Artificial Intelligence 49: 61\u201395","journal-title":"Artificial Intelligence"},{"key":"163_CR8","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/s001860000091","volume":"52","author":"U. Dorndorf","year":"2000","unstructured":"Dorndorf U., Pesch E., Phan Huy T. (2000) A branch-and-bound algorithm for the resource-constrained project scheduling problem. Mathematical Methods of Operations Research 52: 413\u2013439","journal-title":"Mathematical Methods of Operations Research"},{"key":"163_CR9","unstructured":"Godard, D., Laborie, P., & Nuitjen, W. (2005). Randomized large neighborhood search for cumulative scheduling. In ICAPS-05. Proceedings of the 15th International Conference on Automated Planning & Scheduling (pp. 81\u201389)."},{"key":"163_CR10","unstructured":"Gomes, C. P. (2003). Complete randomized backtrack search. In M. Milano (Ed.), Constraint and integer programming: Toward a unified methodology (pp. 233\u2013283). Kluwer."},{"key":"163_CR11","volume-title":"Stochastic local search. Foundations and applications","author":"H.H. Hoos","year":"2005","unstructured":"Hoos H.H., St\u00fctzle T. (2005) Stochastic local search. Foundations and applications. San Francisco, Morgan Kaufmann."},{"issue":"7","key":"163_CR12","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1002\/1520-6750(199510)42:7<1129::AID-NAV3220420711>3.0.CO;2-M","volume":"42","author":"L.W. Jacobs","year":"1995","unstructured":"Jacobs L.W., Brusco M.J. (1995) A local search heuristic for large set-covering problems. Naval Research Logistic Quarterly 42(7): 1129\u20131140","journal-title":"Naval Research Logistic Quarterly"},{"key":"163_CR13","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/0377-2217(95)00357-6","volume":"90","author":"R. Kolisch","year":"1996","unstructured":"Kolisch R. (1996) Serial and parallel resource-constrained project scheduling methods revised: Theory and computation. European Journal of Operational Research 90: 320\u2013333","journal-title":"European Journal of Operational Research"},{"key":"163_CR14","doi-asserted-by":"crossref","unstructured":"Langley, P. (1992). Systematic and nonsystematic search strategies. In AIPS92. Proceedings of the First International Conference on Artificial Intelligence Planning Systems (pp. 145\u2013152). San Francisco: Morgan Kaufmann Publishers Inc.","DOI":"10.1016\/B978-0-08-049944-4.50022-7"},{"key":"163_CR15","unstructured":"Lawrence, S. (1984). Resource constrained project scheduling: An experimental investigation of heuristic scheduling techniques (supplement). Technical report, Graduate School of Industrial Administration, Carnegie Mellon University."},{"issue":"2","key":"163_CR16","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1049\/ise.1994.0009","volume":"3","author":"C. Le Pape","year":"1994","unstructured":"Le Pape C. (1994) Implementation of resource constraints in ILOG schedule: A library for the development of constraint-based scheduling systems. Intelligent Systems Engineering 3(2): 55\u201366","journal-title":"Intelligent Systems Engineering"},{"key":"163_CR17","first-page":"321","volume-title":"Handbook of metaheuristics, international series in operations research & management science (Vol. 57)","author":"H.R. Lourenco","year":"2002","unstructured":"Lourenco H.R., Martin O., Stutzle T. (2002) Iterated local search. In: Glover F., Kochenberger G. (eds) Handbook of metaheuristics, international series in operations research & management science (Vol. 57). Academic Publishers, Norwell, MA, pp 321\u2013353"},{"key":"163_CR18","unstructured":"Marchiori, E., & Steenbeek, A. (1998). An iterated heuristic algorithm for the set covering problem. In Proceedings WAE\u201998, Saarbr\u00fccken, Germany, August 20\u201322 (pp. 155\u2013166)."},{"key":"163_CR19","unstructured":"Michel, L., & Van Hentenryck, P. (2004). Iterative relaxations for iterative flattening in cumulative scheduling. In ICAPS04. Proceedings of the 14th International Conference on Automated Planning & Scheduling (pp. 200\u2013208)."},{"issue":"2","key":"163_CR20","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0377-2217(95)00354-1","volume":"90","author":"W.P.M. Nuijten","year":"1996","unstructured":"Nuijten W.P.M., Aarts E.H.L. (1996) A computational study of constraint satisfaction for multiple capacitated job shop scheduling. European Journal of Operational Research 90(2): 269\u2013284","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"163_CR21","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1016\/j.engappai.2008.03.003","volume":"21","author":"A. Oddi","year":"2008","unstructured":"Oddi A., Cesta A., Policella N., Smith S.F. (2008) Combining variants of iterative flattening search. Journal of Engineering Applications of Artificial Intelligence 21(5): 683\u2013690","journal-title":"Journal of Engineering Applications of Artificial Intelligence"},{"issue":"3","key":"163_CR22","first-page":"163","volume":"20","author":"N. Policella","year":"2007","unstructured":"Policella N., Cesta A., Oddi A., Smith S.F. (2007) From precedence constraint posting to partial order schedules. AI Communications 20(3): 163\u2013180","journal-title":"AI Communications"},{"key":"163_CR23","doi-asserted-by":"crossref","unstructured":"Prestwich, S. (2000). A hybrid search architecture applied to hard random 3-SAT and low-autocorrelation binary sequences. In 2000CP00. The 6th International Conference on Principles and Practice of Constraint Programming, LNCS (Vol. 1894, pp. 337\u2013352). Springer-Verlag.","DOI":"10.1007\/3-540-45349-0_25"},{"key":"163_CR24","unstructured":"Resende, M. G. C., & Ribeiro, C. C. (2002). Greedy randomized adaptive search procedures. In F. Glover & G. Kochenberger (Eds.), State of the art handbook in metaheuristics. Kluwer."},{"issue":"3","key":"163_CR25","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. (2007) A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research 177(3): 2033\u20132049","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"163_CR26","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. (2008) An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objective. European Journal of Operational Research 187(3): 1143\u20131159","journal-title":"European Journal of Operational Research"},{"key":"163_CR27","doi-asserted-by":"crossref","unstructured":"Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In CP98. The 4th International Conference on Principles and Practice of Constraint Programming, LNCS (Vol. 1520, pp. 417\u2013431). Springer-Verlag.","DOI":"10.1007\/3-540-49481-2_30"}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-008-0163-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10845-008-0163-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-008-0163-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:11:42Z","timestamp":1559268702000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10845-008-0163-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,13]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,2]]}},"alternative-id":["163"],"URL":"https:\/\/doi.org\/10.1007\/s10845-008-0163-8","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,13]]}}}