{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T01:04:25Z","timestamp":1782349465707,"version":"3.54.5"},"reference-count":48,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3911,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1016\/s0166-218x(01)00342-0","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:12:20Z","timestamp":1034608340000},"page":"227-256","source":"Crossref","is-referenced-by-count":43,"title":["Scheduling and constraint propagation"],"prefix":"10.1016","volume":"123","author":[{"given":"Peter","family":"Brucker","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00342-0_BIB1","series-title":"Network Flows","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0166-218X(01)00342-0_BIB2","series-title":"Advances in Project Scheduling","first-page":"113","article-title":"Heuristic algorithms for resource-constrained project scheduling: a review and an empirical analysis","author":"Alvarez-Vald\u00e9s","year":"1989"},{"key":"10.1016\/S0166-218X(01)00342-0_BIB3","series-title":"Local Search in Combinatorial Optimization","first-page":"361","article-title":"Machine scheduling","author":"Anderson","year":"1997"},{"key":"10.1016\/S0166-218X(01)00342-0_BIB4","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","article-title":"A computational study of the job-shop scheduling problem","volume":"3","author":"Applegate","year":"1991","journal-title":"ORSA J. Comput."},{"key":"10.1016\/S0166-218X(01)00342-0_BIB5","series-title":"Meta-Heuristics","article-title":"Tabu search algorithms and lower bounds for the resource-constrained project scheduling problem","author":"Baar","year":"1999"},{"key":"10.1016\/S0166-218X(01)00342-0_BIB6","unstructured":"P. Baptiste, C. Le Pape, Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling, Proceedings of the 15th Workshop of the U.K. Planning Special Interest Group, Liverpool, UK, 1996."},{"key":"10.1016\/S0166-218X(01)00342-0_BIB7","unstructured":"P. Baptiste, A theoretical and experimental study of resource constrained propagation, Ph.D. Thesis, Universit\u00e9 de Technologie de Compi\u00e8gne, 1998."},{"key":"10.1016\/S0166-218X(01)00342-0_BIB8","series-title":"Scheduling Computer and Manufacturing Processes","author":"Blazewicz","year":"1996"},{"key":"10.1016\/S0166-218X(01)00342-0_BIB9","series-title":"Scheduling Algorithms","author":"Brucker","year":"2001"},{"key":"10.1016\/S0166-218X(01)00342-0_BIB10","doi-asserted-by":"crossref","unstructured":"P. Brucker, W. Brinkk\u00f6tter, Solving open benchmark problems for the job-shop problem, J. Scheduling 4 (2001) 53\u201364.","DOI":"10.1002\/1099-1425(200101\/02)4:1<53::AID-JOS59>3.0.CO;2-Y"},{"key":"10.1016\/S0166-218X(01)00342-0_BIB11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","article-title":"Resource-constrained project scheduling: notation, classification, model, and methods","volume":"112","author":"Brucker","year":"1999","journal-title":"Euro. J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00342-0_BIB12","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF02085636","article-title":"The job-shop problem and immediate selection","volume":"50","author":"Brucker","year":"1994","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00342-0_BIB13","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0166-218X(94)90204-6","article-title":"A branch & bound algorithm for the job-shop problem","volume":"49","author":"Brucker","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00342-0_BIB14","doi-asserted-by":"crossref","unstructured":"P. Brucker, S. Knust, A linear programming and constraint propagation based lower bound for the RCPSP, Euro. J. Oper. Res. 127 (2000) 355\u2013362.","DOI":"10.1016\/S0377-2217(99)00489-0"},{"key":"10.1016\/S0166-218X(01)00342-0_BIB15","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1002\/(SICI)1099-1425(199907\/08)2:4<157::AID-JOS23>3.0.CO;2-Z","article-title":"A new tabu search procedure for an audit-scheduling problem","volume":"2","author":"Brucker","year":"1999","journal-title":"J. Scheduling"},{"key":"10.1016\/S0166-218X(01)00342-0_BIB16","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0377-2217(97)00335-4","article-title":"A branch and bound algorithm for the resource-constrained project scheduling problem","volume":"107","author":"Brucker","year":"1998","journal-title":"Euro. J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00342-0_BIB17","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01539706","article-title":"A branch & bound method for the general-shop problem with sequence dependent setup times","volume":"18","author":"Brucker","year":"1996","journal-title":"Oper. Res. Spektrum"},{"key":"10.1016\/S0166-218X(01)00342-0_BIB18","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","article-title":"An algorithm for solving the job-shop problem","volume":"35","author":"Carlier","year":"1989","journal-title":"Manage. Sci."},{"key":"10.1016\/S0166-218X(01)00342-0_BIB19","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF03543071","article-title":"A practical use of Jackson's preemptive schedule for solving the job shop problem","volume":"26","author":"Carlier","year":"1990","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00342-0_BIB20","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0377-2217(94)90379-4","article-title":"Adjustment of heads and tails for the job-shop problem","volume":"78","author":"Carlier","year":"1994","journal-title":"Euro. J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00342-0_BIB21","series-title":"Linear Programming","author":"Chvatal","year":"1983"},{"key":"10.1016\/S0166-218X(01)00342-0_BIB22","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/0377-2217(87)90240-2","article-title":"Project scheduling with resource constraints: a branch and bound approach","volume":"29","author":"Christofides","year":"1987","journal-title":"Euro. J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00342-0_BIB23","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1287\/mnsc.21.8.944","article-title":"A comparison of heuristic and optimum solutions in resource-constrained project scheduling","volume":"21","author":"Davis","year":"1975","journal-title":"Manage. Sci."},{"key":"10.1016\/S0166-218X(01)00342-0_BIB24","doi-asserted-by":"crossref","first-page":"1803","DOI":"10.1287\/mnsc.38.12.1803","article-title":"A branch-and-bound procedure for the multiple resource-constrained project scheduling problem","volume":"38","author":"Demeulemeester","year":"1992","journal-title":"Manage. Sci."},{"key":"10.1016\/S0166-218X(01)00342-0_BIB25","series-title":"Project Scheduling","article-title":"A survey of interval capacity consistency tests for time- and resource-constrained scheduling","author":"Dorndorf","year":"1998"},{"key":"10.1016\/S0166-218X(01)00342-0_BIB26","doi-asserted-by":"crossref","unstructured":"U. Dorndorf, E. Pesch, T. Phan-Huy, A time-oriented branch-and-bound algorithm for resource constrained project scheduling with generalized precedence constraints, Management Science 46 (2000) 1365\u20131384.","DOI":"10.1287\/mnsc.46.10.1365.12272"},{"key":"10.1016\/S0166-218X(01)00342-0_BIB27","doi-asserted-by":"crossref","unstructured":"U. Dorndorf, E. Pesch, T. Phan-Huy, Solving open shop problem, J. Scheduling 4 (2001) 157\u2013174.","DOI":"10.1002\/jos.73"},{"key":"10.1016\/S0166-218X(01)00342-0_BIB28","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/S0377-2217(97)00442-6","article-title":"Computing lower bounds by destructive improvement\u2014an application to resource-constrained project scheduling","volume":"112","author":"Klein","year":"1999","journal-title":"Euro. J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00342-0_BIB29","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/(SICI)1520-6750(199602)43:1<23::AID-NAV2>3.0.CO;2-P","article-title":"Adaptive search for solving hard project scheduling problems","volume":"43","author":"Kolisch","year":"1996","journal-title":"Naval Res. Logist."},{"key":"10.1016\/S0166-218X(01)00342-0_BIB30","series-title":"Handbooks in Operations Research and Management Science, Vol. 4: Logistic of Production and Inventory","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","article-title":"Sequencing and scheduling: algorithms and complexity","author":"Lawler","year":"1993"},{"key":"10.1016\/S0166-218X(01)00342-0_BIB31","series-title":"Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques, Working Paper, Graduate School of Industrial Administration","author":"Lawrence","year":"1984"},{"key":"10.1016\/S0166-218X(01)00342-0_BIB32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1018909801944","article-title":"Current trends in deterministic scheduling","volume":"70","author":"Lee","year":"1997","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00342-0_BIB33","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01719262","article-title":"Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling","volume":"17","author":"Leon","year":"1995","journal-title":"OR Spektrum"},{"key":"10.1016\/S0166-218X(01)00342-0_BIB34","unstructured":"K. Nonobe, T. Ibaraki, Formulation and tabu search algorithm for the resource constrained project scheduling problem (RCPSP), Working Paper, Department of Applied Mathematics and Physics, Kyoto University, 1999."},{"key":"10.1016\/S0166-218X(01)00342-0_BIB35","doi-asserted-by":"crossref","unstructured":"P. Martin, D.B. Shmoys, A new approach to computing optimal schedules for the job-shop scheduling problem, Proceedings of the Fifth International IPCO Conference, 1996.","DOI":"10.1007\/3-540-61310-2_29"},{"key":"10.1016\/S0166-218X(01)00342-0_BIB36","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1287\/mnsc.44.5.714","article-title":"An exact algorithm for the resource-constrained project scheduling based on a new mathematical formulation","volume":"44","author":"Mingozzi","year":"1998","journal-title":"Manage. Sci."},{"key":"10.1016\/S0166-218X(01)00342-0_BIB37","doi-asserted-by":"crossref","unstructured":"R.H. M\u00f6hring, Algorithm aspects of comparability graphs and interval graphs, in: I. Rival (Ed.), Graphs and Order: the Role of Graphs in the Theory of Ordered Sets and its Applications, NATO Advanced Science Institute Series, Math. Phys. Sci. Ser., C, 1985, pp. 41\u2013101.","DOI":"10.1007\/978-94-009-5315-4_2"},{"key":"10.1016\/S0166-218X(01)00342-0_BIB38","doi-asserted-by":"crossref","unstructured":"R.H. M\u00f6hring, A.S. Schulz, F. Stork, M. Uetz, Resource constrained project scheduling: computing lower bounds by solving minimum cut problems, in Algorithms \u2013 ESA\u201999, ed. Nesetril, J. Lecture Notes in Computer Science 1643, Proc. 7th Annual European Symp. on Algorithms, Springer, Berlin, 1999, pp. 139\u2013150.","DOI":"10.1007\/3-540-48481-7_13"},{"key":"10.1016\/S0166-218X(01)00342-0_BIB39","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/S0377-2217(96)00180-4","article-title":"A genetic algorithm for multi-mode resource constrained project scheduling problem","volume":"100","author":"Mori","year":"1997","journal-title":"Euro. J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00342-0_BIB40","series-title":"Advances in Project Scheduling","first-page":"3","article-title":"An algorithm for a general class of precedence and resource constrained scheduling problems","author":"Patterson","year":"1989"},{"key":"10.1016\/S0166-218X(01)00342-0_BIB41","series-title":"Scheduling: Theory, Algorithms, and Systems","author":"Pinedo","year":"1995"},{"key":"10.1016\/S0166-218X(01)00342-0_BIB42","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1002\/1520-6750(199308)40:5<665::AID-NAV3220400509>3.0.CO;2-J","article-title":"Local search techniques for the generalized RCPSP","volume":"40","author":"Sampson","year":"1993","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/S0166-218X(01)00342-0_BIB43","unstructured":"A. Schaerf, Tabu search techniques for large high-school timetabling problems, in: Proceedings of the 13th National Conference on Artificial Intelligence (AAAI-96), AAAI Press\/MIT Press, Portland, USA, 1996, pp. 363\u2013368."},{"key":"10.1016\/S0166-218X(01)00342-0_BIB44","doi-asserted-by":"crossref","unstructured":"A. Sprecher, Scheduling resource-constrained projects competitively at modest memory requirements. Management Science, 46 (2000) 710\u2013723.","DOI":"10.1287\/mnsc.46.5.710.12044"},{"key":"10.1016\/S0166-218X(01)00342-0_BIB45","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1080\/05695557808975212","article-title":"Multiple resource-constrained scheduling using branch and bound","volume":"10","author":"Stinson","year":"1978","journal-title":"AIIE Trans."},{"key":"10.1016\/S0166-218X(01)00342-0_BIB46","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1287\/mnsc.23.4.412","article-title":"Heuristic scheduling of activities under resource and precedence restrictions","volume":"23","author":"Thesen","year":"1976","journal-title":"Manage. Sci."},{"key":"10.1016\/S0166-218X(01)00342-0_BIB47","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1023\/A:1009673512884","article-title":"A tabu search approach for the resource constrained project scheduling problem","volume":"4","author":"Thomas","year":"1998","journal-title":"J. Heuristics"},{"key":"10.1016\/S0166-218X(01)00342-0_BIB48","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1016\/S0377-2217(98)80001-5","article-title":"Tabu search for resource-constrained scheduling","volume":"106","author":"Verhoeven","year":"1998","journal-title":"Euro. J. Oper. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01003420?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01003420?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T14:19:40Z","timestamp":1578493180000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01003420"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":48,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S0166218X01003420"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00342-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}