{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T05:44:23Z","timestamp":1761630263475,"version":"3.41.2"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2000,10,1]],"date-time":"2000-10-01T00:00:00Z","timestamp":970358400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,10,1]],"date-time":"2000-10-01T00:00:00Z","timestamp":970358400000},"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":["Constraints"],"published-print":{"date-parts":[[2000,10]]},"DOI":"10.1023\/a:1009856210543","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T18:53:29Z","timestamp":1040583209000},"page":"359-388","source":"Crossref","is-referenced-by-count":84,"title":["Probe Backtrack Search for Minimal Perturbation in Dynamic Scheduling"],"prefix":"10.1007","volume":"5","author":[{"given":"Hani El","family":"Sakkout","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Wallace","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"269095_CR1","unstructured":"A. Abderrahmane and N. Beldiceanu. (1992). Extending CHIP in order to solve complex scheduling and placement problems. Premi\u00e8res Journ\u00e9es Francophones sur la Programation en Logique."},{"key":"269095_CR2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02283745","volume":"16","author":"M. Bartusch","year":"1988","unstructured":"M. Bartusch, R. H. M\u00f6hring, and F. J. Radermacher. (1988). Scheduling project networks with resource constraints and time windows. Annals of Operations Research, 16: 201-240.","journal-title":"Annals of Operations Research"},{"key":"269095_CR3","unstructured":"H. Beringer and B. de Backer. (1993). Satisfiability of boolean formulas over linear constraints. In IJCAI-93, pp. 296-301, Chamb\u00e9ry, France."},{"key":"269095_CR4","doi-asserted-by":"crossref","unstructured":"E. G. Coffman Jr., M. R. Garey, and D. S. Johnson. (1984). Approximation algorithms for bin-packing-an updated survey. In G. Ausiello, M. Lucertini, and P. Serafini, editors, Algorithm Design for Computer System Design, pp. 49-106. Springer-Verlag.","DOI":"10.1007\/978-3-7091-4338-4_3"},{"key":"269095_CR5","unstructured":"A. Davenport. (1998). Managing uncertainty in scheduling: a survey. Working Draft."},{"key":"269095_CR6","unstructured":"R. Dechter and A. Dechter. (1988). Belief maintenance in dynamic constraint networks. In Proceedings of AAAI-88, pp. 37-42."},{"key":"269095_CR7","doi-asserted-by":"crossref","unstructured":"R. Dechter and J. Pearl. (1988). Network-based heuristics for constraint satisfaction problems. Artificial Intelligence, 34.","DOI":"10.1007\/978-1-4613-8788-6_11"},{"key":"269095_CR8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R. Dechter","year":"1991","unstructured":"R. Dechter, I. Meiri, and J. Pearl. (1991). Temporal constraint networks. Artificial Intelligence, 49: 61-95.","journal-title":"Artificial Intelligence"},{"key":"269095_CR9","unstructured":"A. El-Kholy and B. Richards. (1996). Temporal and resource reasoning in planning: The parc PLAN approach. In Proceedings of the 11th European Conference on Artificial Intelligence, ECAI-96, pp. 614-618, Budapest, Hungary."},{"key":"269095_CR10","unstructured":"A. O. El-Kholy. (1996). Resource Feasibility in Planning. Ph.D. thesis, Imperial College, University of London."},{"key":"269095_CR11","unstructured":"H. El Sakkout, T. Richards, and M.Wallace. (1997). Unimodular probing for minimal perturbance in dynamic resource feasibility problems. In Proceedings of the CP97 workshop on Dynamic Constraint Satisfaction."},{"key":"269095_CR12","unstructured":"H. El Sakkout, T. Richards, and M. Wallace. (1998). Minimal perturbation in dynamic scheduling. In Proceedings of the 13th European Conference on Artificial Intelligence, ECAI-98, Brighton, UK, 1998."},{"key":"269095_CR13","unstructured":"M. S. Fox. (1987). Constraint-directed search: a case study of job-shop scheduling. Morgan Kaufmann Publishers Inc."},{"key":"269095_CR14","volume-title":"Sequencing and Scheduling: An introduction to the Mathematics of the Job-Shop","author":"S. French","year":"1982","unstructured":"S. French. (1982). Sequencing and Scheduling: An introduction to the Mathematics of the Job-Shop. Ellis Horwood, England."},{"key":"269095_CR15","unstructured":"M. R. Garey and D. S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NPCompleteness. Bell Telephone Laboratories, Inc."},{"key":"269095_CR16","unstructured":"R. S. Garfinkel and G. L. Nemhauser. (1972). Integer Programming. John Wiley & Sons."},{"key":"269095_CR17","doi-asserted-by":"crossref","unstructured":"I. Heller and C.B.Tompkins. (1956). An extension of a theorem of Dantzig's. In Kuhn and Tucker, editors, Linear Inequalities and Related Systems, pp. 247-254. Princeton University Press.","DOI":"10.1515\/9781400881987-015"},{"key":"269095_CR18","volume-title":"Flexibility in a Knowledge-Based System for Solving Dynamic Resource-Constrained Scheduling Problems","author":"D.W. Hildum","year":"1994","unstructured":"D.W. Hildum. (1994). Flexibility in a Knowledge-Based System for Solving Dynamic Resource-Constrained Scheduling Problems. Ph.D. thesis, Dept. of Computer Science, University of Massachusetts, Amherst. 19. J. N. Hooker and M. A. Osorio. (1996). Mixed logical\/linear programming. Discrete Applied Mathematics (to appear). Electronic copy available from first author's home page: <http:\/\/www.gsia.cmu.edu\/afs\/andrew.cmu.edu\/gsia\/jh38\/papers.html>."},{"issue":"4","key":"269095_CR19","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"N. Karmarkar. (1984). A new polynomial-time algrithm for linear programming. Combinatorica, 4(4): 373-395.","journal-title":"Combinatorica"},{"issue":"1","key":"269095_CR20","first-page":"191","volume":"20","author":"L. G. Khachian","year":"1979","unstructured":"L. G. Khachian. (1979).Apolynomial algorithm in linear programming. Soviet Math. Dokl., 20(1): 191-194.","journal-title":"Soviet Math. Dokl."},{"key":"269095_CR21","unstructured":"C. Le Pape, P. Couronn\u00e9, D. Vergamini, and V. Gosselin. (1994). Time-versus-capacity compromises in project scheduling. In Proceedings of the 13th Workshop of the UK Planning and Scheduling SIG, Glasgow, Scotland."},{"issue":"5","key":"269095_CR22","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1080\/07408179408966626","volume":"26","author":"V. J. Leon","year":"1994","unstructured":"V. J. Leon, S. D. Wu, and R. H. Storer. (1994). Robustness measures and robust scheduling for job shop. IIE Transactions, 26(5): 32-43.","journal-title":"IIE Transactions"},{"key":"269095_CR23","unstructured":"Olivier Lhomme. (1993). Consistency techniques for numeric csps. In Proceedings of the 13th International Joint Conference on Artificial Intelligence, IJCAI-93, pp. 232-238, Chamb\u00e9ry, France."},{"key":"269095_CR24","unstructured":"V. Liatsos. (1998). Short term scheduling. Presentation at the DIMACS Workshop on Constraint Programming and Large-Scale Discrete Optimization, Rutgers University, NJ."},{"key":"269095_CR25","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"S. Minton","year":"1992","unstructured":"S. Minton, M. D. Johnston, A. B. Philips, and P. Laird. (1992). Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58: 161-205.","journal-title":"Artificial Intelligence"},{"key":"269095_CR26","unstructured":"W. Nuijten and E. Aarts. (1994). Constraint satisfaction for multiple capacitated job shop scheduling. In Proceedings of the 11th European Conference on Artificial Intelligence, ECAI-94. JohnWiley & Sons, Ltd."},{"key":"269095_CR27","unstructured":"Wim Nuijten. (1994). Time and Resource Constrained Scheduling: A constraint satisfaction approach. PhD thesis, Eindhoven University of Technology."},{"key":"269095_CR28","unstructured":"D. Pothos. (1997). A constraint-based approach to the british airways schedule re-timing problem. Technical Report 97\/04-01, IC-Parc, Imperial College."},{"key":"269095_CR29","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1137\/S0097539793256053","volume":"26","author":"P. W. Purdom Jr.","year":"1997","unstructured":"P. W. Purdom, Jr. and G. N. Haven. (1997). Probe order backtracking. Siam Journal of Computing, 26: 456-483.","journal-title":"Siam Journal of Computing"},{"key":"269095_CR30","doi-asserted-by":"crossref","unstructured":"M. Queyranne and Y. Wang. (1991). Single-machine scheduling polyhedra with precedence constraints. Mathematics of Operations Research, pp. 1-20.","DOI":"10.1287\/moor.16.1.1"},{"key":"269095_CR31","doi-asserted-by":"crossref","unstructured":"N. Sadeh. (1994). Micro-opportunistic scheduling: The micro-boss factory scheduler. In M. Zweben and M. Fox, editors, Intelligent Scheduling, chapter 4, pp. 99-136. Morgan Kaufman.","DOI":"10.21236\/ADA282968"},{"key":"269095_CR32","unstructured":"G. Verfaillie and T. Schiex. (1994). Solution reuse in dynamic constraint satisfaction problems. In AAAI-94, pp. 307-312, Seattle, WA."},{"key":"269095_CR33","unstructured":"M. Yokoo. (1994). Weak-commitment search for solving constraint satisfaction problems. In AAAI-94, pp. 313-318, Seattle, WA."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009856210543.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009856210543\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009856210543.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:46:19Z","timestamp":1752378379000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009856210543"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,10]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2000,10]]}},"alternative-id":["269095"],"URL":"https:\/\/doi.org\/10.1023\/a:1009856210543","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"type":"print","value":"1383-7133"},{"type":"electronic","value":"1572-9354"}],"subject":[],"published":{"date-parts":[[2000,10]]}}}