{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:14:13Z","timestamp":1761488053863},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681540"},{"type":"electronic","value":"9783540681557"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68155-7_21","type":"book-chapter","created":{"date-parts":[[2008,5,19]],"date-time":"2008-05-19T05:41:20Z","timestamp":1211175680000},"page":"263-277","source":"Crossref","is-referenced-by-count":13,"title":["A Hybrid Constraint Programming \/ Local Search Approach to the Job-Shop Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Jean-Paul","family":"Watson","sequence":"first","affiliation":[]},{"given":"J. Christopher","family":"Beck","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"21_CR1","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1287\/mnsc.44.2.262","volume":"44","author":"E. Balas","year":"1998","unstructured":"Balas, E., Vazacopoulos, A.: Guided local search with shifting bottleneck for job-shop scheduling. Management Science\u00a044(2), 262\u2013275 (1998)","journal-title":"Management Science"},{"key":"21_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-1479-4","volume-title":"Constraint-based Scheduling","author":"P. Baptiste","year":"2001","unstructured":"Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-based Scheduling. Kluwer Academic Publishers, Dordrecht (2001)"},{"key":"21_CR3","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1613\/jair.2169","volume":"29","author":"J.C. Beck","year":"2007","unstructured":"Beck, J.C.: Solution-guided multi-point constructive search for job shop scheduling. Journal of Artificial Intelligence Research\u00a029, 49\u201377 (2007)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"1","key":"21_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0004-3702(99)00099-5","volume":"117","author":"J.C. Beck","year":"2000","unstructured":"Beck, J.C., Fox, M.S.: Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics. Artificial Intelligence\u00a0117(1), 31\u201381 (2000)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"21_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0377-2217(95)00362-2","volume":"93","author":"J. Bla\u017cewicz","year":"1996","unstructured":"Bla\u017cewicz, J., Domschke, W., Pesch, E.: The job shop scheduling problem: Conventional and new solution techniques. European Journal of Operational Research\u00a093(1), 1\u201333 (1996)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"21_CR6","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research\u00a01(2), 117\u2013129 (1976)","journal-title":"Mathematics of Operations Research"},{"key":"21_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/b101874","volume-title":"Handbook of Metaheuristics","author":"F. Glover","year":"2003","unstructured":"Glover, F., Laguna, M., Mart\u00ed, R.: Scatter search and path relinking: Advances and applications. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, Kluwer Academic Publishers, Dordrecht (2003)"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF02430364","volume":"1","author":"J.N. Hooker","year":"1996","unstructured":"Hooker, J.N.: Testing heuristics: We have it all wrong. Journal of Heuristics\u00a01, 33\u201342 (1996)","journal-title":"Journal of Heuristics"},{"issue":"9","key":"21_CR9","first-page":"2623","volume":"33","author":"A.E. Howe","year":"2006","unstructured":"Howe, A.E., Watson, J.P., Whitley, L.D.: Deconstructing nowicki and smutnicki\u2019s i-tsab tabu search algorithm for the job-shop scheduling problem. Computers and Operations Research, Anniversary Focused Issue on Tabu Search\u00a033(9), 2623\u20132644 (2006)","journal-title":"Computers and Operations Research, Anniversary Focused Issue on Tabu Search"},{"key":"21_CR10","doi-asserted-by":"publisher","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. Artificial Intelligence\u00a0143, 151\u2013188 (2003)","journal-title":"Artificial Intelligence"},{"issue":"2","key":"21_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1049\/ise.1994.0009","volume":"3","author":"C. Pape Le","year":"1994","unstructured":"Le Pape, C.: Implementation of resource constraints in ILOG Schedule: A library for the development of constraint-based scheduling systems. Intelligent Systems Engineering\u00a03(2), 55\u201366 (1994)","journal-title":"Intelligent Systems Engineering"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0020-0190(93)90029-9","volume":"47","author":"M. Luby","year":"1993","unstructured":"Luby, M., Sinclair, A., Zuckerman, D.: Optimal speedup of Las Vegas algorithms. Information Processing Letters\u00a047, 173\u2013180 (1993)","journal-title":"Information Processing Letters"},{"issue":"6","key":"21_CR13","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.: A fast taboo search algorithm for the job shop problem. Management Science\u00a042(6), 797\u2013813 (1996)","journal-title":"Management Science"},{"issue":"2","key":"21_CR14","doi-asserted-by":"publisher","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 algorithms for the job shop problem. Journal of Scheduling\u00a08(2), 145\u2013159 (2005)","journal-title":"Journal of Scheduling"},{"key":"21_CR15","unstructured":"Nuijten, W.P.M.: Time and resource constrained scheduling: a constraint satisfaction approach. PhD thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology (1994)"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1023\/A:1009687210594","volume":"3","author":"W.P.M. Nuijten","year":"1997","unstructured":"Nuijten, W.P.M., Le Pape, C.: Constraint-based job shop scheduling with ILOG Scheduler. Journal of Heuristics\u00a03, 271\u2013286 (1997)","journal-title":"Journal of Heuristics"},{"key":"21_CR17","unstructured":"Scheduler. ILOG Scheduler 6.5 User\u2019s Manual and Reference Manual. ILOG, S.A (2007)"},{"key":"21_CR18","unstructured":"Smith, S.F., Cheng, C.C.: Slack-based heuristics for constraint satisfaction scheduling. In: Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI 1993), pp. 139\u2013144 (1993)"},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E.D. Taillard","year":"1993","unstructured":"Taillard, E.D.: Benchmarks for basic scheduling problems. European Journal of Operational Research\u00a064, 278\u2013285 (1993)","journal-title":"European Journal of Operational Research"},{"key":"21_CR20","unstructured":"Taillard, \u00c9.D.: (November 2007), http:\/\/ina.eivd.ch\/collaborateurs\/etd\/default.htm"},{"key":"21_CR21","unstructured":"Taillard, \u00c9.D.: Parallel taboo search technique for the jobshop scheduling problem. Technical Report ORWP 89\/11, DMA, Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne, Switzerland (1989)"},{"key":"21_CR22","unstructured":"Watson, J.-P.: On metaheuristic \u201cFailure Modes\u201d: A case study in tabu search for job-shop scheduling. In: Proceedings of the Fifth Metaheuristics International Conference (2005)"},{"key":"21_CR23","unstructured":"Watson, J.P.: Empirical Modeling and Analysis of Local Search Algorithms for the Job-Shop Scheduling Problem. PhD thesis, Department of Computer Science, Colorado State University (2003)"},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"Wu, H., van Beek, P.: On universal restart strategies for backtracking search. In: Proceedings of the Thirteenth International Conference on Principles and Practice of Constraint Programming, pp. 681\u2013695 (2007)","DOI":"10.1007\/978-3-540-74970-7_48"},{"issue":"1","key":"21_CR25","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.cor.2006.02.024","volume":"35","author":"C.Y. Zhang","year":"2008","unstructured":"Zhang, C.Y., Li, P., Rao, Y., Guan, Z.: A very fast TS\/SA algorithm for the job shop scheduling problem. Computers and Operations Research\u00a035(1), 282\u2013294 (2008)","journal-title":"Computers and Operations Research"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68155-7_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:09:06Z","timestamp":1605744546000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68155-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540681540","9783540681557"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68155-7_21","relation":{},"subject":[]}}