{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T20:44:14Z","timestamp":1694637854997},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,12,27]],"date-time":"2009-12-27T00:00:00Z","timestamp":1261872000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1007\/s12351-009-0073-3","type":"journal-article","created":{"date-parts":[[2009,12,26]],"date-time":"2009-12-26T07:06:58Z","timestamp":1261811218000},"page":"93-111","source":"Crossref","is-referenced-by-count":5,"title":["A hybrid decomposition procedure for scheduling projects under multiple resource constraints"],"prefix":"10.1007","volume":"11","author":[{"given":"Reza","family":"Zamani","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,12,27]]},"reference":[{"key":"73_CR1","volume-title":"Integrated production control systems-management, analysis, design","author":"DD Bedworth","year":"1982","unstructured":"Bedworth DD, Bailey JE (1982) Integrated production control systems-management, analysis, design. Wiley, New York"},{"issue":"3","key":"73_CR2","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1287\/opre.1060.0358","volume":"55","author":"D Debels","year":"2007","unstructured":"Debels D, Vanhoucke M (2007) A decomposition-based genetic algorithm for the resource-constrained project-scheduling problem. Oper Res 55(3):457","journal-title":"Oper Res"},{"key":"73_CR3","doi-asserted-by":"crossref","unstructured":"Hartmann S, Kolisch R (2000) Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. Eur J Oper Res (127):394\u2013407","DOI":"10.1016\/S0377-2217(99)00485-3"},{"key":"73_CR4","first-page":"347","volume-title":"The critical-path method: resource planning and scheduling. Industrial scheduling. M. J. F. a. T. G. L","author":"J Kelley","year":"1963","unstructured":"Kelley J (1963) The critical-path method: resource planning and scheduling. Industrial scheduling. M. J. F. a. T. G. L. Prentice-Hall, New Jersey, pp 347\u2013365"},{"issue":"3","key":"73_CR5","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0272-6963(95)00032-1","volume":"14","author":"R Kolisch","year":"1996","unstructured":"Kolisch R (1996a) Efficient priority rules for the resource-constrained project scheduling problem. J Oper Manage 14(3):179\u2013192","journal-title":"J Oper Manage"},{"key":"73_CR6","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/0377-2217(95)00357-6","volume":"90","author":"R Kolisch","year":"1996","unstructured":"Kolisch R (1996b) Serial and parallel resource-constrained project scheduling methods revisited: theory and computation. Eur J Oper Res 90:320\u2013333","journal-title":"Eur J Oper Res"},{"issue":"1","key":"73_CR7","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.ejor.2005.01.065","volume":"174","author":"R Kolisch","year":"2006","unstructured":"Kolisch R, Hartmann S (2006) Experimental investigation of heuristics for resource-constrained project scheduling: an update. Eur J Oper Res 174(1):23\u201337","journal-title":"Eur J Oper Res"},{"key":"73_CR8","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"R Kolisch","year":"1996","unstructured":"Kolisch R, Sprecher A (1996) PSPLIB\u2014a project scheduling library. Eur J Oper Res 96:205\u2013216","journal-title":"Eur J Oper Res"},{"key":"73_CR9","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"RE Korf","year":"1985","unstructured":"Korf RE (1985) An optimal admissible tree search. Artif Intell 27:97\u2013100","journal-title":"Artif Intell"},{"issue":"2","key":"73_CR10","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0004-3702(90)90054-4","volume":"42","author":"RE Korf","year":"1990","unstructured":"Korf RE (1990) Real-time heuristic search. Artif Intell 42(2):189\u2013211","journal-title":"Artif Intell"},{"key":"73_CR11","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1016\/0377-2217(92)90320-9","volume":"56","author":"K Li","year":"1992","unstructured":"Li K, Willis R (1992) An iterative scheduling technique for resource-constrained project. Scheduling. Eur J Oper Res 56:370\u2013379","journal-title":"Eur J Oper Res"},{"key":"73_CR12","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1287\/opre.32.1.89","volume":"32","author":"RH M\u00f6hring","year":"1984","unstructured":"M\u00f6hring RH (1984) Minimizing costs of resource requirements in project networks subject to fix completion time. Oper Res 32:89\u2013120","journal-title":"Oper Res"},{"key":"73_CR13","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/S0377-2217(96)00180-4","volume":"100","author":"M Mori","year":"1997","unstructured":"Mori M, Tseng C (1997) A genetic algorithm for multi-mode resource constrained project scheduling problem. Eur J Oper Res 100:134\u2013141","journal-title":"Eur J Oper Res"},{"key":"73_CR14","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1080\/07408179508936773","volume":"27","author":"L \u00d6zdamar","year":"1995","unstructured":"\u00d6zdamar L, Ulusoy G (1995) A survey on the resource-constrained project scheduling problem. IIE Trans 27:574\u2013586","journal-title":"IIE Trans"},{"issue":"1","key":"73_CR15","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1023\/B:ANOR.0000039521.26237.62","volume":"131","author":"M Palpant","year":"2004","unstructured":"Palpant M, Artigues C et al (2004) LSSPER: solving the resource-constrained project scheduling problem with large neighbourhood search. Ann Oper Res 131(1):237\u2013257","journal-title":"Ann Oper Res"},{"issue":"CO2","key":"73_CR16","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1061\/JCCEAZ.0000677","volume":"103","author":"D Panagiotakopoulos","year":"1977","unstructured":"Panagiotakopoulos D (1977a) Cost-time model for large CPM project networks. J Constr Div 103(CO2):201\u2013211","journal-title":"J Constr Div"},{"issue":"2","key":"73_CR17","first-page":"183","volume":"15","author":"D Panagiotakopoulos","year":"1977","unstructured":"Panagiotakopoulos D (1977b) A CPM time-cost computational algorithm for arbitrary activity cost functions. INFOR 15(2):183\u2013195","journal-title":"INFOR"},{"issue":"2","key":"73_CR18","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.ijproman.2007.06.002","volume":"26","author":"L Raymond","year":"2008","unstructured":"Raymond L, Bergeron F (2008) Project management information systems: an empirical study of their impact on project managers and project success. Int J Proj Manage 26(2):213\u2013220","journal-title":"Int J Proj Manage"},{"key":"73_CR19","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1057\/palgrave.jors.2601308","volume":"53","author":"A Sprecher","year":"2002","unstructured":"Sprecher A (2002) Network decomposition techniques for resource-constrained project scheduling. Oper Res Soc 53:405\u2013414","journal-title":"Oper Res Soc"},{"issue":"1","key":"73_CR20","first-page":"1","volume":"28","author":"JP Stinson","year":"1978","unstructured":"Stinson JP (1978) Multiple resource-constrained scheduling using branch and bound. AIIE Trans 28(1):1\u20137","journal-title":"AIIE Trans"},{"issue":"1","key":"73_CR21","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1023\/A:1010997814183","volume":"102","author":"P Tormos","year":"2001","unstructured":"Tormos P, Lova A (2001) A competitive heuristic solution technique for resource-constrained project scheduling. Ann Oper Res 102(1):65\u201381","journal-title":"Ann Oper Res"},{"issue":"2","key":"73_CR22","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1016\/j.ejor.2005.06.014","volume":"175","author":"L-Y Tseng","year":"2006","unstructured":"Tseng L-Y, Chen S-C (2006) A hybrid metaheuristic for the resource-constrained project scheduling problem. Eur J Oper Res 175(2):707\u2013721","journal-title":"Eur J Oper Res"},{"issue":"2","key":"73_CR23","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/S0377-2217(02)00768-3","volume":"149","author":"V Valls","year":"2003","unstructured":"Valls V, Quintanilla S et al (2003) Resource-constrained project scheduling: a critical activity reordering heuristic. Eur J Oper Res 149(2):282\u2013301","journal-title":"Eur J Oper Res"},{"issue":"1","key":"73_CR24","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1023\/B:ANOR.0000039524.09792.c9","volume":"131","author":"V Valls","year":"2004","unstructured":"Valls V, Ballestin F et al (2004) A population-based approach to the resource-constrained project scheduling problem. Ann Oper Res 131(1):305\u2013324","journal-title":"Ann Oper Res"},{"issue":"2","key":"73_CR25","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/j.ejor.2004.04.008","volume":"165","author":"V Valls","year":"2005","unstructured":"Valls V, Ballestin F et al (2005) Justification and RCPSP: a technique that pays. Eur J Oper Res 165(2):375\u2013386","journal-title":"Eur J Oper Res"},{"issue":"2","key":"73_CR26","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/j.ejor.2006.12.033","volume":"185","author":"V Valls","year":"2008","unstructured":"Valls V, Ballestin F et al (2008) A hybrid genetic algorithm for the resource-constrained project scheduling problem. Eur J Oper Res 185(2):495\u2013508","journal-title":"Eur J Oper Res"},{"issue":"1","key":"73_CR27","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1023\/B:AIRE.0000044304.00402.9f","volume":"22","author":"R Zamani","year":"2004","unstructured":"Zamani R (2004a) An effective near-optimal state-space search method: an application to a scheduling problem. Artif Intell Rev 22(1):41\u201369","journal-title":"Artif Intell Rev"},{"issue":"3","key":"73_CR28","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s00291-003-0158-y","volume":"26","author":"R Zamani","year":"2004","unstructured":"Zamani R (2004b) An efficient time-windowing procedure for scheduling projects under multiple resource constraints. OR Spectr 26(3):423\u2013440","journal-title":"OR Spectr"},{"key":"73_CR29","doi-asserted-by":"crossref","unstructured":"Zamani R, Lau SK (2010) Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem. Eur J Oper Res 201:82\u201388","DOI":"10.1016\/j.ejor.2009.02.008"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-009-0073-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-009-0073-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-009-0073-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,19]],"date-time":"2021-10-19T16:20:28Z","timestamp":1634660428000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-009-0073-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12,27]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["73"],"URL":"https:\/\/doi.org\/10.1007\/s12351-009-0073-3","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12,27]]}}}