{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T17:43:33Z","timestamp":1779385413785,"version":"3.53.1"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642406683","type":"print"},{"value":"9783642406690","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40669-0_18","type":"book-chapter","created":{"date-parts":[[2013,9,4]],"date-time":"2013-09-04T13:40:52Z","timestamp":1378302052000},"page":"199-210","source":"Crossref","is-referenced-by-count":2,"title":["Resource Constrained Project Scheduling with General Precedence Relations Optimized with SAT"],"prefix":"10.1007","author":[{"given":"Rui","family":"Alves","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Filipe","family":"Alvelos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S\u00e9rgio Dinis","family":"Sousa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1","key":"18_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","volume":"112","author":"P. Brucker","year":"1999","unstructured":"Brucker, P., Drexl, A., M\u00f6hring, R., Neumann, K.: Resource-constrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research\u00a0112(1), 3\u201341 (1999)","journal-title":"European Journal of Operational Research"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Tavares, L.V.: Advanced Models for Project Management. Kluwer Academic Publishers (1998)","DOI":"10.1007\/978-1-4419-8626-9"},{"key":"18_CR3","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP Completeness. W.H. Freeman and Company (1979)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Hammer, P.L., Rudeanu, S.: Boolean Methods in Operations Research and Related Areas. Springer (1968)","DOI":"10.1007\/978-3-642-85823-9"},{"issue":"10","key":"18_CR5","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1287\/mnsc.28.10.1197","volume":"28","author":"B. Talbot","year":"1982","unstructured":"Talbot, B.: Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case. Management Science\u00a028(10), 1197\u20131210 (1982)","journal-title":"Management Science"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Reyck, B., Herroelen, W.: A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations. Operations Research\u00a045(2) (March-April 1997)","DOI":"10.1287\/opre.45.2.201"},{"issue":"6","key":"18_CR7","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1287\/mnsc.13.6.B359","volume":"13","author":"J.D. Wiest","year":"1967","unstructured":"Wiest, J.D.: A heuristic model for scheduling large projects with limited resources. Management Science\u00a013(6), 359\u2013377 (1967)","journal-title":"Management Science"},{"issue":"1","key":"18_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10479-007-0188-y","volume":"157","author":"O. Liess","year":"2008","unstructured":"Liess, O., Michelon, P.: A constraint programming approach for the resource-constrained project scheduling problem. Annals of Operation Research\u00a0157(1), 25\u201336 (2008)","journal-title":"Annals of Operation Research"},{"issue":"7","key":"18_CR9","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1057\/palgrave.jors.2600416","volume":"48","author":"J.H. Cho","year":"1997","unstructured":"Cho, J.H., Kim, Y.D.: A simulated annealing algorithm for resource constrained project scheduling problems. Journal of the Operational Research Society\u00a048(7), 736\u2013744 (1997)","journal-title":"Journal of the Operational Research Society"},{"key":"18_CR10","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1613\/jair.3424","volume":"43","author":"N. Fu","year":"2012","unstructured":"Fu, N., Lau, H.C., Varakantham, P., Xiao, F.: Robust Local Search for Solving RCPSP\/max with Durational Uncertainty. Journal of Artificial Intelligence Research\u00a043, 43\u201386 (2012)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"7","key":"18_CR11","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1002\/(SICI)1520-6750(199810)45:7<733::AID-NAV5>3.0.CO;2-C","volume":"45","author":"S. Hartmann","year":"1998","unstructured":"Hartmann, S.: A competitive genetic algorithm for resource constrained project scheduling. Naval Research Logistics\u00a045(7), 733\u2013750 (1998)","journal-title":"Naval Research Logistics"},{"issue":"1983","key":"18_CR12","first-page":"3","volume":"112","author":"S. Colak","year":"1999","unstructured":"Colak, S., Agarwal, A., Erenguc, S.: Resource Constrained Scheduling Problem: A Hybrid Neural Approach. Perspectives in Modern Project Scheduling\u00a0112(1983), 3\u201341 (1999)","journal-title":"Perspectives in Modern Project Scheduling"},{"issue":"1","key":"18_CR13","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1613\/jair.3442","volume":"43","author":"R. Huang","year":"2012","unstructured":"Huang, R., Chen, Y., Zhang, W.: SAS+ Planning as Satisfiability. Journal of Artificial Intelligence Research\u00a043(1), 293\u2013328 (2012)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"1","key":"18_CR14","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.ejor.2011.03.019","volume":"213","author":"J. Coelho","year":"2011","unstructured":"Coelho, J., Vanhoucke, M.: Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers. Journal of Operational Research\u00a0213(1), 73\u201382 (2011) ISSN 0377-2217","journal-title":"Journal of Operational Research"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Horbach, A.: A Boolean satisfiability approach to the resource-constrained project scheduling problem. Annals of Operations Research\u00a0181(1), 89\u2013107, doi:10.1007\/s10479-010-0693-2","DOI":"10.1007\/s10479-010-0693-2"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Davis, M., Putnam, H.: A Computing Procedure for Quantification Theory. Journal of the Association of Computing Machinery (1960)","DOI":"10.1145\/321033.321034"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A Machine Program for Theorem Proving. Communications of the ACM\u00a05, 394\u2013397 (1962)","journal-title":"Communications of the ACM"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Annual ACM IEEE Design Automation Conference (2001)","DOI":"10.1145\/378239.379017"},{"key":"18_CR19","unstructured":"Ryan, L.: Efficient Algorithms for Clause-Learning SAT Solvers, M.S. Thesis, Simon Fraser (2004)"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Goldberg, E., Novikov, Y.: BerkMin: A fast and robust Sat-solver. Discrete Applied Mathematics\u00a0155(12) (June 2007)","DOI":"10.1016\/j.dam.2006.10.007"},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-540-79719-7_4","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2008","author":"A. Biere","year":"2008","unstructured":"Biere, A.: Adaptive Restart Strategies for Conflict Driven SAT Solvers. In: Kleine B\u00fcning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol.\u00a04996, pp. 28\u201333. Springer, Heidelberg (2008)"},{"key":"18_CR22","unstructured":"Marques, J.P., Karem, S., Sakallah, A.: Conflict analysis in search algorithms for propositional satisfiability. In: Proc. of the IEEE Intl. Conf. on Tools with Artificial Intelligence (1996)"},{"issue":"7","key":"18_CR23","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1109\/43.238038","volume":"12","author":"S.T. Chakradhar","year":"1993","unstructured":"Chakradhar, S.T., Agrawal, V.D., Tothweiller, S.G.: A Transitive Closure Algorithm for Test Generation. IEEE Trans. Computer-Aided Design\u00a012(7), 1015\u20131028 (1993)","journal-title":"IEEE Trans. Computer-Aided Design"},{"key":"18_CR24","unstructured":"Larrabee, T.: Efficient Generation of Test Patterns Using Boolean Satisfiability. PhD Dissertation, Dept. of Computer Science, Stanford Univ., STAN-CS-90-1302 (February 1990)"},{"key":"18_CR25","unstructured":"Kautz, H., Selman, B.: Planning as Satisfiability. In: Proceedings of the 10th European Conference on Artificial Intelligence, ECAI 1992 (August 1992)"},{"key":"18_CR26","unstructured":"Lynce, I., Marques-Silva, J.: Efficient Haplotype Inference with Boolean Satisfiability. In: AAAI 2006 (2006)"},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"Ivancic, F., Yang, Z., Ganai, M.K., Gupta, A., Ashar, P.: Efficient SAT-based bounded model checking for software verification. Journal of Theoretical Computer Science\u00a0404(3) (September 2008)","DOI":"10.1016\/j.tcs.2008.03.013"},{"key":"18_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"18_CR29","doi-asserted-by":"crossref","unstructured":"Kolisch, R., Sprecher, A.: PSPLIB \u2013 A project scheduling problem library. European Journal of Operational Research, 205\u2013216 (1996)","DOI":"10.1016\/S0377-2217(96)00170-1"},{"key":"18_CR30","unstructured":"IBM CPLEX, \n                    \n                      http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimizer\/\n                    \n                    \n                   (January 10, 2013)"}],"container-title":["Lecture Notes in Computer Science","Progress in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40669-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T01:45:56Z","timestamp":1558057556000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40669-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642406683","9783642406690"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40669-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}