{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:36:50Z","timestamp":1742931410262,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319184210"},{"type":"electronic","value":"9783319184227"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18422-7_3","type":"book-chapter","created":{"date-parts":[[2015,4,28]],"date-time":"2015-04-28T12:21:56Z","timestamp":1430223716000},"page":"33-43","source":"Crossref","is-referenced-by-count":0,"title":["Surveying the Versatility of Constraint-Based Large Neighborhood Search for Scheduling Problems"],"prefix":"10.1007","author":[{"given":"Riccardo","family":"Rasconi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelo","family":"Oddi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amedeo","family":"Cesta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1002\/(SICI)1099-1425(199808)1:2<89::AID-JOS9>3.0.CO;2-H","volume":"1","author":"J.C. Beck","year":"1998","unstructured":"Beck, J.C., Davenport, A.J., Davis, E.D., Fox, M.S.: The ODO project: toward a unified basis for constraint-directed scheduling. Journal of Scheduling\u00a01(2), 89\u2013125 (1998)","journal-title":"Journal of Scheduling"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Baptiste, P., Pape, C.L., Nuijten, W.: Constraint-Based Scheduling, 1st edn. Springer US (2001), doi:10.1007\/978-1-4615-1479-4","DOI":"10.1007\/978-1-4615-1479-4_1"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"2192","DOI":"10.1016\/j.cor.2010.03.009","volume":"37","author":"A. Ben Hmida","year":"2010","unstructured":"Ben Hmida, A., Haouari, M., Huguet, M.J., Lopez, P.: Discrepancy search for the flexible job shop scheduling problem. Computers & Operations Research\u00a037, 2192\u20132201 (2010)","journal-title":"Computers & Operations Research"},{"key":"3_CR4","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-642-13232-2_48","volume-title":"Artifical Intelligence and Soft Computing","author":"W. Bo\u017cejko","year":"2010","unstructured":"Bo\u017cejko, W., Uchro\u0144ski, M., Wodecki, M.: Parallel meta2heuristics for the flexible job shop problem. In: Rutkowski, L., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2010, Part II. LNCS (LNAI), vol.\u00a06114, pp. 395\u2013402. Springer, Heidelberg (2010)"},{"key":"3_CR5","unstructured":"Cesta, A., Oddi, A., Smith, S.F.: Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems. In: 17th National Conference on Artificial Intelligence, AAAI\/IAAI, pp. 742\u2013747 (2000)"},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","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\u00a08(1), 109\u2013136 (2002)","journal-title":"J. Heuristics"},{"key":"3_CR7","unstructured":"Cheng, C., Smith, S.F.: Generating Feasible Schedules under Complex Metric Constraints. In: Proceedings of the 12th National Conference on AI, AAAI 1994 (1994)"},{"issue":"1-3","key":"3_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0166-3615(90)90107-Z","volume":"14","author":"M.S. Fox","year":"1990","unstructured":"Fox, M.S.: Constraint Guided Scheduling: A Short History of Scheduling Research at CMU. Computers and Industry\u00a014(1-3), 79\u201388 (1990)","journal-title":"Computers and Industry"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"2892","DOI":"10.1016\/j.cor.2007.01.001","volume":"35","author":"J. Gao","year":"2008","unstructured":"Gao, J., Sun, L., Gen, M.: A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Computers & Operations Research\u00a035, 2892\u20132907 (2008)","journal-title":"Computers & Operations Research"},{"key":"3_CR10","unstructured":"Godard, D., Laborie, P., Nuitjen, W.: Randomized Large Neighborhood Search for Cumulative Scheduling. In: Proceedings of the 15th International Conference on Automated Planning & Scheduling, ICAPS 2005, pp. 81\u201389 (2005)"},{"key":"3_CR11","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search. Foundations and Applications. Morgan Kaufmann (2005)"},{"key":"3_CR12","unstructured":"Laborie, P., Ghallab, M.: Planning with Sharable Resource Constraints. In: Proceedings of the 14th Int. Joint Conference on Artificial Intelligence, IJCAI 1995 (1995)"},{"key":"3_CR13","unstructured":"Laurent, M., Van Hentenryck, P.: Iterative Relaxations for Iterative Flattening in Cumulative Scheduling. In: Proceedings of the 14th International Conference on Automated Planning & Scheduling, ICAPS 2004, pp. 200\u2013208 (2004)"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/(SICI)1099-1425(200001\/02)3:1<3::AID-JOS32>3.0.CO;2-Y","volume":"3","author":"M. Mastrolilli","year":"2000","unstructured":"Mastrolilli, M., Gambardella, L.M.: Effective neighbourhood functions for the flexible job shop problem. Journal of Scheduling\u00a03, 3\u201320 (2000)","journal-title":"Journal of Scheduling"},{"key":"3_CR15","doi-asserted-by":"publisher","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. Information Sciences\u00a07, 95\u2013132 (1974)","journal-title":"Information Sciences"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/2087522.2087536","volume-title":"Proceedings of the Second International Workshop on Data Intensive Computing in the Clouds, DataCloud-SC 2011","author":"H.J. Moon","year":"2011","unstructured":"Moon, H.J., Chi, Y., Hacig\u00fcm\u00fc\u015f, H.: Performance evaluation of scheduling algorithms for database services with soft and hard slas. In: Proceedings of the Second International Workshop on Data Intensive Computing in the Clouds, DataCloud-SC 2011, pp. 81\u201390. ACM, New York (2011), \n                      http:\/\/doi.acm.org\/10.1145\/2087522.2087536"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF01545589","volume":"19","author":"K. Neumann","year":"1997","unstructured":"Neumann, K., Schwindt, C.: Activity-on-Node Networks with Minimal and Maximal Time Lags and Their Application to Make-to-Order Production. Operation Research Spektrum\u00a019, 205\u2013217 (1997)","journal-title":"Operation Research Spektrum"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Oddi, A., Rasconi, R.: Solving resource-constrained project scheduling problems with time-windows using iterative improvement algorithms (2009), \n                      http:\/\/aaai.org\/ocs\/index.php\/ICAPS\/ICAPS09\/paper\/view\/736\/1142","DOI":"10.1609\/icaps.v19i1.13389"},{"key":"3_CR19","unstructured":"Oddi, A., Rasconi, R., Cesta, A., Smith, S.F.: Iterative flattening search for the flexible job shop scheduling problem. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011, Barcelona, Catalonia, Spain, July 16-22, pp. 1991\u20131996 (2011), \n                      http:\/\/ijcai.org\/papers11\/Papers\/IJCAI11-332.pdf"},{"key":"3_CR20","unstructured":"Oddi, A., Smith, S.F.: Stochastic Procedures for Generating Feasible Schedules. In: Proceedings 14th National Conference on AI (AAAI 1997) (1997)"},{"issue":"3","key":"3_CR21","first-page":"163","volume":"20","author":"N. Policella","year":"2007","unstructured":"Policella, N., Cesta, A., Oddi, A., Smith, S.F.: From Precedence Constraint Posting to Partial Order Schedules. AI Communications\u00a020(3), 163\u2013180 (2007)","journal-title":"AI Communications"},{"issue":"5","key":"3_CR22","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.rcim.2006.06.004","volume":"23","author":"A. Rossi","year":"2007","unstructured":"Rossi, A., Dini, G.: Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method. Robotics and Computer-Integrated Manufacturing\u00a023(5), 503\u2013516 (2007)","journal-title":"Robotics and Computer-Integrated Manufacturing"},{"key":"3_CR23","unstructured":"Sadeh, N.: Look-ahead Techniques for Micro-opportunistic Job-Shop Scheduling. School of Computer Science, Carnegie Mellon University (1991)"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming - CP98","author":"P. Shaw","year":"1998","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M., Puget, J.-F. (eds.) CP 1998. LNCS, vol.\u00a01520, pp. 417\u2013431. Springer, Heidelberg (1998), \n                      http:\/\/dx.doi.org\/10.1007\/3-540-49481-2_30"},{"issue":"2","key":"3_CR25","first-page":"233","volume":"11","author":"S.H. Son","year":"1995","unstructured":"Son, S.H., Park, S.: A Priority Based Scheduling Algorithm for Real-Time Databases. Journal of Information Science and Engg.\u00a011(2), 233\u2013248 (1995)","journal-title":"Journal of Information Science and Engg."},{"key":"3_CR26","unstructured":"Smith, S.: OPIS: A Methodology and Architecture for Reactive Scheduling. In: Zweben, M., Fox, M. (eds.) Intelligent Scheduling. Morgan Kaufmann (1994)"},{"issue":"3","key":"3_CR27","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s00450-009-0062-z","volume":"24","author":"M. Thiele","year":"2009","unstructured":"Thiele, M., Bader, A., Lehner, W.: Multi-objective scheduling for real-time data warehouses. Computer Science - Research and Development\u00a024(3), 137\u2013151 (2009), \n                      http:\/\/dx.doi.org\/10.1007\/s00450-009-0062-z","journal-title":"Computer Science - Research and Development"}],"container-title":["Communications in Computer and Information Science","Beyond Databases, Architectures and Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18422-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T11:32:57Z","timestamp":1674905577000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18422-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319184210","9783319184227"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18422-7_3","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2015]]}}}