{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T06:45:24Z","timestamp":1763016324785,"version":"3.40.5"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1999,10,1]],"date-time":"1999-10-01T00:00:00Z","timestamp":938736000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,10,1]],"date-time":"1999-10-01T00:00:00Z","timestamp":938736000000},"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":[[1999,10]]},"DOI":"10.1023\/a:1009613717770","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T22:47:08Z","timestamp":1040597228000},"page":"305-325","source":"Crossref","is-referenced-by-count":13,"title":["Heuristic Control of a Constraint-Based Algorithm for the Preemptive Job-Shop Scheduling Problem"],"prefix":"10.1007","volume":"5","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":"238060_CR1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J. Adams","year":"1988","unstructured":"Adams, J., E. Balas, and D. Zawack. (1988). \u201cThe Shifting Bottleneck Procedure for Job-Shop Scheduling,\u201d Management Science 34, 391\u2013401.","journal-title":"Management Science"},{"key":"238060_CR2","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 N. Beldiceanu. (1993). \u201cExtending CHIP in Order to Solve Complex Scheduling and Placement Problems,\u201d Mathematical and Computer Modelling 17, 57\u201373.","journal-title":"Mathematical and Computer Modelling"},{"key":"238060_CR3","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 W. Cook. (1991). \u201cAComputational Study of the Job-Shop Scheduling Problem,\u201d ORSA Journal on Computing 3, 149\u2013156.","journal-title":"ORSA Journal on Computing"},{"key":"238060_CR4","unstructured":"Baptiste, Ph. and C. Le Pape. (1995). \u201cA Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling.\u201d Proc. 14th International Joint Conference on Artificial Intelligence. Morgan Kaufmann, pp. 600\u2013606."},{"key":"238060_CR5","unstructured":"Baptiste, Ph., C. Le Pape, and W.P.M. Nuijten. (1995). \u201cConstraint-Based Optimization and Approximation for Job-Shop Scheduling.\u201d Proc. AAAI-SIGMAN Workshop on Intelligent Manufacturing Systems, pp. 5\u201316."},{"key":"238060_CR6","doi-asserted-by":"crossref","unstructured":"Baptiste, Ph. and C. Le Pape. (1997). \u201cConstraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems.\u201d Proc. 3rd International Conference on Principles and Practice of Constraint Programming. Springer-Verlag, pp. 375\u2013389.","DOI":"10.1007\/BFb0017454"},{"key":"238060_CR7","unstructured":"Beck, H. (1992). \u201cConstraint Monitoring in TOSCA.\u201d Proc. AAAI Spring Symposium on Practical Approaches to Planning and Scheduling."},{"key":"238060_CR8","unstructured":"Beck, J.C., A.J. Davenport, E.M. Sitarski, and M.S. Fox. (1997). \u201cTexture-Based Heuristics for Scheduling Revisited.\u201d Proc. 14th National Conference on Artificial Intelligence. MIT Press."},{"key":"238060_CR9","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0166-218X(94)90204-6","volume":"49","author":"P. Brucker","year":"1994","unstructured":"Brucker, P., B. Jurisch, and B. Sievers. (1994). \u201cA Branch and Bound Algorithm for the Job-Shop Scheduling Problem,\u201d Discrete Applied Mathematics 49, 107\u2013127.","journal-title":"Discrete Applied Mathematics"},{"key":"238060_CR10","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01539706","volume":"18","author":"P. Brucker","year":"1996","unstructured":"Brucker, P. and O. Thiele. (1996). \u201cA Branch and Bound Method for the General-Shop Problem with Sequence-Dependent Setup Times,\u201d OR Spektrum 18, 145\u2013161.","journal-title":"OR Spektrum"},{"key":"238060_CR11","doi-asserted-by":"crossref","unstructured":"Brucker, P., S. Knust, A. Schoo, and O. Thiele. (1997). \u201cA Branch and Bound Algorithm for the Resource-Constrained Project Scheduling Problem.\u201d Working Paper, University of Osnabr\u00fcck, Germany.","DOI":"10.1016\/S0377-2217(97)00335-4"},{"key":"238060_CR12","volume-title":"Scheduling in Dynamic Environments","author":"P. Burke","year":"1989","unstructured":"Burke, P. (1989). \u201cScheduling in Dynamic Environments.\u201d Ph.D. thesis, University of Strathclyde, Glasgow, United Kingdom."},{"key":"238060_CR13","first-page":"106","volume":"6","author":"P. Burke","year":"1991","unstructured":"Burke, P. and P. Prosser. (1991). \u201cA Distributed Asynchronous System for Predictive and Reactive Scheduling,\u201dInternational Journal for Artificial Intelligence in Engineering 6, 106\u2013124.","journal-title":"International Journal for Artificial Intelligence in Engineering"},{"key":"238060_CR14","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF03543071","volume":"26","author":"J. Carlier","year":"1990","unstructured":"Carlier, J. and E. Pinson. (1990). \u201cA Practical Use of Jackson's Preemptive Schedule for Solving the Job-Shop Problem,\u201d Annals of Operations Research 26, 269\u2013287.","journal-title":"Annals of Operations Research"},{"key":"238060_CR15","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. and E. Pinson. (1994). \u201cAdjustment of Heads and Tails for the Job-Shop Problem,\u201d European Journal of Operational Research 78, 146\u2013161.","journal-title":"European Journal of Operational Research"},{"key":"238060_CR16","unstructured":"Caseau, Y. and F. Laburthe. (1994). \u201cImproved CLP Scheduling with Task Intervals.\u201d Proc. 11th International Conference on Logic Programming. MIT Press."},{"key":"238060_CR17","unstructured":"Caseau, Y. and F. Laburthe. (1995). \u201cDisjunctive Scheduling with Task Intervals.\u201d Technical Report, Ecole Normale Sup\u00e9rieure, Paris, France."},{"key":"238060_CR18","unstructured":"Caseau, Y. and F. Laburthe. (1996a). \u201cCumulative Scheduling with Task Intervals.\u201d Proc. Joint International Conference and Symposium on Logic Programming."},{"key":"238060_CR19","unstructured":"Caseau, Y. and F. Laburthe. (1996b). \u201cCLAIRE: A Parametric Tool to Generate C++ Code for Problem Solving,\u201d Working Paper, Bouygues, Direction Scientifique, Saint-Quentin-en-Yvelines, France."},{"key":"238060_CR20","doi-asserted-by":"crossref","unstructured":"Cesta, A. and A. Oddi. (1996). \u201cGaining Efficiency and Flexibility in the Simple Temporal Problem.\u201d Proc. 3rd International Workshop on Temporal Representation and Reasoning, pp. 45\u201350.","DOI":"10.1109\/TIME.1996.555676"},{"key":"238060_CR21","unstructured":"Cheng, C.-C. and S.F. Smith. (1994). \u201cGenerating Feasible Schedules under Complex Metric Constraints.\u201d Proc. 12th National Conference on Artificial Intelligence. MIT Press, pp. 1086\u20131091."},{"key":"238060_CR22","doi-asserted-by":"crossref","unstructured":"Cheng, C.-C. and S.F. Smith. (1995a). \u201cApplying Constraint Satisfaction Techniques to Job-Shop Scheduling.\u201d Technical Report, Carnegie Mellon University, Pittsburgh, Pennsylvania.","DOI":"10.21236\/ADA293583"},{"key":"238060_CR23","unstructured":"Cheng, C.-C. and S.F. Smith. (1995b). \u201cA Constraint-Posting Framework for Scheduling under Complex Constraints.\u201dProc. AAAI-SIGMAN Workshop on Intelligent Manufacturing Systems, pp. 64\u201375."},{"key":"238060_CR24","unstructured":"Collinot, A. and C. Le Pape. (1987). \u201cControlling Constraint Propagation.\u201d Proc. 10th International Joint Conference on Artificial Intelligence. Morgan Kaufmann, pp. 1032\u20131034."},{"key":"238060_CR25","doi-asserted-by":"crossref","unstructured":"Colombani, Y. (1996). \u201cConstraint Programming: An Efficient and Practical Approach to Solving the Job-Shop Problem.\u201d Proc. 2nd International Conference on Principles and Practice of Constraint Programming. Springer-Verlag, pp. 149\u2013163.","DOI":"10.1007\/3-540-61551-2_72"},{"key":"238060_CR26","volume-title":"Un mod\u00e9ele de r\u00e9solution de contraintes adapt\u00e9 aux probl\u00e9mes d'ordonnancement","author":"Y. Colombani","year":"1997","unstructured":"Colombani, Y. (1997). \u201cUn mod\u00e9ele de r\u00e9solution de contraintes adapt\u00e9 aux probl\u00e9mes d'ordonnancement.\u201d Ph.D. thesis, Universit\u00e9 de la M\u00e9diterran\u00e9e, Aix-Marseille II, France (in French)."},{"key":"238060_CR27","volume-title":"Optimal Algorithms for Various Classes of Multiple Resource-Constrained Project Scheduling Problems","author":"E. Demeulemeester","year":"1992","unstructured":"Demeulemeester, E. (1992). \u201cOptimal Algorithms for Various Classes of Multiple Resource-Constrained Project Scheduling Problems.\u201d Ph.D. thesis, Katholieke Universiteit Leuven, Leuven, Belgium."},{"key":"238060_CR28","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1287\/opre.24.4.774","volume":"24","author":"J. Erschler","year":"1976","unstructured":"Erschler, J., F. Roubellat, and J.-P. Vernhes. (1976). \u201cFinding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem,\u201d Operations Research 24, 774\u2013783.","journal-title":"Operations Research"},{"key":"238060_CR29","first-page":"7","volume":"5","author":"J. Erschler","year":"1991","unstructured":"Erschler, J., P. Lopez, and C. Thuriot. (1991). \u201cRaisonnement temporel sous contraintes de ressource et probl\u00e9mes d'ordonnancement,\u201d Revue d'Intelligence Artificielle 5, 7\u201332 (in French).","journal-title":"Revue d'Intelligence Artificielle"},{"key":"238060_CR30","volume-title":"Constraint-Directed Search: A Case Study of Job-Shop Scheduling","author":"M.S. Fox","year":"1983","unstructured":"Fox, M.S. (1983). \u201cConstraint-Directed Search: A Case Study of Job-Shop Scheduling.\u201d Ph.D. thesis, Carnegie-Mellon University, Pittsburgh, Pennsylvania."},{"key":"238060_CR31","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1111\/j.1468-0394.1984.tb00424.x","volume":"1","author":"M.S. Fox","year":"1984","unstructured":"Fox, M.S. and S.F. Smith. (1984). \u201cISIS: A Knowledge-Based System for Factory Scheduling,\u201d Expert Systems 1, 25\u201349.","journal-title":"Expert Systems"},{"key":"238060_CR32","unstructured":"Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H. Freeman and Company."},{"key":"238060_CR33","unstructured":"Gondran, M. and M. Minoux. (1984). Graphs and Algorithms. John Wiley and Sons."},{"key":"238060_CR34","unstructured":"Harvey, W.D. and M.L. Ginsberg. (1995). \u201cLimited Discrepancy Search.\u201d Proc. 14th International Joint Conference on Artificial Intelligence. Morgan Kaufmann, pp. 607\u2013613."},{"key":"238060_CR35","unstructured":"Korf, R.E. (1996). \u201cImproved Limited Discrepancy Search.\u201d Proc. 13th National Conference on Artificial Intelligence. MIT Press, pp. 286\u2013291."},{"key":"238060_CR36","unstructured":"Le Pape, C. and.F. Smith. (1987). \u201cManagement of Temporal Constraints for Factory Scheduling.\u201d Proc. IFIP TC 8\/WG 8.1 Working Conference on Temporal Aspects in Information Systems. North-Holland, pp. 159\u2013170."},{"key":"238060_CR37","volume-title":"Des syst\u00e9mes d'ordonnancement flexibles et opportunistes","author":"C. Le Pape","year":"1988","unstructured":"Le Pape, C. (1988). \u201cDes syst\u00e9mes d'ordonnancement flexibles et opportunistes.\u201d Ph.D. thesis, University Paris XI, Orsay, France (in French)."},{"key":"238060_CR38","unstructured":"Le Pape, C. (1991). \u201cConstraint Propagation in Planning and Scheduling.\u201d Technical Report, Stanford University, Palo Alto, California."},{"key":"238060_CR39","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). \u201cImplementation of Resource Constraints in ILOG SCHEDULE: A Library for the Development of Constraint-Based Scheduling Systems,\u201d Intelligent Systems Engineering 3, 55\u201366.","journal-title":"Intelligent Systems Engineering"},{"key":"238060_CR40","unstructured":"Le Pape, C. and Ph. Baptiste. (1996). \u201cConstraint Propagation Techniques for Disjunctive Scheduling: The Preemptive Case.\u201d Proc. 12th European Conference on Artificial Intelligence. John Wiley and Sons, pp. 619\u2013623."},{"key":"238060_CR41","unstructured":"Le Pape, C. and Ph. Baptiste. (1997a). \u201cAn Experimental Comparison of Constraint-Based Algorithms for the Preemptive Job-Shop Scheduling Problem.\u201d Proc. CP Workshop on Industrial Constraint-Directed Scheduling."},{"key":"238060_CR42","unstructured":"Le Pape, C. and Ph. Baptiste. (1997b). \u201cA Constraint Programming Library for Preemptive and Non-Preemptive Scheduling.\u201d Proc. 3rd International Conference and Exhibition on the Practical Application of Constraint Technology. The Practical Application Company, pp. 237\u2013256."},{"key":"238060_CR43","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1023\/A:1009723704757","volume":"3","author":"C. Le Pape","year":"1998","unstructured":"Le Pape, C. and Ph. Baptiste. (1998). \u201cResource Constraints for Preemptive Job-Shop Scheduling,\u201d Constraints 3, 263\u2013287.","journal-title":"Constraints"},{"key":"238060_CR44","unstructured":"Lock, H.C.R. (1996). \u201cAn Implementation of the Cumulative Constraint.\u201dWorking Paper, University of Karlsruhe, Karlsruhe, Germany."},{"key":"238060_CR45","volume-title":"Approche \u00e9nerg\u00e9tique pour l'ordonnancement de tOaches sous contraintes de temps et de ressources","author":"P. Lopez","year":"1991","unstructured":"Lopez, P. (1991). \u201cApproche \u00e9nerg\u00e9tique pour l'ordonnancement de tOaches sous contraintes de temps et de ressources.\u201d Ph.D. thesis, Universit\u00e9 Paul Sabatier, Toulouse, France (in French)."},{"key":"238060_CR46","doi-asserted-by":"crossref","unstructured":"Martin, P. and D.B. Shmoys. (1996). \u201cA New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem.\u201d Proc. 5th International Conference on Integer Programming and Combinatorial Optimization.","DOI":"10.1007\/3-540-61310-2_29"},{"key":"238060_CR47","doi-asserted-by":"crossref","unstructured":"Mattfeld, D.C. (1996). Evolutionary Search and the Job-Shop: Investigations on Genetic Algorithms for Production Scheduling. Physica-Verlag.","DOI":"10.1007\/978-3-662-11712-5"},{"key":"238060_CR48","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E. Nowicki","year":"1996","unstructured":"Nowicki, E. and C. Smutnicki. (1996). \u201cA Fast Taboo Search Algorithm for the Job-Shop Problem,\u201d Management Science 42, 797\u2013813.","journal-title":"Management Science"},{"key":"238060_CR49","unstructured":"Nuijten, W.P.M. and E.H.L. Aarts. (1994). \u201cConstraint Satisfaction for Multiple Capacitated Job-Shop Scheduling.\u201d Proc. 11th European Conference on Artificial Intelligence. John Wiley and Sons, pp. 635\u2013639."},{"key":"238060_CR50","volume-title":"Time and Resource Constrained Scheduling: AConstraint Satisfaction Approach","author":"W.P.M. Nuijten","year":"1994","unstructured":"Nuijten, W.P.M. (1994). \u201cTime and Resource Constrained Scheduling: AConstraint Satisfaction Approach.\u201d Ph.D. thesis, Pindhoven University of Technology, Eindhoven, The Netherlands."},{"key":"238060_CR51","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. and E.H.L. Aarts. (1996). \u201cA Computational Study of Constraint Satisfaction for Multiple Capacitated Job-Shop Scheduling,\u201d European Journal of Operational Research 90, 269\u2013284.","journal-title":"European Journal of Operational Research"},{"key":"238060_CR52","volume-title":"Le probl\u00e9me de job-shop: arbitrages et ajustements","author":"L. P\u00e9ridy","year":"1996","unstructured":"P\u00e9ridy, L. (1996). \u201cLe probl\u00e9me de job-shop: arbitrages et ajustements.\u201d Ph.D. thesis, Universit\u00e9 de Technologie de Compi\u00e9gne, Compi\u00e9gne, France (in French)."},{"key":"238060_CR53","volume-title":"Le probl\u00e9me de job-shop","author":"E. Pinson","year":"1988","unstructured":"Pinson, E. (1988). \u201cLe probl\u00e9me de job-shop.\u201d Ph.D. thesis, University Paris VI, Paris, France (in French)."},{"key":"238060_CR54","volume-title":"Distributed Asynchronous Scheduling","author":"P. Prosser","year":"1990","unstructured":"Prosser, P. (1990). \u201cDistributed Asynchronous Scheduling.\u201d Ph.D. thesis, University of Strathclyde, Glasgow, United Kingdom."},{"key":"238060_CR55","unstructured":"Rit, J.-F. (1986). \u201cPropagating Temporal Constraints for Scheduling.\u201d Proc. 5th National Conference on Artificial Intelligence. MIT Press, pp. 383\u2013388."},{"key":"238060_CR56","first-page":"45","volume":"7","author":"S.F. Smith","year":"1986","unstructured":"Smith, S.F., M.S. Fox, and P.S. Ow. (1986). \u201cConstructing and Maintaining Detailed Production Plans: Investigations into the Development of Knowledge-Based Factory Scheduling Systems,\u201d AI Magazine 7, 45\u201361.","journal-title":"AI Magazine"},{"key":"238060_CR57","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1080\/09537289208919407","volume":"3","author":"S.F. Smith","year":"1992","unstructured":"Smith, S.F. (1992). \u201cKnowledge-Based Production Management: Approaches, Results and Prospects,\u201d Production Planning and Control 3, 350\u2013380.","journal-title":"Production Planning and Control"},{"key":"238060_CR58","unstructured":"Steele, G.L. Jr. (1980). \u201cThe Definition and Implementation of a Computer Programming Language Based on Constraints.\u201d Ph.D. thesis, Massachusetts Institute of Technology."},{"key":"238060_CR59","volume-title":"Job-Shop Scheduling by Local Search","author":"R.J.M. Vaessens","year":"1994","unstructured":"Vaessens, R.J.M., E.H.L. Aarts, and J.K. Lenstra. (1994). \u201cJob-Shop Scheduling by Local Search.\u201d COSOR Memorandum 94-05, Eindhoven University of Technology, Eindhoven, The Netherlands."},{"key":"238060_CR60","unstructured":"Varnier, C., P. Baptiste, and B. Legeard. (1993). \u201cLe traitement des contraintes disjonctives dans un probl\u00e9me d'ordonnancement: exemple du Hoist Scheduling Problem.\u201d Proc. 2\u00e9mes journ\u00e9es francophones de programmation logique. (in French), pp. 343\u2013363."},{"key":"238060_CR61","unstructured":"Walsh, T. (1997). \u201cDepth-bounded Discrepancy Search.\u201d Proc. 15th International Joint Conference on Artificial Intelligence. Morgan Kaufmann."},{"key":"238060_CR62","unstructured":"Zweben, M. and M. Fox. (eds.). (1994). Intelligent Scheduling. Morgan Kaufmann."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009613717770.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009613717770\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009613717770.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:02:08Z","timestamp":1747652528000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009613717770"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,10]]},"references-count":62,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,10]]}},"alternative-id":["238060"],"URL":"https:\/\/doi.org\/10.1023\/a:1009613717770","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[1999,10]]}}}