{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T16:41:17Z","timestamp":1771260077936,"version":"3.50.1"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"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":[[1998,10]]},"DOI":"10.1023\/a:1009723704757","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T17:50:41Z","timestamp":1040579441000},"page":"263-287","source":"Crossref","is-referenced-by-count":18,"title":["Resource Constraints for Preemptive Job-shop Scheduling"],"prefix":"10.1007","volume":"3","author":[{"given":"Claude Le","family":"Pape","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Baptiste","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"183539_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. & Beldiceanu, N. (1993). Extending CHIP in Order to Solve Complex Scheduling and Placement Problems. Mathematical and Computer Modelling17:57-73.","journal-title":"Mathematical and Computer Modelling"},{"key":"183539_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. & Cook, W. (1991). A Computational Study of the Job-Shop Scheduling Problem. ORSA Journal on Computing3:149-156.","journal-title":"ORSA Journal on Computing"},{"key":"183539_CR3","volume-title":"Constraint-Based Scheduling: Two Extensions","author":"P. Baptiste","year":"1994","unstructured":"Baptiste, Ph. (1994). Constraint-Based Scheduling: Two Extensions. MSc Thesis, University of Strathclyde, Glasgow, United Kingdom."},{"key":"183539_CR4","unstructured":"Baptiste, Ph. & Le Pape, C. (1995a). Disjunctive Constraints for Manufacturing Scheduling: Principles and Extensions. Proc. 3rd International Conference on Computer Integrated Manufacturing, 711-718, World Scientific."},{"key":"183539_CR5","unstructured":"Baptiste, Ph. & Le Pape, C. (1995b). A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling. Proc. 14th International Joint Conference on Artificial Intelligence, 600-606, Morgan Kaufmann."},{"key":"183539_CR6","volume-title":"Resource Constraints for Preemptive and Non-Preemptive Scheduling","author":"P. Baptiste","year":"1995","unstructured":"Baptiste, Ph. (1995). Resource Constraints for Preemptive and Non-Preemptive Scheduling. MSc Thesis, University Paris VI, Paris, France."},{"key":"183539_CR7","doi-asserted-by":"crossref","unstructured":"Baptiste, Ph. & Le Pape, C. (1997). Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems. Proc. 3rd International Conference on Principles and Practice of Constraint Programming, to appear.","DOI":"10.1007\/BFb0017454"},{"key":"183539_CR8","unstructured":"Beck, H. (1992). Constraint Monitoring in TOSCA. Proc. AAAI Spring Symposium on Practical Approaches to Planning and Scheduling."},{"key":"183539_CR9","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01539706","volume":"18","author":"P. Brucker","year":"1996","unstructured":"Brucker, P. & Thiele, O. (1996). A Branch and Bound Method for the General-Shop Problem with Sequence-Dependent Setup Times. OR Spektrum18:145-161.","journal-title":"OR Spektrum"},{"key":"183539_CR10","volume-title":"Scheduling in Dynamic Environments","author":"P. Burke","year":"1989","unstructured":"Burke, P. (1989). Scheduling in Dynamic Environments. PhD Thesis, University of Strathclyde, Glasgow, United Kingdom."},{"key":"183539_CR11","first-page":"106","volume":"6","author":"P. Burke","year":"1991","unstructured":"Burke, P. & Prosser, P. (1991). A Distributed Asynchronous System for Predictive and Reactive Scheduling. International Journal for Artificial Intelligence in Engineering6:106-124.","journal-title":"International Journal for Artificial Intelligence in Engineering"},{"key":"183539_CR12","volume-title":"Probl\u00e8mes d'ordonnancement \u00e0 contraintes de ressources: algorithmes et complexit\u00e9","author":"J. Carlier","year":"1984","unstructured":"Carlier, J. (1984). Probl\u00e8mes d'ordonnancement \u00e0 contraintes de ressources: algorithmes et complexit\u00e9. Th\u00e8se de Doctorat d'Etat, University Paris VI, Paris, France (in French)."},{"key":"183539_CR13","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF03543071","volume":"26","author":"J. Carlier","year":"1990","unstructured":"Carlier, J. & Pinson, E. (1990). A Practical Use of Jackson's Preemptive Schedule for Solving the Job-Shop Problem. Annals of Operations Research26:269-287.","journal-title":"Annals of Operations Research"},{"key":"183539_CR14","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0377-2217(94)90379-4","volume":"78","author":"J. Carlier","year":"1994","unstructured":"Carlier, J. & Pinson, E. (1994). Adjustment of Heads and Tails for the Job-Shop Problem. European Journal of Operational Research78:146-161.","journal-title":"European Journal of Operational Research"},{"key":"183539_CR15","unstructured":"Caseau, Y. & Laburthe, F. (1994). Improved CLP Scheduling with Task Intervals. Proc. 11th International Conference on Logic Programming, MIT Press."},{"key":"183539_CR16","doi-asserted-by":"crossref","unstructured":"Caseau, Y. & Laburthe, F. (1995a). Improving Branch and Bound for Job-Shop Scheduling with Constraint Propagation. Proc. 8th Franco-Japanese Conference on Combinatorics and Computer Science, Springer-Verlag.","DOI":"10.1007\/3-540-61576-8_79"},{"key":"183539_CR17","series-title":"Technical Report","volume-title":"Disjunctive Scheduling with Task Intervals","author":"Y. Caseau","year":"1995","unstructured":"Caseau, Y. & Laburthe, F. (1995b). Disjunctive Scheduling with Task Intervals. Technical Report, Ecole Normale Sup\u00e9rieure, Paris, France."},{"key":"183539_CR18","unstructured":"Caseau, Y. & Laburthe, F. (1996a). Cumulative Scheduling with Task Intervals. Proc. Joint International Conference and Symposium on Logic Programming, MIT Press."},{"key":"183539_CR19","volume-title":"CLAIRE: A Parametric Tool to Generate C++ Code for Problem Solving. Working Paper, Bouygues, Direction Scientifique","author":"Y. Caseau","year":"1996","unstructured":"Caseau, Y. & Laburthe, F. (1996b). CLAIRE: A Parametric Tool to Generate C++ Code for Problem Solving. Working Paper, Bouygues, Direction Scientifique, Saint-Quentin-en-Yvelines, France."},{"key":"183539_CR20","unstructured":"Cheng, C.-C. & Smith, S. F. (1994). Generating Feasible Schedules under Complex Metric Constraints. Proc. 12th National Conference on Artificial Intelligence, 1086-1091, MIT Press."},{"key":"183539_CR21","series-title":"Technical Report","doi-asserted-by":"crossref","DOI":"10.21236\/ADA293583","volume-title":"Applying Constraint Satisfaction Techniques to Job-Shop Scheduling","author":"C.-C. Cheng","year":"1995","unstructured":"Cheng, C.-C. & Smith, S. F. (1995a). Applying Constraint Satisfaction Techniques to Job-Shop Scheduling. Technical Report, Carnegie Mellon University, Pittsburgh, Pennsylvania."},{"key":"183539_CR22","unstructured":"Cheng, C.-C. & Smith, S. F. (1995b). A Constraint-Posting Framework for Scheduling under Complex Constraints. Proc. AAAI-SIGMAN Workshop on Intelligent Manufacturing Systems, 64-75."},{"key":"183539_CR23","unstructured":"Collinot, A. & Le Pape, C. (1987). Controlling Constraint Propagation. Proc. 10th International Joint Conference on Artificial Intelligence, 1032-1034, Morgan Kaufmann."},{"key":"183539_CR24","doi-asserted-by":"crossref","unstructured":"Colombani, Y. (1996). Constraint Programming: An Efficient and Practical Approach to Solving the Job-Shop Problem. Proc. 2nd International Conference on Principles and Practice of Constraint Programming, 149-163, Springer-Verlag.","DOI":"10.1007\/3-540-61551-2_72"},{"key":"183539_CR25","volume-title":"Optimal Algorithms for Various Classes of Multiple Resource-Constrained Project Scheduling Problems","author":"E. Demeulemeester","year":"1992","unstructured":"Demeulemeester, E. (1992). Optimal Algorithms for Various Classes of Multiple Resource-Constrained Project Scheduling Problems. PhD Thesis, Katholieke Universiteit Leuven, Leuven, Belgium."},{"key":"183539_CR26","volume-title":"Analyse sous contraintes et aide \u00e0 la d\u00e9cision pour certains probl\u00e8mes d'ordonnancement","author":"J. Erschler","year":"1976","unstructured":"Erschler, J. (1976). Analyse sous contraintes et aide \u00e0 la d\u00e9cision pour certains probl\u00e8mes d'ordonnancement. Th\u00e8se de Doctorat d'Etat, Universit\u00e9 Paul Sabatier, Toulouse, France (in French)."},{"key":"183539_CR27","first-page":"7","volume":"5","author":"J. Erschler","year":"1991","unstructured":"Erschler, J., Lopez, P., & Thuriot, C. (1991). Raisonnement temporel sous contraintes de ressource et probl\u00e8mes d'ordonnancement. Revue d'Intelligence Artificielle5:7-32 (in French).","journal-title":"Revue d'Intelligence Artificielle"},{"key":"183539_CR28","volume-title":"R\u00e8gles et processus d'inf\u00e9rence pour l'aide \u00e0 l'ordonnancement de t\u00e2ches en pr\u00e9sence de contraintes","author":"P. Esquirol","year":"1987","unstructured":"Esquirol, P. (1987). R\u00e8gles et processus d'inf\u00e9rence pour l'aide \u00e0 l'ordonnancement de t\u00e2ches en pr\u00e9sence de contraintes. PhD Thesis, Universit\u00e9 Paul Sabatier, Toulouse, France (in French)."},{"key":"183539_CR29","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1287\/mnsc.32.3.341","volume":"32","author":"A. Federgruen","year":"1986","unstructured":"Federgruen, A. & Groenevelt, H. (1986). Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques. Management Science32:341-349.","journal-title":"Management Science"},{"key":"183539_CR30","unstructured":"Fox, B. R. (1990). Chronological and Non-Chronological Scheduling. Proc. 1st IEEE Annual Conference on Artificial Intelligence, Simulation and Planning in High Autonomy Systems."},{"key":"183539_CR31","unstructured":"Garey, M. R. & Johnson, D. S. (1979). Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman and Company."},{"key":"183539_CR32","unstructured":"Gondran, M. & Minoux, M. (1995). Graphes et Algorithmes. Eyrolles (in French)."},{"key":"183539_CR33","first-page":"32","volume":"13","author":"V. Kumar","year":"1992","unstructured":"Kumar, V. (1992). Algorithms for Constraint Satisfaction Problems: A Survey. AI Magazine13:32-44.","journal-title":"AI Magazine"},{"key":"183539_CR34","unstructured":"Laborie, P. (1994). Planifier avec des contraintes de ressources. Proc. 2\u00e8mes rencontres des jeunes chercheurs en intelligence artificielle (in French)."},{"key":"183539_CR35","unstructured":"Le Pape, C. & Smith, S. F. (1987). Management of Temporal Constraints for Factory Scheduling. Proc. IFIP TC 8\/WG 8.1Working Conference on Temporal Aspects in Information Systems, 159-170, North-Holland."},{"key":"183539_CR36","volume-title":"Des syst\u00e8mes d'ordonnancement flexibles et opportunistes","author":"C. Le Pape","year":"1988","unstructured":"Le Pape, C. (1988). Des syst\u00e8mes d'ordonnancement flexibles et opportunistes. PhD Thesis, University Paris XI, Orsay, France (in French)."},{"key":"183539_CR37","series-title":"Technical Report","volume-title":"Constraint Propagation in Planning and Scheduling","author":"C. Le Pape","year":"1991","unstructured":"Le Pape, C. (1991). Constraint Propagation in Planning and Scheduling. Technical Report, Stanford University, Palo Alto, California."},{"key":"183539_CR38","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 Engineering3:55-66.","journal-title":"Intelligent Systems Engineering"},{"key":"183539_CR39","doi-asserted-by":"crossref","unstructured":"Le Pape, C. (1996). An Application of Constraint Programming to a Specific Production Scheduling Problem. Belgian Journal of Operations Research, Statistics and Computer Science (to appear).","DOI":"10.1049\/ic:19961103"},{"key":"183539_CR40","volume-title":"M\u00e9thodes par d\u00e9composition temporelle et probl\u00e8mes d'ordonnancement","author":"M.-L. L\u00e9vy","year":"1996","unstructured":"L\u00e9vy, M.-L. (1996). M\u00e9thodes par d\u00e9composition temporelle et probl\u00e8mes d'ordonnancement. PhD Thesis, Institut National Polytechnique de Toulouse, Toulouse, France (in French)."},{"key":"183539_CR41","unstructured":"Lhomme, O. (1993). Consistency Techniques for Numeric CSPs. Proc. 13th International Joint Conference on Artificial Intelligence, 232-238, Morgan Kaufmann."},{"key":"183539_CR42","series-title":"Working Paper","volume-title":"An Implementation of the Cumulative Constraint","author":"H. C. R. Lock","year":"1996","unstructured":"Lock, H. C. R. (1996). An Implementation of the Cumulative Constraint. Working Paper, University of Karlsruhe, Karlsruhe, Germany."},{"key":"183539_CR43","volume-title":"Approche \u00e9nerg\u00e9tique pour l'ordonnancement de t\u00e2ches sous contraintes de temps et de ressources","author":"P. Lopez","year":"1991","unstructured":"Lopez, P. (1991). Approche \u00e9nerg\u00e9tique pour l'ordonnancement de t\u00e2ches sous contraintes de temps et de ressources. PhD Thesis, Universit\u00e9 Paul Sabatier, Toulouse, France (in French)."},{"key":"183539_CR44","first-page":"453","volume":"26","author":"P. Lopez","year":"1992","unstructured":"Lopez, P., Erschler, J., & Esquirol, P. (1992). Ordonnancement de t\u00e2ches sous contraintes: une approche \u00e9nerg\u00e9tique. RAIRO APII 26:453-481 (in French).","journal-title":"RAIRO APII"},{"key":"183539_CR45","doi-asserted-by":"crossref","unstructured":"Martin, P. & Shmoys, D. B. (1996). A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem. Proc. 5th International Conference on Integer Programming and Combinatorial Optimization.","DOI":"10.1007\/3-540-61310-2_29"},{"key":"183539_CR46","unstructured":"Nuijten, W. P. M. & Aarts, E. H. L. (1994). Constraint Satisfaction for Multiple Capacitated Job-Shop Scheduling. Proc. 11th European Conference on Artificial Intelligence, 635-639, John Wiley and Sons."},{"key":"183539_CR47","volume-title":"Time and Resource Constrained Scheduling: A Constraint Satisfaction Approach","author":"W. P. M. Nuijten","year":"1994","unstructured":"Nuijten, W. P. M. (1994). Time and Resource Constrained Scheduling: A Constraint Satisfaction Approach. PhD Thesis, Eindhoven University of Technology, Eindhoven, The Netherlands."},{"key":"183539_CR48","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0377-2217(95)00354-1","volume":"90","author":"W. P. M. Nuijten","year":"1996","unstructured":"Nuijten, W. P. M. & Aarts, E. H. L. (1996). A Computational Study of Constraint Satisfaction for Multiple Capacitated Job-Shop Scheduling. European Journal of Operational Research90:269-284.","journal-title":"European Journal of Operational Research"},{"key":"183539_CR49","unstructured":"Pegman, M., Forward, N., King, B., & Teal, D. (1997). Mine Planning and Scheduling at RTZ Technical Services. Proc. 3rd International Conference and Exhibition on the Practical Application of Constraint Technology, 273-285, The Practical Application Company."},{"key":"183539_CR50","volume-title":"Le probl\u00e8me de job-shop","author":"E. Pinson","year":"1988","unstructured":"Pinson, E. (1988). Le probl\u00e8me de job-shop. PhD Thesis, University Paris VI, Paris, France (in French)."},{"key":"183539_CR51","volume-title":"Distributed Asynchronous Scheduling","author":"P. Prosser","year":"1990","unstructured":"Prosser, P. (1990). Distributed Asynchronous Scheduling. PhD Thesis, University of Strathclyde, Glasgow, United Kingdom."},{"key":"183539_CR52","series-title":"Technical Report","volume-title":"A C++ Implementation of CLP","author":"J.-F. Puget","year":"1994","unstructured":"Puget, J.-F. (1994). A C++ Implementation of CLP. Technical Report, ILOG S.A., Gentilly, France."},{"key":"183539_CR53","unstructured":"Puget, J.-F. & Leconte, M. (1995), Beyond the Glass Box: Constraints as Objects. Proc. International Symposium on Logic Programming, MIT Press."},{"key":"183539_CR54","unstructured":"R\u00e9gin, J.-C. (1994). A Filtering Algorithm for Constraints of Difference in CSPs. Proc. 12th National Conference on Artificial Intelligence, 362-367, MIT Press."},{"key":"183539_CR55","volume-title":"D#x00E9;veloppement d'outils algorithmiques pour l'Intelligence Artificielle. Application \u00e0 la chimie organique","author":"J.-C. R#x00E9;gin","year":"1995","unstructured":"R\u00e9gin, J.-C. (1995). D\u00e9veloppement d'outils algorithmiques pour l'Intelligence Artificielle. Application \u00e0 la chimie organique. PhD Thesis, University Montpellier II, Montpellier, France (in French)."},{"key":"183539_CR56","unstructured":"R\u00e9gin, J.-C. (1996). Generalized Arc-Consistency for Global Cardinality Constraint\u201d Proc. 13th National Conference on Artificial Intelligence, 209-215, MIT Press."},{"key":"183539_CR57","unstructured":"Rit, J.-F. (1986). Propagating Temporal Constraints for Scheduling. Proc. 5th National Conference on Artificial Intelligence, 383-388, MIT Press."},{"key":"183539_CR58","series-title":"Technical Report","doi-asserted-by":"crossref","DOI":"10.21236\/ADA133417","volume-title":"Exploiting Temporal Knowledge to Organize Constraints","author":"S. F. Smith","year":"1983","unstructured":"Smith, S. F. (1983). Exploiting Temporal Knowledge to Organize Constraints. Technical Report, Carnegie Mellon University, Pittsburgh, Pennsylvania."},{"key":"183539_CR59","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1080\/09537289208919407","volume":"3","author":"S. F. Smith","year":"1992","unstructured":"Smith, S. F. (1992). Knowledge-Based Production Management: Approaches, Results and Prospects. Production Planning and Control3:350-380.","journal-title":"Production Planning and Control"},{"key":"183539_CR60","unstructured":"Smith, S. F. & Cheng, C.-C. (1993). Slack-Based Heuristics for Constraint Satisfaction Scheduling. Proc. 11th National Conference on Artificial Intelligence, 139-144, MIT Press."},{"key":"183539_CR61","unstructured":"Smith, S. F. (1994). OPIS: A Methodology and Architecture for Reactive Scheduling. In: Zweben, M. & Fox, M. (editors), Intelligent Scheduling. Morgan Kaufmann."},{"key":"183539_CR62","unstructured":"Varnier, C., Baptiste, P., & Legeard, B. (1993). Le traitement des contraintes disjonctives dans un probl\u00e8me d'ordonnancement: exemple du Hoist Scheduling Problem. Proc. 2\u00e8mes journ\u00e9es francophones de programmation logique, 343-363 (in French)."},{"key":"183539_CR63","doi-asserted-by":"crossref","first-page":"1588","DOI":"10.1109\/21.257756","volume":"23","author":"M. Zweben","year":"1993","unstructured":"Zweben, M., Davis, E., Daun, B., & Deale, M. J. (1993). Scheduling and Rescheduling with Iterative Repair. IEEE Transactions on Systems, Man, and Cybernetics23:1588-1596.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009723704757.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009723704757\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009723704757.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:45:38Z","timestamp":1752378338000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009723704757"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":63,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["183539"],"URL":"https:\/\/doi.org\/10.1023\/a:1009723704757","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,10]]}}}