{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:30:50Z","timestamp":1761597050243},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2007,10,20]],"date-time":"2007-10-20T00:00:00Z","timestamp":1192838400000},"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":[[2007,10,25]]},"DOI":"10.1007\/s10951-007-0043-7","type":"journal-article","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T09:02:08Z","timestamp":1192784528000},"page":"375-386","source":"Crossref","is-referenced-by-count":24,"title":["Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem"],"prefix":"10.1007","volume":"10","author":[{"given":"V\u00e9ronique","family":"Bouffard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacques A.","family":"Ferland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,10,20]]},"reference":[{"key":"43_CR1","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1023\/A:1010949931021","volume":"102","author":"J. Alcaraz","year":"2001","unstructured":"Alcaraz, J., & Maroto, C. (2001). A robust algorithm for resource allocation in project scheduling. Annals of Operations Research, 102, 83\u2013109.","journal-title":"Annals of Operations Research"},{"key":"43_CR2","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0305-0548(89)90053-1","volume":"16","author":"J. Aubin","year":"1989","unstructured":"Aubin, J., & Ferland, J. A. (1989). A\u00a0large scale timetabling problem. Computers and Operations Research, 16, 67\u201377.","journal-title":"Computers and Operations Research"},{"key":"43_CR3","first-page":"1","volume-title":"Meta-heuristics: advances and trends in local search paradigms for optimization","author":"T. Baar","year":"1998","unstructured":"Baar, T., Brucker, P., & Knust, S. (1998). Tabu-search algorithms and lower bounds for the resource-constrained project scheduling problem. In S. Voss, S. Martello, I. Osman, & C. Roucairol (Eds.), Meta-heuristics: advances and trends in local search paradigms for optimization (pp. 1\u201318). Dordrecht: Kluwer Academic."},{"key":"43_CR4","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1023\/A:1018995000688","volume":"92","author":"P. Baptiste","year":"1999","unstructured":"Baptiste, P., Le Pape, C., & Nuijten, W. (1999). Satisfiability and time-bound adjustments for cumulative scheduling problems. Annals of Operations Research, 92, 305\u2013333.","journal-title":"Annals of Operations Research"},{"key":"43_CR5","unstructured":"Blazewicz, J. (1978). Complexity of computer scheduling algorithms under resources constraints. In Proceedings first meeting AFCET-SMF on applied mathematics (pp. 169\u2013178), Palaiseau, Poland."},{"key":"43_CR6","unstructured":"Bouffard, V. (2003). M\u00e9thodes heuristiques pour un probl\u00e8me d\u2019ordonnancement avec contraintes sur les ressources. Master thesis, D\u00e9partement d\u2019informatique et de recherche op\u00e9rationnelle, Universit\u00e9 de Montr\u00e9al, Canada, April 2003."},{"key":"43_CR7","first-page":"19","volume-title":"Proceedings of the sixth international workshop on project management and scheduling","author":"K. Bouleimen","year":"1998","unstructured":"Bouleimen, K., & Lecocq, H. (1998). A\u00a0new efficient simulated annealing algorithm for the resource-constrained project scheduling problem. In G. Barbaso\u01e7lu, S. Karabati, L. Ozdamar, & G. Ulusoy (Eds.), Proceedings of the sixth international workshop on project management and scheduling (pp. 19\u201322). Istanbul: Bo\u01e7azi\u00e7i University Pringing Office."},{"key":"43_CR8","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/3-540-44629-X_17","volume-title":"PATAT III","author":"P. Brucker","year":"2001","unstructured":"Brucker, P., & Knust, S. (2001). Resource-constrained project scheduling and timetabling. In E. Burke & W. Erben (Eds.), Lecture notes in computer science : Vol. 2079. PATAT III (pp. 277\u2013293). Berlin: Springer."},{"key":"43_CR9","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., M\u00f6hring, R., Neumann, K., & Pesch, E. (1999). Resource-constrained project scheduling: notation, classification, models, and methods. European Journal of Operational Research, 112, 3\u201341.","journal-title":"European Journal of Operational Research"},{"key":"43_CR10","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1016\/S0377-2217(02)00069-3","volume":"140","author":"E. K. Burke","year":"2002","unstructured":"Burke, E. K., & Petrovic, S. (2002). Recent research directions in automated timetabling. European Journal of Operational Research, 140, 266\u2013280.","journal-title":"European Journal of Operational Research"},{"key":"43_CR11","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1023\/A:1018968332237","volume":"83","author":"J. Carlier","year":"1998","unstructured":"Carlier, J., & Pinson, E. (1998). Jackson\u2019s pseudo-preemptive schedule for the P m \/r i ,q i \/C max\u2009 scheduling problem. Annals of Operations Research, 83, 41\u201358.","journal-title":"Annals of Operations Research"},{"key":"43_CR12","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V. Cerny","year":"1985","unstructured":"Cerny, V. (1985). Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm. Journal of Optimization Theory and Applications, 45, 41\u201351.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"43_CR13","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0377-2217(85)90167-5","volume":"19","author":"D. Werra de","year":"1985","unstructured":"de Werra, D. (1985). An introduction to timetabling. European Journal of Operational Research, 19, 151\u2013162.","journal-title":"European Journal of Operational Research"},{"key":"43_CR14","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1006\/jcph.1993.1010","volume":"104","author":"G. Dueck","year":"1993","unstructured":"Dueck, G. (1993). New optimization heuristics: the great deluge algorithm and the record-to-record travel. Journal of computational Physics, 104, 86\u201392.","journal-title":"Journal of computational Physics"},{"key":"43_CR15","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","volume":"90","author":"G. Dueck","year":"1990","unstructured":"Dueck, G., & Scheuer, T. (1990). Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. Journal of Computational Physics, 90, 161\u2013175.","journal-title":"Journal of Computational Physics"},{"key":"43_CR16","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1287\/opre.44.2.347","volume":"44","author":"J. A. Ferland","year":"1996","unstructured":"Ferland, J. A., Hertz, A., & Lavoie, A. (1996). An object-oriented methodology for solving assignment-type problems with neighborhood search techniques. Operations Research, 44, 347\u2013359.","journal-title":"Operations Research"},{"key":"43_CR17","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F. Glover","year":"1986","unstructured":"Glover, F. (1986). Future path for integer programming and links to artificial intelligence. Computers and Operations Research, 13, 533\u2013549.","journal-title":"Computers and Operations Research"},{"key":"43_CR18","unstructured":"Hansen, P. (1986). The steepest ascent mildest descent heuristic for combinatorial programming. In: Congress on numerical methods in combinatorial optimization, Capri, Italy."},{"key":"43_CR19","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., & Mladonovi\u0107, N. (2001). Variable neighborhood search: principles and applications. European Journal of Operations Research, 130, 449\u2013467.","journal-title":"European Journal of Operations Research"},{"key":"43_CR20","doi-asserted-by":"crossref","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. (1998). A\u00a0competitive genetic algorithm for resource-constrained project scheduling. Naval Research Logistics, 45, 733\u2013750.","journal-title":"Naval Research Logistics"},{"key":"43_CR21","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0377-2217(93)90231-B","volume":"70","author":"D. E. Jeffcoat","year":"1993","unstructured":"Jeffcoat, D. E., & Bulfin, R. L. (1993). Simulated-annealing for resource-constrained scheduling. European Journal of Operational Research, 70, 43\u201351.","journal-title":"European Journal of Operational Research"},{"key":"43_CR22","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1016\/0305-0548(94)90018-3","volume":"21","author":"J. P. Kelly","year":"1994","unstructured":"Kelly, J. P., Laguna, M., & Glover, F. (1994). A\u00a0study of diversification strategies for the quadratic assignment problem. Computers and Operations Research, 21, 885\u2013893.","journal-title":"Computers and Operations Research"},{"key":"43_CR23","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatric","year":"1983","unstructured":"Kirkpatric, S., Gelatt, C. D. Jr., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220, 671\u2013680.","journal-title":"Science"},{"key":"43_CR24","doi-asserted-by":"crossref","first-page":"1693","DOI":"10.1287\/mnsc.41.10.1693","volume":"41","author":"R. Kolisch","year":"1995","unstructured":"Kolisch, R., Sprecher, A., & Drexl, A. (1995). Characterization and generation of resource-constrained project scheduling problems. Management Science, 41, 1693\u20131703.","journal-title":"Management Science"},{"issue":"11","key":"43_CR25","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., & Hansen, P. (1997). Variable neighborhood search. Computers and Operations Research, 24(11), 1097\u20131100.","journal-title":"Computers and Operations Research"},{"key":"43_CR26","volume-title":"Handbook of scheduling: algorithms, models, and performance analysis","author":"S. Petrovic","year":"2004","unstructured":"Petrovic, S., & Burke, E. K. (2004). University timetabling. In J. Y. -T. Leung (Ed.), Handbook of scheduling: algorithms, models, and performance analysis. Boca Raton: CRC Press, Chap.\u00a045."},{"key":"43_CR27","first-page":"1","volume-title":"Modern heuristic search methods","author":"C. R. Reeves","year":"1996","unstructured":"Reeves, C. R. (1996). Modern heuristic techniques. In V. J. R. Smith, I.\u00a0H.\u00a0Osman, C. R. Reeves, & G. D. Smith (Eds.), Modern heuristic search methods (pp. 1\u201325). New York: Wiley."},{"key":"43_CR28","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1023\/A:1006576209967","volume":"13","author":"A. Schaerf","year":"1999","unstructured":"Schaerf, A. (1999a). A\u00a0survey of automated timetabling. Artificial Intelligence Review, 13, 87\u2013127.","journal-title":"Artificial Intelligence Review"},{"key":"43_CR29","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1109\/3468.769755","volume":"29","author":"A. Schaerf","year":"1999","unstructured":"Schaerf, A. (1999b). Local search techniques for large high school timetabling problems. IEEE Transactions on Systems, Man and Cybernetics, Part\u00a0A, 29, 368\u2013377.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics, Part\u00a0A"},{"key":"43_CR30","first-page":"53","volume-title":"Proceedings of the 6th international conference on the practice and theory of automated timebabling","author":"A. Schaerf","year":"2006","unstructured":"Schaerf, A. (2006). Measurability and reproducibility in timetabling. In E. K. Burke & H. Rudova (Eds.), Proceedings of the 6th international conference on the practice and theory of automated timebabling (pp. 53\u201362). Brno: Masaryk University."},{"key":"43_CR31","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0166-218X(97)00045-0","volume":"79","author":"A. Srivastav","year":"1997","unstructured":"Srivastav, A., & Stangier, P. (1997). Tight approximations for resource constrained scheduling and bin packing. Discrete Applied Mathematics, 79, 223\u2013245.","journal-title":"Discrete Applied Mathematics"},{"key":"43_CR32","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E. Taillard","year":"1991","unstructured":"Taillard, E. (1991). Robust tabu search for the quadratic assignment problem. Parallel Computing, 17, 443\u2013455.","journal-title":"Parallel Computing"},{"key":"43_CR33","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","volume":"40","author":"P. J. M. Laarhoven Van","year":"1992","unstructured":"Van Laarhoven, P. J. M., Aarts, E. H. L., & Lenstra, J. K. (1992). Job shop scheduling by simulated annealing. Operations Research, 40, 113\u2013125.","journal-title":"Operations Research"},{"key":"43_CR34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/07408170490257862","volume":"36","author":"G. Zhang","year":"2004","unstructured":"Zhang, G., Cai, X., & Wong, C. K. (2004). Some results on resource constrained scheduling. IIE Transactions, 36, 1\u20139.","journal-title":"IIE Transactions"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-007-0043-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-007-0043-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-007-0043-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:40Z","timestamp":1559453980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-007-0043-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,20]]},"references-count":34,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2007,10,25]]}},"alternative-id":["43"],"URL":"https:\/\/doi.org\/10.1007\/s10951-007-0043-7","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,20]]}}}