{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T12:12:37Z","timestamp":1790856757146,"version":"4.1.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":["Journal of Heuristics"],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1023\/a:1013617802515","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T22:11:47Z","timestamp":1040681507000},"page":"109-136","source":"Crossref","is-referenced-by-count":126,"title":["A Constraint-Based Method for Project Scheduling with Time Windows"],"prefix":"10.1007","volume":"8","author":[{"given":"Amedeo","family":"Cesta","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Angelo","family":"Oddi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephen F.","family":"Smith","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"391045_CR1","unstructured":"Baptiste, P. and C. Le Pape. (1995). \u201cA Theoretical and Experimental Comparison of Constraint Propagation Trchniques for Disjunctive Scheduling.\u201d In Proceedings of the 14th International Joint Conference on Artificial Intelligence."},{"key":"391045_CR2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1023\/A:1018995000688","volume":"92","author":"P. Baptiste","year":"1999","unstructured":"Baptiste, P., C. Le Pape, and W. Nuijten. (1999). \u201cSatifiability Tests and Time-Bound Adjustments for Cumulative Scheduling Problems.\u201d Technical Report, University of Compi\u00e9gnie. Annals of Operations Research 92, 305\u2013333.","journal-title":"Annals of Operations Research"},{"key":"391045_CR3","first-page":"201","volume":"16","author":"M. Bartusch","year":"1998","unstructured":"Bartusch, M., R.H. Mohring, and F.J. Radermacher. (1998). \u201cScheduling Project Networks with Resource Constraints and Time Windows.\u201d Annals of Operations Research 16, 201\u2013240.","journal-title":"Annals of Operations Research"},{"key":"391045_CR4","doi-asserted-by":"crossref","unstructured":"Brucker, P., A. Drexl, R. Mohring, K. Neumann, and E. Pesch, (1998). \u201cResource-Constrained Project Scheduling: Notation, Classification, Models, and Methods,\u201d European Journal of Operations Research.","DOI":"10.1016\/S0377-2217(98)00204-5"},{"key":"391045_CR5","first-page":"369","volume-title":"Logic Programming, Proceedings of the Eleventh International Conference on Logic Programming","author":"Y. Caseau","year":"1994","unstructured":"Caseau, Y. and F. Laburthe. (1994). \u201cImproved CLP Scheduling with Task Intervals.\u201d In P.V. Hentenryck (ed.), Logic Programming, Proceedings of the Eleventh International Conference on Logic Programming, Santa Margherita Ligure, Italy. Cambridge, MA: MIT Press, pp. 369\u2013383."},{"key":"391045_CR6","volume-title":"Logic Programming, Proceedings of the Joint International Conference and Symposium on Logic Programming","author":"Y. Caseau","year":"1996","unstructured":"Caseau, Y. and F. Laburthe. (1996). \u201cCumulative Scheduling with Task Intervals.\u201d In M. Maher (ed.), Logic Programming, Proceedings of the Joint International Conference and Symposium on Logic Programming, Bonn, Germany. Cambridge, MA: MIT Press."},{"key":"391045_CR7","unstructured":"Cesta, A., A. Oddi, and S.F. Smith. (1998a). \u201cProfile Based Algorithms to Solve Multiple Capacitated Metric Scheduling Problems.\u201d In Proceedings of the Fourth Int. Conf. on Artificial Intelligence Planning Systems (AIPS-98)."},{"key":"391045_CR8","doi-asserted-by":"crossref","unstructured":"Cesta, A., A. Oddi, and S.F. Smith. (1998b). \u201cScheduling Multi-Capacitated Resources under Complex Temporal Constraints.\u201d Technical Report CMU-RI-TR-98-17, Robotics Institute, Carnegie Mellon University.","DOI":"10.1007\/3-540-49481-2_36"},{"key":"391045_CR9","unstructured":"Cesta, A., A. Oddi, and S.F. Smith. (1999). \u201cAn Iterative Sampling Procedure for Resource Constrained Project Scheduling with Time Windows.\u201d In Proceedings of the 16th Int. Joint Conference on Artificial Intelligence (IJCAI-99)."},{"key":"391045_CR10","unstructured":"Cheng, C. and S.F. Smith. (1994). \u201cGenerating Feasible Schedules under Complex Metric Constraints.\u201d In Proceedings 12th National Conference on AI (AAAI-94)."},{"key":"391045_CR11","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1023\/A:1018934507395","volume":"70","author":"C. Cheng","year":"1997","unstructured":"Cheng, C. and S.F. Smith. (1997). \u201cApplying Constraint Satisfaction Techniques to Job Shop Scheduling.\u201d Annals of Operations Research 70, 327\u2013357.","journal-title":"Annals of Operations Research"},{"key":"391045_CR12","unstructured":"Crawford, J. (1996). \u201cAn Approach to Resource Constrained Project Scheduling.\u201d In Proceedings of the 1996 Artificial Intelligence and Manufacturing Research Planning Workshop."},{"issue":"1","key":"391045_CR13","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/S0377-2217(97)00305-6","volume":"111","author":"B. De Reyck","year":"1998","unstructured":"De Reyck, B. and W. Herroelen. (1998). \u201cA Branch-and-Bound Procedure for the Resource-Constrained Project Scheduling Problem with Generalized Procedence Relations.\u201d European Journal of Operations Research 111(1), 152\u2013174.","journal-title":"European Journal of Operations Research"},{"key":"391045_CR14","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., I. Meiri, and J. Pearl. (1991). \u201cTemporal Constraint Networks.\u201d Artificial Intelligence 49, 61\u201395.","journal-title":"Artificial Intelligence"},{"key":"391045_CR15","unstructured":"Dorndorf, U., E. Pesch, and T. Phan Huy. (1998). \u201cA Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalized Precedence Relations.\u201d Technical Report, University of Bonn, Faculty of Economics."},{"key":"391045_CR16","unstructured":"Franck, B. and K. Neumann. (1998). \u201cResource Constrained Project Scheduling Problems with TimeWindows\u2014 Structural Questions and Priority-Rule Methods.\u201d Technical Report WIOR-492, Universit\u00e4t Karlsruhe (Revised November 1998)."},{"key":"391045_CR17","unstructured":"Harvey, W. and M. Ginsberg. (1995). \u201cLimited Discrepancy Search.\u201d In Proceedings of the 14th Int. Joint Conference on Artificial Intelligence (IJCAI-95)."},{"key":"391045_CR18","unstructured":"Heilmann, R. and C. Schwindt. (1997). \u201cLower Bounds for RCPSP\/max.\u201d Technical Report WIOR-511, Universit\u00e4t Karlsruhe."},{"key":"391045_CR19","volume-title":"Handbook on Recent Advances in Project Scheduling","author":"R. Kolisch","year":"1998","unstructured":"Kolisch, R., C. Schwindt, and A. Sprecher. (1998). \u201cBenchmark Instances for Project Scheduling Problems.\u201d In J. Weglarz (ed.), Handbook on Recent Advances in Project Scheduling. Dordrecht: Kluwer."},{"key":"391045_CR20","unstructured":"Laborie, P. and M. Ghallab. (1995). \u201cPlanning with Sharable Resource Constraints.\u201d In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-95)."},{"key":"391045_CR21","unstructured":"M\u00f6hring, R., F. Stork, and M. Uetz. (1998). \u201cResource Constrained Project Scheduling with Time Windows: A Branching Scheme Based on Dynamic Release Dates.\u201d Technical Report 596\/1998, Fachbereich Mathematick, Technische Universit\u00e4t Berlin."},{"key":"391045_CR22","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","volume":"7","author":"U. Montanari","year":"1974","unstructured":"Montanari, U. (1974). \u201cNetworks of Constraints: Fundamental Properties and Applications to Picture Processing.\u201d Information Sciences 7, 95\u2013132.","journal-title":"Information Sciences"},{"key":"391045_CR23","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF01545589","volume":"19","author":"K. Neumann","year":"1997","unstructured":"Neumann, K. and C. Schwindt. (1997). \u201cActivity-on-Node Networks with Minimal and Maximal Time Lags and Their Application to Make-to-Order Production.\u201d Operation Research Spektrum 19, 205\u2013217.","journal-title":"Operation Research Spektrum"},{"key":"391045_CR24","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF00123686","volume":"6","author":"K. Neumann","year":"1995","unstructured":"Neumann, K. and J. Zhan. (1995). \u201cHeuristics for the Minimum Project-Duration Problem with Minimal and Maximal Time Lags under Fixed Resource Constraints.\u201d Journal of Intelligent Manufacturing 6, 145\u2013154.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"2","key":"391045_CR25","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0377-2217(95)00354-1","volume":"90","author":"W. Nuijten","year":"1996","unstructured":"Nuijten, W. and E. Aarts. (1996). \u201cA Computational Study of Constraint Satisfaction for Multiple Capacitated Job Shop Scheduling.\u201d European Journal of Operational Research 90(2), 269\u2013284.","journal-title":"European Journal of Operational Research"},{"key":"391045_CR26","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1023\/A:1009687210594","volume":"3","author":"W. Nuijten","year":"1998","unstructured":"Nuijten, W. and C. Le Pape. (1998). \u201cConstraint-Based Job Shop Scheduling with ILOG-SCHEDULER.\u201d Journal of Heuristics 3, 271\u2013286.","journal-title":"Journal of Heuristics"},{"key":"391045_CR27","unstructured":"Oddi, A. and S.F. Smith. (1997). \u201cStochastic Procedures for Generating Feasible Schedules.\u201d In Proceedings 14th National Conference on AI (AAAI-97)."},{"key":"391045_CR28","unstructured":"Sadeh, N. (1991). \u201cLook-Ahead Techniques for Micro-opportunistic Job-Shop Scheduling.\u201d Ph.D. Thesis, School of Computer Science, Carnegie Mellon University."},{"key":"391045_CR29","unstructured":"Schwindt, C. (1996). \u201cGeneration of Resource Constrained Project Scheduling Problems with Minimal and Maximal Time Lags.\u201d Technical Report WIOR-489, Universit\u00e4t Karlsruhe."},{"key":"391045_CR30","unstructured":"Schwindt, C. (1998). \u201cA Branch and Bound Algorithm for the Resource-Constrained Project Duration Problem Subject to Temporal Constraints.\u201d Technical Report WIOR-544, Universit\u00e4t Karlsruhe."},{"key":"391045_CR31","unstructured":"Smith, S.F. and C. Cheng. (1993). \u201cSlack-Based Heuristics for Constraint Satisfaction Scheduling.\u201d In Proceedings 11th National Conference on AI (AAA1-93)."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013617802515.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1013617802515\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013617802515.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T10:57:30Z","timestamp":1747652250000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1013617802515"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["391045"],"URL":"https:\/\/doi.org\/10.1023\/a:1013617802515","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}