{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T23:17:33Z","timestamp":1779923853462,"version":"3.53.1"},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2000,12]]},"DOI":"10.1016\/s0377-2217(99)00488-9","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:21:01Z","timestamp":1049484061000},"page":"344-354","source":"Crossref","is-referenced-by-count":38,"title":["Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems"],"prefix":"10.1016","volume":"127","author":[{"given":"Christelle","family":"Gu\u00e9ret","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Narendra","family":"Jussien","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian","family":"Prins","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00488-9_BIB1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","article-title":"On a routing problem","volume":"16","author":"Bellman","year":"1958","journal-title":"Quarterly of Applied Mathematics"},{"key":"10.1016\/S0377-2217(99)00488-9_BIB2","unstructured":"H. Br\u00e4sel, D. Kluge, F. Werner, A polynomial time algorithm for an open-shop problem with unit processing times and tree constraints, Technical Report, Technische Univeristaet Otto van Guericke, Magdeburg, 1991"},{"key":"10.1016\/S0377-2217(99)00488-9_BIB3","unstructured":"P. Brucker, T. Hilbig, J. Hurink, A branch and bound algorithm for scheduling problems with positive and negative time-lags, Technical Report, Osnabrueck University, May 1996"},{"key":"10.1016\/S0377-2217(99)00488-9_BIB4","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0166-218X(96)00116-3","article-title":"A branch and bound algorithm for the open-shop problem","volume":"76","author":"Brucker","year":"1997","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(99)00488-9_BIB5","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0166-218X(94)90204-6","article-title":"A fast branch and bound algorithm for the job-shop scheduling problem","volume":"49","author":"Brucker","year":"1994","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(99)00488-9_BIB6","unstructured":"M. Bruynooghe, L.M. Pereira, Deduction revision by intelligent backtracking, in: Implementations of Prolog, Ellis Horwood, Chichester, 1984, pp. 194\u2013215"},{"key":"10.1016\/S0377-2217(99)00488-9_BIB7","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","article-title":"An algorithm for solving the job-shop problem","volume":"35","author":"Carlier","year":"1989","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(99)00488-9_BIB8","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0377-2217(94)90379-4","article-title":"Adjusting heads and tails for the job-shop problem","volume":"78","author":"Carlier","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00488-9_BIB9","unstructured":"P.T. Cox, Finding backtrack points for intelligent backtracking, in: Implementation of Prolog, Ellis Horwood, Chichester, 1984, pp. 216\u2013233"},{"key":"10.1016\/S0377-2217(99)00488-9_BIB10","unstructured":"B. de Backer, H. B\u00e9ringer, Intelligent backtracking for CLP languages: An application to CLP(R), in: V. Saraswat, K. Ueda, (Eds.), ILPS'91: Proceedings of the International Logic Programming Symposium, San Diego, CA, October 1991, MIT Press, Cambridge, MA, pp. 405\u2013419"},{"issue":"3","key":"10.1016\/S0377-2217(99)00488-9_BIB11","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0004-3702(90)90046-3","article-title":"Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition","volume":"41","author":"Dechter","year":"1990","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0377-2217(99)00488-9_BIB12","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1613\/jair.1","article-title":"Dynamic backtracking","volume":"1","author":"Ginsberg","year":"1993","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"4","key":"10.1016\/S0377-2217(99)00488-9_BIB13","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","article-title":"Open-shop scheduling to minimize finish time","volume":"23","author":"Gonzalez","year":"1976","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S0377-2217(99)00488-9_BIB14","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(86)90191-8","article-title":"A block approach for single-machine scheduling with release dates and due dates","volume":"26","author":"Grabowski","year":"1986","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00488-9_BIB15","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/S0377-2217(97)00332-9","article-title":"Classical and new heuristics for the open-shop problem","volume":"107","author":"Gu\u00e9ret","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00488-9_BIB16","unstructured":"N. Jussien, Relaxation de contraintes pour les probl\u00e8mes dynamiques, Ph.D. Thesis, Universit\u00e9 de Rennes I, 24 October 1997"},{"key":"10.1016\/S0377-2217(99)00488-9_BIB17","unstructured":"N. Jussien, P. Boizumault, Best-first search for property maintenance in reactive constraints systems, in: Proceeddings of the International Logic Programming Symposium, Port Jefferson, NY, October 1997, MIT Press, Cambridge, MA"},{"key":"10.1016\/S0377-2217(99)00488-9_BIB18","unstructured":"N. Jussien, P. Boizumault, Dynamic backtracking with constraint propagation \u2013 application to static and dynamic csps, in: CP97 Workshop on The Theory and Practice of Dynamic Constraint Satisfaction, Schloss Hagenberg, Austria, 1 November 1997"},{"key":"10.1016\/S0377-2217(99)00488-9_BIB19","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","article-title":"Benchmarks for basic scheduling problems","volume":"64","author":"Taillard","year":"1993","journal-title":"European Journal of Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799004889?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799004889?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T23:26:44Z","timestamp":1551828404000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799004889"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,12]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,12]]}},"alternative-id":["S0377221799004889"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00488-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,12]]}}}