{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T11:52:12Z","timestamp":1773143532683,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"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,1]]},"DOI":"10.1023\/a:1009822502231","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T18:53:29Z","timestamp":1040583209000},"page":"119-139","source":"Crossref","is-referenced-by-count":51,"title":["Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems"],"prefix":"10.1007","volume":"5","author":[{"given":"Philippe","family":"Baptiste","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claude Le","family":"Pape","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"243796_CR1","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0895-7177(93)90068-A","volume":"17","author":"A. Aggoun","year":"1993","unstructured":"Aggoun A. and Beldiceanu N. (1993). Extending CHIP in Order to Solve Complex Scheduling and Placement Problems. Mathematical and Computer Modelling 17:57-73.","journal-title":"Mathematical and Computer Modelling"},{"issue":"2","key":"243796_CR2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D. Applegate","year":"1991","unstructured":"Applegate D. and Cook W. (1991). A Computational Study of the Job-Shop Scheduling Problem. ORSA Journal on Computing 3(2):149-156.","journal-title":"ORSA Journal on Computing"},{"key":"243796_CR3","unstructured":"Baptiste Ph. and Le Pape C. (1995). A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling. Proceedings of the 14th International Joint Conference on Artificial Intelligence."},{"key":"243796_CR4","unstructured":"Baptiste Ph., Le Pape C. and Nuijten W. P. M. (1998). Satisfiability Tests and Time-Bound Adjustments for Cumulative Scheduling Problems. Research Report 98-97, Universit\u00e9 de Technologie de Compi\u00e8gne (http:\/\/www.hds.utc.fr\/~baptiste)."},{"key":"243796_CR5","doi-asserted-by":"crossref","unstructured":"Brucker P., Knust S., Schoo A. and Thiele O. (1997). A Branch and Bound Algorithm for the Resource-Constrained Project Scheduling Problem. Working Paper, University of Osnabr\u00fcck.","DOI":"10.1016\/S0377-2217(97)00335-4"},{"issue":"3","key":"243796_CR6","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1051\/ro\/1991250303111","volume":"25","author":"J. Carlier","year":"1991","unstructured":"Carlier J. and Latapie B. (1991). Une m\u00e9thode arborescente pour r\u00e9soudre les probl\u00e8mes cumulatifs. RAIRO Recherche op\u00e9rationnelle \/ Operations Research 25(3):311-340.","journal-title":"RAIRO Recherche op\u00e9rationnelle \/ Operations Research"},{"key":"243796_CR7","unstructured":"Carlier J. and N\u00b4eron E. (1996). A New Branch-and-Bound Method for Solving the Resource-Constrained Project Scheduling Problem. Proceedings of the International Workshop on Production Planning and Control."},{"key":"243796_CR8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF03543071","volume":"26","author":"J. Carlier","year":"1990","unstructured":"Carlier J. and Pinson E. (1990). A Practical Use of Jackson's Preemptive Schedule for Solving the Job-Shop Problem. Annals of Operations Research 26:269-287.","journal-title":"Annals of Operations Research"},{"key":"243796_CR9","unstructured":"Carlier J. and Pinson E. (1996). Jackson's Pseudo-Preemptive Schedule for the Pm\/ri,qi\/Cmax Scheduling Problem.Technical Report, Universit\u00e9 de Technologie de Compi\u00e8gne."},{"key":"243796_CR10","unstructured":"Caseau Y. and Laburthe F. (1995). Disjunctive Scheduling with Task Intervals. Technical Report, Ecole Normale Sup\u00e9rieure."},{"key":"243796_CR11","unstructured":"Caseau Y. and Laburthe F. (1996a). Cumulative Scheduling with Task Intervals. Proceedings of the Joint International Conference and Symposium on Logic Programming."},{"key":"243796_CR12","unstructured":"Caseau Y. and Laburthe F. (1996b). CLAIRE: A Parametric Tool to Generate C++ Code for Problem Solving. Working Paper, Bouygues, Direction Scientifique."},{"key":"243796_CR13","doi-asserted-by":"crossref","unstructured":"Cesta A. and Oddi A. (1996). Gaining Efficiency and Flexibility in the Simple Temporal Problem. Proceedings of the 3rd International Workshop on Temporal Representation and Reasoning.","DOI":"10.1109\/TIME.1996.555676"},{"key":"243796_CR14","doi-asserted-by":"crossref","unstructured":"Colombani Y. (1996). Constraint Programming: An Efficient and Practical Approach to Solving the Job-Shop Problem. Proceedings of the 2nd International Conference on Principles and Practice of Constraint Programming, 149-163, Springer-Verlag.","DOI":"10.1007\/3-540-61551-2_72"},{"issue":"12","key":"243796_CR15","doi-asserted-by":"crossref","first-page":"1803","DOI":"10.1287\/mnsc.38.12.1803","volume":"38","author":"E. Demeulemeester","year":"1992","unstructured":"Demeulemeester E. and Herroelen W. (1992). A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem. Management Science 38(12):1803-1818.","journal-title":"Management Science"},{"key":"243796_CR16","unstructured":"De Reyck B. and Herroelen W. (1995). Assembly Line Balancing by Resource-Constrained Project Scheduling Techniques: A Critical Appraisal. Technical Report, Katholieke Universiteit Leuven."},{"key":"243796_CR17","unstructured":"GareyM. R. and Johnson D. S. (1979). Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman and Company."},{"key":"243796_CR18","unstructured":"Gondran M. and Minoux M. (1984). Graphs and Algorithms. John Wiley and Sons."},{"issue":"10","key":"243796_CR19","doi-asserted-by":"crossref","first-page":"1693","DOI":"10.1287\/mnsc.41.10.1693","volume":"41","author":"R. Kolisch","year":"1995","unstructured":"Kolisch R., Sprecher A., and Drexl A. (1995). Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems. Management Science 41(10):1693-1703.","journal-title":"Management Science"},{"issue":"2","key":"243796_CR20","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1049\/ise.1994.0009","volume":"3","author":"C. Le Pape","year":"1994","unstructured":"Le Pape C. (1994). Implementation of Resource Constraints in Ilog Schedule: A Library for the Development of Constraint-Based Scheduling Systems. Intelligent Systems Engineering 3(2):55-66.","journal-title":"Intelligent Systems Engineering"},{"key":"243796_CR21","unstructured":"Le Pape C. and Baptiste Ph. (1996). Constraint Propagation Techniques for Disjunctive Scheduling: The Preemptive Case. Proceedings of the 12th European Conference on Artificial Intelligence."},{"key":"243796_CR22","unstructured":"Le Pape C. and Baptiste Ph. (1997). A Constraint Programming Library for Preemptive and Non-Preemptive Scheduling. Proceedings of the 3rd International Conference on the Practical Application of Constraint Technology."},{"key":"243796_CR23","unstructured":"Lhomme O. (1993). Consistency Techniques for Numeric CSPs. Proceedings of the 13th International Joint Conference on Artificial Intelligence."},{"key":"243796_CR24","first-page":"453","volume":"26","author":"P. Lopez","year":"1992","unstructured":"Lopez P., Erschler J. and Esquirol P. (1992). Ordonnancement de t\u00e2ches sous contraintes: une approche \u00e9nerg\u00e9tique. RAIRO Automatique, Productique, Informatique Industrielle 26:453-481.","journal-title":"RAIRO Automatique, Productique, Informatique Industrielle"},{"issue":"11","key":"243796_CR25","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1287\/mnsc.16.11.728","volume":"16","author":"A. A. Mastor","year":"1970","unstructured":"Mastor A. A. (1970). An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques. Management Science 16(11):728-746.","journal-title":"Management Science"},{"key":"243796_CR26","unstructured":"Nuijten W. P. M. (1994). Time and Resource Constrained Scheduling: A Constraint Satisfaction Approach. PhD Thesis, Eindhoven University of Technology."},{"issue":"7","key":"243796_CR27","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1287\/mnsc.30.7.854","volume":"30","author":"J. H. Patterson","year":"1984","unstructured":"Patterson J. H. (1984). A Comparison of Exact Approaches for Solving the Multiple Constrained Resource Project Scheduling Problem. Management Science 30(7):854-867.","journal-title":"Management Science"},{"key":"243796_CR28","unstructured":"Perregaard M. (1995). Branch and Bound Methods for the Multi-Processor Job Shop and Flow Shop Scheduling Problem. MSc Thesis, University of Copenhagen."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009822502231.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009822502231\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009822502231.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:42:47Z","timestamp":1752378167000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009822502231"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":28,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["243796"],"URL":"https:\/\/doi.org\/10.1023\/a:1009822502231","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}