{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:48:02Z","timestamp":1740098882349,"version":"3.37.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319600413"},{"type":"electronic","value":"9783319600420"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-60042-0_11","type":"book-chapter","created":{"date-parts":[[2017,6,3]],"date-time":"2017-06-03T04:32:44Z","timestamp":1496464364000},"page":"102-111","source":"Crossref","is-referenced-by-count":2,"title":["A Hybrid of Tabu Search and Simulated Annealing Algorithms for Preemptive Project Scheduling Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3391-8411","authenticated-orcid":false,"given":"Behrouz","family":"Afshar-Nadjafi","sequence":"first","affiliation":[]},{"given":"Mehdi","family":"Yazdani","sequence":"additional","affiliation":[]},{"given":"Mahyar","family":"Majlesi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,4]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","volume":"5","author":"J Blazewicz","year":"1983","unstructured":"Blazewicz, J., Lenstra, J., Rinnooy Kan, A.: Scheduling subject to resource constraints: classification and complexity. Discrete Appl. Math. 5, 11\u201324 (1983)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"11_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2009.11.005","volume":"207","author":"S Hartmann","year":"2010","unstructured":"Hartmann, S., Briskorn, D.A.: Surveys of variants and extensions of the resource constrained project scheduling problem. Eur. J. Oper. Res. 207(1), 1\u201314 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"11_CR3","doi-asserted-by":"crossref","first-page":"890","DOI":"10.1016\/j.cor.2011.07.010","volume":"39","author":"C Fang","year":"2012","unstructured":"Fang, C., Wang, L.: An effective shuffled frog-learning algorithm for resource constrained project scheduling problem. Comput. Oper. Res. 39(5), 890\u2013901 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"11_CR4","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/s10288-011-0156-x","volume":"10","author":"O Kone","year":"2012","unstructured":"Kone, O.: New approaches for solving the resource constrained project scheduling problem. 4OR 10(1), 105\u2013106 (2012)","journal-title":"4OR"},{"issue":"4","key":"11_CR5","doi-asserted-by":"crossref","first-page":"3983","DOI":"10.1016\/j.eswa.2011.09.062","volume":"39","author":"DC Paraskevopoulos","year":"2012","unstructured":"Paraskevopoulos, D.C., Tarantilis, C.D., Ioannou, G.: Solving project scheduling problems with resource constraints via an event list-based evolutionary algorithm. Expert Syst. Appl. 39(4), 3983\u20133994 (2012)","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"11_CR6","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/j.ejor.2009.03.034","volume":"201","author":"V Peteghem Van","year":"2010","unstructured":"Van Peteghem, V., Vanhoucke, M.: A genetic algorithm for the preemptive and non-preemptive multi-mode resource constrained project scheduling problem. Eur. J. Oper. Res. 201(2), 409\u2013418 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"11_CR7","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.compchemeng.2014.06.012","volume":"69","author":"B Afshar-Nadjafi","year":"2014","unstructured":"Afshar-Nadjafi, B., Majlesi, M.: Resource constrained project scheduling problem with setup times after preemptive processes. Comput. Chem. Eng. 69, 16\u201325 (2014)","journal-title":"Comput. Chem. Eng."},{"key":"11_CR8","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/j.ejor.2014.12.037","volume":"244","author":"A Moukrim","year":"2015","unstructured":"Moukrim, A., Quilliot, A., Toussaint, H.: An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration. Eur. J. Oper. Res. 244, 360\u2013368 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"11_CR9","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1016\/j.future.2009.01.004","volume":"25","author":"V Roshanaei","year":"2009","unstructured":"Roshanaei, V., Naderi, B., Jolai, F., Khalili, M.: A variable neighborhood search for job shop scheduling with setup times to minimize makespan. Future Gener. Comput. Syst. 25, 654\u2013661 (2009)","journal-title":"Future Gener. Comput. Syst."},{"issue":"6","key":"11_CR10","doi-asserted-by":"crossref","first-page":"1114","DOI":"10.1016\/j.engappai.2012.05.017","volume":"25","author":"MS Nagano","year":"2012","unstructured":"Nagano, M.S., Silva, A.A., Lorena, L.A.N.: A new evolutionary clustering search for a no-wait flow shop problem with setup times. Eng. Appl. Artif. Intell. 25(6), 1114\u20131120 (2012)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"1","key":"11_CR11","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.camwa.2011.10.077","volume":"63","author":"CJ Liao","year":"2012","unstructured":"Liao, C.J., Chao, C.W., Chen, L.C.: An improved heuristic for parallel machine weighted flow time scheduling with family setup times. Comput. Math. Appl. 63(1), 110\u2013117 (2012)","journal-title":"Comput. Math. Appl."},{"key":"11_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-50296-5","volume-title":"Project Scheduling Under Resource Constraints - Efficient Heuristics for Several Problem Classes","author":"R Kolisch","year":"1995","unstructured":"Kolisch, R.: Project Scheduling Under Resource Constraints - Efficient Heuristics for Several Problem Classes. Physica, Heidelberg (1995)"},{"key":"11_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Norwell (1997)"},{"key":"11_CR14","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science 220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"11_CR15","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/S0377-2217(99)00485-3","volume":"127","author":"S Hartmann","year":"2000","unstructured":"Hartmann, S., Kolisch, R.: Experimental evaluation of state-of-the-art heuristics for the resource constrained project scheduling problem. Eur. J. Oper. Res. 127, 394\u2013407 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"11_CR16","unstructured":"Pitsoulis, L.S., Resende, M.G.C.: Greedy randomized adaptive search procedure. In: Pardalos, P., Resende, M. (eds.) Handbook of Applied Optimization, pp. 168\u2013183. Oxford University Press, Oxford (2002)"},{"key":"11_CR17","volume-title":"Introduction to Quality Engineering","author":"G Taguchi","year":"1986","unstructured":"Taguchi, G.: Introduction to Quality Engineering. Asian Productivity Organization, Tokyo (1986)"},{"key":"11_CR18","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0377-2217(99)00205-2","volume":"125","author":"A Drexl","year":"2000","unstructured":"Drexl, A., Nissen, R., Patterson, J.H., Salewski, F.: ProGen\/\u03c0x - an instance generator for resource constrained project scheduling problems with partially renewable resources and further extensions. Eur. J. Oper. Res. 125, 59\u201372 (2000)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence: From Theory to Practice"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60042-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,3]],"date-time":"2017-06-03T04:35:46Z","timestamp":1496464546000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-60042-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319600413","9783319600420"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60042-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}