{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T12:54:48Z","timestamp":1782996888459,"version":"3.54.5"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,9,3]],"date-time":"2008-09-03T00:00:00Z","timestamp":1220400000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1007\/s10951-008-0079-3","type":"journal-article","created":{"date-parts":[[2008,9,2]],"date-time":"2008-09-02T14:11:17Z","timestamp":1220364677000},"page":"281-298","source":"Crossref","is-referenced-by-count":135,"title":["Scheduling projects with multi-skilled personnel by a hybrid MILP\/CP benders decomposition algorithm"],"prefix":"10.1007","volume":"12","author":[{"given":"Haitao","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Keith","family":"Womer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,9,3]]},"reference":[{"key":"79_CR1","volume-title":"Workforce cross training handbook","author":"O. Z. Aksin","year":"2006","unstructured":"Aksin, O. Z., Karaesmen, F., & Ormeci, E. L. (2006). A review of workforce cross-training in call centers from an operations management perspective. In D. Nembhard (Ed.), Workforce cross training handbook. Boca Raton: CRC Press."},{"key":"79_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-1479-4","volume-title":"Constraint-based scheduling: applying constraint programming to scheduling problems","author":"P. Baptiste","year":"2001","unstructured":"Baptiste, P., Le Pape, C., & Nuijten, W. (2001). Constraint-based scheduling: applying constraint programming to scheduling problems. New York: Springer."},{"key":"79_CR3","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02283745","volume":"16","author":"M. Bartusch","year":"1988","unstructured":"Bartusch, M., Mohring, R. H., & Randermacher, F. J. (1988). Scheduling project networks with resource constraints and time windows. Annals of Operations Research, 16, 201\u2013240.","journal-title":"Annals of Operations Research"},{"key":"79_CR4","unstructured":"Bellenguez, O., & Neron, E. (2004). Methods for solving the multi-skill project scheduling problem. In Proceedings of the ninth international workshop on project management and scheduling, Nancy, France."},{"key":"79_CR5","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J. F. Benders","year":"1962","unstructured":"Benders, J. F. (1962). Partition procedures for solving mixed variables programming problems. Numerische Mathematik, 4, 238\u2013252.","journal-title":"Numerische Mathematik"},{"key":"79_CR6","unstructured":"Benoist, T., Laburthe, F., & Rotternbourg, B. (2001). Lagrange relaxation and constraint programming collaborative schemes for traveling tournament problems. In Integration of AI and OR techniques in constraint."},{"key":"79_CR7","doi-asserted-by":"crossref","unstructured":"Benoist, T., Gaudin, E., & Rotternbourg, B. (2002). Constraint programming contribution to Benders decomposition: A case study. In The eighth international conference on principles and practice of constraint programming, Ithaca, New York.","DOI":"10.1007\/3-540-46135-3_40"},{"issue":"3","key":"79_CR8","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1287\/ijoc.10.3.287","volume":"10","author":"A. Bockmayr","year":"1998","unstructured":"Bockmayr, A., & Kasper, T. (1998). A unifying framework for integer and finite domain constraint programming. INFORMS Journal on Computing, 10(3), 287\u2013300.","journal-title":"INFORMS Journal on Computing"},{"key":"79_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04550-3","volume-title":"Scheduling algorithms","author":"P. Brucker","year":"2001","unstructured":"Brucker, P. (2001). Scheduling algorithms. Berlin: Springer."},{"issue":"1\u20133","key":"79_CR10","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/S0166-218X(01)00342-0","volume":"123","author":"P. Brucker","year":"2002","unstructured":"Brucker, P. (2002). Scheduling and constraint propagation. Discrete Applied Mathematicsu, 123(1\u20133), 227\u2013256.","journal-title":"Discrete Applied Mathematicsu"},{"key":"79_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03612-9","volume-title":"Project scheduling: recent models, algorithms and applications","author":"P. Brucker","year":"1998","unstructured":"Brucker, P., & Knust, S. (1998). Solving large-sized resource-constrained project scheduling problems. In J. Weglarz (Ed.), Project scheduling: recent models, algorithms and applications. Dordrecht: Kluwer Academic."},{"issue":"2","key":"79_CR12","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0377-2217(99)00489-0","volume":"127","author":"P. Brucker","year":"2000","unstructured":"Brucker, P., & Knust, S. (2000). A linear programming and constraint propagation-based lower bound for the RCPSP. European Journal of Operational Research, 127(2), 335\u2013362.","journal-title":"European Journal of Operational Research"},{"key":"79_CR13","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/S0377-2217(02)00762-2","volume":"149","author":"P. Brucker","year":"2003","unstructured":"Brucker, P., & Knust, S. (2003). Lower bounds for resource-constrained project scheduling problems. European Journal of Operational Research, 149, 302\u2013313.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"79_CR14","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","volume":"112","author":"P. Brucker","year":"1999","unstructured":"Brucker, P., Drexl, A., Mohring, R. H., Neumann, K., & Pesch, E. (1999). Resource-constrained project scheduling: Notation, classification, models and methods. European Journal of Operational Research, 112(1), 3\u201341.","journal-title":"European Journal of Operational Research"},{"issue":"1\u20133","key":"79_CR15","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R. Dechter","year":"1991","unstructured":"Dechter, R., Meiri, I., & Pearl, J. (1991). Temporal constraint networks. Artificial Intelligence, 49(1\u20133), 61\u201395.","journal-title":"Artificial Intelligence"},{"key":"79_CR16","unstructured":"Dincbas, M., Van Hentenryck, P., Simonis, H., & Aggoun, A. (1988). The constraint logic programming language CHIP. In Proceedings of the 2nd international conference on fifth generation computer systems."},{"key":"79_CR17","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1057\/palgrave.jors.2601099","volume":"52","author":"A. Drexl","year":"2001","unstructured":"Drexl, A., & Kimms, A. (2001). Optimization guided lower and upper bounds for the resource investment problem. Journal of Operational Research Society, 52, 340\u2013351.","journal-title":"Journal of Operational Research Society"},{"key":"79_CR18","volume-title":"Project scheduling: recent models, algorithms and applications","author":"A. Drexl","year":"1998","unstructured":"Drexl, A., Juretzka, J., Salewski, F., & Schirmer, A. (1998). New modeling concepts and their impact on resource-constrained project scheduling. In J. Weglarz (Ed.), Project scheduling: recent models, algorithms and applications. Dordrecht: Kluwer Academic."},{"key":"79_CR19","volume-title":"Constraint and integer programming","author":"K. Easton","year":"2004","unstructured":"Easton, K., Nemhauser, G., & Trick, M. (2004). CP based branch\u2013and\u2013price. In M. Milano (Ed.), Constraint and integer programming. Berlin: Springer."},{"key":"79_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-45578-7_1","volume":"2239","author":"A. Eremin","year":"2001","unstructured":"Eremin, A., & Wallace, M. (2001). Hybrid Benders decomposition algorithms in constraint logic programming. Lecture Notes in Computer Science, 2239, 1\u201315.","journal-title":"Lecture Notes in Computer Science"},{"key":"79_CR21","unstructured":"Focacci, F., Laborie, P., & Nuijten, W. (2000). Solving scheduling problems with setup times and alternative resources. In Proceedings of the fifth international conference on artificial intelligence planning and scheduling."},{"key":"79_CR22","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/11757375_2","volume-title":"CPAIOR 2006","author":"M. Fox","year":"2006","unstructured":"Fox, M. (2006). Planning for mixed discrete continuous domains. In J.\u00a0C. Beck & B. M. Smith (Eds.), Lecture notes in computer science: Vol.\u00a03990. CPAIOR 2006 (p. 2). Berlin: Springer."},{"key":"79_CR23","unstructured":"Fox, M., & Long, D. (2001). Hybrid STAN: Identifying and managing combinatorial optimization sub-problems in planning. In Proceedings of the international joint conference on artificial intelligence (IJCAI)."},{"key":"79_CR24","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1613\/jair.1129","volume":"20","author":"M. Fox","year":"2003","unstructured":"Fox, M., & Long, D. (2003). PDDL2.1: An extension to PDDL for expression temporal planning domains. Journal of Artificial Intelligence Research, 20, 61\u2013124.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"79_CR25","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/11493853_15","volume-title":"CPAIOR 2005","author":"J. Frank","year":"2005","unstructured":"Frank, J., & Kurklu, E. (2005). Mixed discrete and continuous algorithms for scheduling airborne astronomy observations. In R.\u00a0Batak & M. Milano (Eds.), Lecture notes in computer science: Vol.\u00a03524. CPAIOR 2005 (pp. 183\u2013200). Berlin: Springer."},{"key":"79_CR26","unstructured":"Harvey, W., & Ginsberg, M. (1995). Limited discrepancy search. In The fourteenth international joint conference on artificial intelligence (IJCAI-95)."},{"key":"79_CR27","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033036","volume-title":"Logic-based methods for optimization: combining optimization and constraint satisfaction","author":"J. Hooker","year":"2000","unstructured":"Hooker, J. (2000). Logic-based methods for optimization: combining optimization and constraint satisfaction. New York: Wiley-Interscience."},{"issue":"4","key":"79_CR28","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1287\/ijoc.14.4.295.2828","volume":"14","author":"J. Hooker","year":"2002","unstructured":"Hooker, J. (2002). Logic, optimization and constraint programming. INFORMS Journal on Computing, 14(4), 285\u2013321.","journal-title":"INFORMS Journal on Computing"},{"key":"79_CR29","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/S0166-218X(99)00100-6","volume":"96\u201397","author":"J. Hooker","year":"1999","unstructured":"Hooker, J., & Osorio, M. (1999). Mixed logical-linear programming. Discrete Applied Mathematics, 96\u201397, 395\u2013442.","journal-title":"Discrete Applied Mathematics"},{"key":"79_CR30","unstructured":"ILOG (2002a). ILOG Solver 5.3 User\u2019s Manual."},{"key":"79_CR31","unstructured":"ILOG (2002b). ILOG CPLEX 8.1 User\u2019s Manual."},{"key":"79_CR32","unstructured":"ILOG (2002c). OPL Studio 3.6.1 User\u2019s Manual: ILOG, Inc."},{"issue":"4","key":"79_CR33","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1287\/ijoc.13.4.258.9733","volume":"13","author":"V. Jain","year":"2001","unstructured":"Jain, V., & Grossmann, I. (2001). Algorithms for hybrid MILP\/CP models for a class of optimization problems. INFORMS Journal on Computing, 13(4), 258\u2013276.","journal-title":"INFORMS Journal on Computing"},{"key":"79_CR34","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1023\/A:1009871302966","volume":"3","author":"K. Jasen","year":"1999","unstructured":"Jasen, K. (1999). An approximation scheme for bin packing with conflicts. Journal of Combinatorial Optimization, 3, 363\u2013377.","journal-title":"Journal of Combinatorial Optimization"},{"key":"79_CR35","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1613\/jair.561","volume":"10","author":"D. E. Joslin","year":"1999","unstructured":"Joslin, D. E., & Clements, D. P. (1999). \u201cSqueaky Wheel\u201d optimization. Journal of Artificial Intelligence Research, 10, 353\u2013373.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"79_CR36","volume-title":"Optimization theory for large systems","author":"L. S. Lasdon","year":"1970","unstructured":"Lasdon, L. S. (1970). Optimization theory for large systems. New York: Macmillan Co."},{"key":"79_CR37","unstructured":"Li, H., & Womer, K. (2006a). Determining crew composition for a new technology (Working Paper)."},{"issue":"4","key":"79_CR38","first-page":"305","volume":"12","author":"H. Li","year":"2006","unstructured":"Li, H., & Womer, K. (2006b). Project scheduling with multi-purpose resources: a combined MILP\/CP decomposition approach. International Journal of Operations and Quantitative Management, 12(4), 305\u2013325.","journal-title":"International Journal of Operations and Quantitative Management"},{"issue":"6","key":"79_CR39","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1016\/j.ijproman.2007.08.004","volume":"26","author":"H. Li","year":"2008","unstructured":"Li, H., & Womer, K. (2008). Modeling the supply chain configuration problem under resource constraints. International Journal of Project Management, 26(6), 646\u2013654.","journal-title":"International Journal of Project Management"},{"key":"79_CR40","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8917-8","volume-title":"Constraint and integer programming: toward a unified methodology","author":"M. Milano","year":"2004","unstructured":"Milano, M., & Trick, M. (2004). Constraint and integer programming. In M. Milano (Ed.), Constraint and integer programming: toward a unified methodology. Berlin: Springer."},{"key":"79_CR41","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and combinatorial optimization","author":"G. Nemhauser","year":"1988","unstructured":"Nemhauser, G., & Wolsey, L. (1988). Integer and combinatorial optimization. New York: Wiley."},{"key":"79_CR42","unstructured":"Neron, E., Bellenguez, O., & Heurtebise, M. (2006). Decomposition method for solving multi-skill project scheduling problem. In Proceedings of the tenth international workshop on project management and scheduling, Poznan."},{"key":"79_CR43","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-22341-3","volume-title":"Project scheduling with time windows and scarce resources: temporal and resource-constrained project scheduling with regular and nonregular objective functions","author":"K. Neumann","year":"2002","unstructured":"Neumann, K., Schwindt, C., & Zimmermann, J. (2002). Project scheduling with time windows and scarce resources: temporal and resource-constrained project scheduling with regular and nonregular objective functions. New York: Springer."},{"key":"79_CR44","unstructured":"Schwindt, C. (1996). Generation of resource-constrained project scheduling problems with minimal and maximal time lags (Technical Report WIOR-489). Institute f\u00fcr Wirtschaftstheorie und Operations Research, University of Karlsruhe."},{"key":"79_CR45","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1023\/A:1021845304798","volume":"118","author":"M. Sellmann","year":"2003","unstructured":"Sellmann, M., & Fahle, T. (2003). Constraint programming based Lagrangian relaxation for the automatic recording problem. Annals of Operations Research, 118, 17\u201333.","journal-title":"Annals of Operations Research"},{"key":"79_CR46","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1002\/net.3230070302","volume":"7","author":"A. Thesen","year":"1977","unstructured":"Thesen, A. (1977). Measures of the restrictiveness of project networks. Networks, 7, 193\u2013208.","journal-title":"Networks"},{"key":"79_CR47","volume-title":"Proceedings of the seventh international conference on principles and practices of constraint programming (CP-01)","author":"E. S. Thorsteinsson","year":"2001","unstructured":"Thorsteinsson, E. S. (2001). Branch\u2013and\u2013check: A hybrid framework integrating mixed integer programming and constraint logic programming. In Proceedings of the seventh international conference on principles and practices of constraint programming (CP-01). Berlin: Springer."},{"key":"79_CR48","volume-title":"Foundations of constraint satisfaction","author":"E. Tsang","year":"1993","unstructured":"Tsang, E. (1993). Foundations of constraint satisfaction. San Diego: Academic Press."},{"key":"79_CR49","volume-title":"The OPL optimization programming language","author":"P. Hentenryck Van","year":"1999","unstructured":"Van Hentenryck, P. (1999). The OPL optimization programming language. Cambridge: MIT Press."},{"key":"79_CR50","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.artint.2005.07.001","volume":"170","author":"B. W. Wah","year":"2006","unstructured":"Wah, B. W., & Chen, Y. (2006). Constraint partitioning in penalty formulations for solving temporal planning problems. Artificial Intelligence, 170, 187\u2013231.","journal-title":"Artificial Intelligence"},{"key":"79_CR51","unstructured":"Wallace, M., Novello, S., & Schimpf, J. (1997). ECLiPSe: A\u00a0platform for constraint logic programming. Available from: http:\/\/www.icparc.ic.ac.uk\/eclipse\/reports\/eclipse\/eclipse.html ."},{"key":"79_CR52","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/11757375_22","volume-title":"CPAIOR 2006","author":"Z. Xing","year":"2006","unstructured":"Xing, Z., Chen, Y., & Zhang, W. (2006). An efficient hybrid strategy for temporal planning. In J. C. Beck & B. M. Smith (Eds.), Lecture notes in computer science: Vol.\u00a03990. CPAIOR 2006 (pp. 273\u2013287). Berlin: Springer."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-008-0079-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-008-0079-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-008-0079-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:41Z","timestamp":1559468381000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-008-0079-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,3]]},"references-count":52,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["79"],"URL":"https:\/\/doi.org\/10.1007\/s10951-008-0079-3","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,9,3]]}}}