{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:06:27Z","timestamp":1761620787615,"version":"3.40.5"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"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":[[1998,3]]},"DOI":"10.1023\/a:1009687210594","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T22:47:08Z","timestamp":1040597228000},"page":"271-286","source":"Crossref","is-referenced-by-count":47,"title":["Constraint-Based Job Shop Scheduling with IILOG SCHEDULER"],"prefix":"10.1007","volume":"3","author":[{"given":"Wim","family":"Nuijten","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claude","family":"Le Pape","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"155927_CR1","first-page":"113","volume":"6","author":"E.H.L. Aarts","year":"1994","unstructured":"Aarts, E.H.L., P.J.M. van Laarhoven, J.K. Lenstra, and N.J.L. Ulder. (1994). \"A Computational Study of Local Search Algorithms for Job Shop Scheduling,\" ORSA Journal on Computing 6, 113\u2013125.","journal-title":"ORSA Journal on Computing"},{"key":"155927_CR2","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). \"The Shifting Bottleneck Procedure for Job Shop Scheduling,\" Management Science 34, 391\u2013401.","journal-title":"Management Science"},{"key":"155927_CR3","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). \"Extending Chip in Order to Solve Complex Scheduling and Placement Problems,\" Mathematical and Computer Modelling 17, 57\u201373.","journal-title":"Mathematical and Computer Modelling"},{"key":"155927_CR4","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D. a. Applegate","year":"1991","unstructured":"Applegate, D. andW. Cook. (1991). \"AComputational Study of the Job-Shop Scheduling Problem,\" ORSA Journal on Computing 3, 149\u2013156.","journal-title":"ORSA Journal on Computing"},{"key":"155927_CR5","unstructured":"Baker, K.R. (1974). Introduction to Sequencing and Scheduling. Wiley & Sons."},{"key":"155927_CR6","volume-title":"Management Science Research Report MSRR-609(R)","author":"E. Balas","year":"1995","unstructured":"Balas, E. and A. Vazacopoulos. (1995). \"}Guided Local Search with Shifting Bottleneck for Job-Shop Scheduling,\" Management Science Research Report MSRR-609(R), Carnegie Mellon University, Pittsburgh."},{"key":"155927_CR7","unstructured":"Baptiste, P. and C. Le Pape. (1996). \"Edge-Finding Constraint Propagation Algorithms for Disjunctive and Cummulative Scheduling,\" Proc. 15th Workshop of the U.K. Planning Special Interest Group."},{"key":"155927_CR8","unstructured":"Baptiste, P., C. Le Pape, and W. Nuijten. (1995). \"Constraint-Based Optimization and Approximation for Job Shop Scheduling,\" Proc. IJCAI'95 Workshop on Intelligent Manufacturing Systems."},{"issue":"2","key":"155927_CR9","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1080\/07408179508936739","volume":"27\/","author":"J.W. Barnes","year":"1994","unstructured":"Barnes, J.W. and J.B. Chambers. (1994). \"Solving the Job Shop Scheduling Problem Using Tabu Search,\" IEEE Transactions 27\/2, 257\u2013263.","journal-title":"IEEE Transactions"},{"key":"155927_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0377-2217(95)00362-2","volume":"91","author":"J. Blazewicz","year":"1996","unstructured":"Blazewicz, J., W. Domschke, and E. Pesch. (1996). \"The Job Shop Scheduling Problem: Conventional and New Solution Techniques,\" European Journal of Operational Research 91, 1\u201333.","journal-title":"European Journal of Operational Research"},{"key":"155927_CR11","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). \"A Branch and Bound Algorithm for the Job-Shop Scheduling Problem,\" Discrete Applied Mathematics 49, 107\u2013127.","journal-title":"Discrete Applied Mathematics"},{"key":"155927_CR12","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","volume":"35","author":"J. Carlier","year":"1989","unstructured":"Carlier, J. and E. Pinson. (1989). \"An Algorithm for Solving the Job-Shop Problem,\" Management Science 35, 164\u2013176.","journal-title":"Management Science"},{"key":"155927_CR13","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). \"Adjustment of Heads and Tails for the Job-Shop Problem,\" European Journal of Operational Research 78, 146\u2013161.","journal-title":"European Journal of Operational Research"},{"key":"155927_CR14","unstructured":"Caseau, Y. and F. Laburthe. (1994). \"Improved CLP Scheduling with Task Intervals,\" Proc. 11th International Conference on Logic Programming."},{"key":"155927_CR15","unstructured":"Caseau,Y. and F. Laburthe. (1995). \"Disjunctive Scheduling with Task Intervals,\" Technical Report, Ecole Normale Superieure."},{"key":"155927_CR16","unstructured":"Dechter, R. (1992). \"Constraint Networks.\" In S.C. Shapiro (ed.), Encyclopedia of Artificial Intelligence. John Wiley & Sons, second edition, vol. 1, pp. 276\u2013285."},{"key":"155927_CR17","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF02023076","volume":"41","author":"M. Dell'Amico","year":"1993","unstructured":"Dell'Amico, M. and M. Trubian. (1993). \"Applying Tabu-Search to the Job-Shop Scheduling Problem,\" Annals of Operations Research 41, 231\u2013252.","journal-title":"Annals of Operations Research"},{"key":"155927_CR18","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0305-0548(93)E0016-M","volume":"22","author":"U. Dorndorf","year":"1995","unstructured":"Dorndorf, U. and E. Pesch. (1995). \"Evolution Based Learning in a Job Shop Scheduling Environment,\" Computers and Operations Research 22, 25\u201340.","journal-title":"Computers and Operations Research"},{"key":"155927_CR19","unstructured":"Ford, Jr., L.R. (1956). \"Network Flow Theory,\" Technical report, Rand Corporatio"},{"key":"155927_CR20","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability; A Guide to the Theory of NP-Completeness. New York: W.H. Freeman and Company."},{"key":"155927_CR21","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., D.S. Johnson, and R. Sethi. (1976). \"The Complexity of Flowshop and Job-Shop Scheduling,\" Mathematics of Operations Research 1, 117\u2013129.","journal-title":"Mathematics of Operations Research"},{"key":"155927_CR22","unstructured":"Gondran, M. and M. Minoux. (1984). Graphs and Algorithms. John Wiley and Sons."},{"key":"155927_CR23","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF01721162","volume":"11","author":"R. Haupt","year":"1989","unstructured":"Haupt, R. (1989). \"A Survey of Priority Rule-Based Scheduling,\" OR Spektrum 11, 3\u201316.","journal-title":"OR Spektrum"},{"key":"155927_CR24","unstructured":"Hentenryck, P. van. (1989). Constraint Satisfaction in Logic Programming. MIT Press."},{"key":"155927_CR25","first-page":"32","volume":"13","author":"V. Kumar","year":"1992","unstructured":"Kumar, V. (1992). \"Algorithms for Constraint-Satisfaction Problems: A Survey,\" AI Magazine 13, 32\u201344.","journal-title":"AI Magazine"},{"key":"155927_CR26","first-page":"113","volume":"40","author":"P.J.M. van Laarhoven","year":"1992","unstructured":"Laarhoven, P.J.M. van, E.H.L. Aarts, and J.K. Lenstra}. (1992). \"Job Shop Scheduling by Simulated Annealing},\" Operations Research} 40}, 113\u2013","journal-title":"Job Shop Scheduling by Simulated Annealing"},{"key":"155927_CR27","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, 55\u201366.","journal-title":"Intelligent Systems Engineering"},{"key":"155927_CR28","unstructured":"Le Pape, C. and P. Baptiste. (1996). \"Constraint Propagation Techniques for Disjunctive Scheduling: The Preemptive Case,\" Proc. 12th European Conference on Artificial Intelligence."},{"key":"155927_CR29","first-page":"19","volume":"91","author":"C. Le Pape","year":"1995","unstructured":"Le Pape, C., P. Couronn\u00e9, D. Vergamini, and V. Gosselin. (1995). \"Time-Versus-Capacity Compromises in Project Scheduling,\" AISB Quarterly 91, 19\u201331.","journal-title":"AISB Quarterly"},{"key":"155927_CR30","doi-asserted-by":"crossref","unstructured":"Martin, P.D. (1996). \"A Time-Oriented Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem,\" Ph.D. Thesis, School of Operations Research and Industrial Engineering, Cornell University.","DOI":"10.1007\/3-540-61310-2_29"},{"key":"155927_CR31","unstructured":"Matsuo, H., C.J. Suh, and R.S. Sullivan. (1988). \"A Controlled Search Simulated Annealing Method for the General Job Shop Scheduling Problem,\" Working Paper 03-04-88, Graduate School of Business, University of Texas at Austin, Austin, USA."},{"key":"155927_CR32","unstructured":"Nowicki, E. and C. Smutnicki. (1993). \"A Fast Taboo Search Algorithm for the Job Shop Problem,\" Preprinty nr 8\/93. Instytut Cybernetyki Technicznej, Politechnicki Wroclawskiej, Poland."},{"key":"155927_CR33","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). \"A Fast Taboo Search Algorithm for the Job Shop Problem,\" Management Science 42, 797\u2013813.","journal-title":"Management Science"},{"key":"155927_CR34","unstructured":"Nuijten, W.P.M. (1994). \"Time and Resource Constrained Scheduling: A Constraint Satisfaction Approach,\" Ph.D. Thesis. Eindhoven University of Technology."},{"key":"155927_CR35","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). \"A Computational Study of Constraint Satisfaction for Multiple Capacitated Job Shop Scheduling,\" European Journal of Operational Research 90, 269\u2013284.","journal-title":"European Journal of Operational Research"},{"key":"155927_CR36","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.25.1.45","volume":"25","author":"S.S. Panwalkar","year":"1977","unstructured":"Panwalkar, S.S. and W. Iskander. (1977). \"A Survey of Scheduling Rules,\" Operations Research 25, 45\u201361.","journal-title":"Operations Research"},{"key":"155927_CR37","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 94-01. ILOG S.A., Gentilly, France."},{"key":"155927_CR38","unstructured":"Smith, S.F. and C.-C. Cheng. (1993). \"Slack-Based Heuristics for Constraint Satisfaction,\" Proc. 11th National Conference on Artificial Intelligence."},{"key":"155927_CR39","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1287\/ijoc.6.2.108","volume":"6","author":"E. Taillard","year":"1994","unstructured":"Taillard, E. (1994). \"Parallel Taboo Search Techniques for the Job Shop Scheduling Problem,\" ORSA Journal on Computing 6, 108\u2013117.","journal-title":"ORSA Journal on Computing"},{"key":"155927_CR40","unstructured":"Vaessens, R.J.M., E.H.L. Aarts, and J.K. Lenstra. (1994). \"Job Shop Scheduling by Local Search,\" COSOR Memorandum 94-05, Eindhoven University of Technology."},{"volume-title":"Intelligent Scheduling","year":"1994","key":"155927_CR41","unstructured":"Zweben, M. and M. Fox (eds.) (1994). Intelligent Scheduling. New York: Morgan Kauffman."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009687210594.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009687210594\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009687210594.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T10:49:55Z","timestamp":1747651795000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009687210594"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["155927"],"URL":"https:\/\/doi.org\/10.1023\/a:1009687210594","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}