{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T19:03:26Z","timestamp":1747422206897},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2009,8,29]],"date-time":"2009-08-29T00:00:00Z","timestamp":1251504000000},"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,10]]},"DOI":"10.1007\/s10951-009-0124-x","type":"journal-article","created":{"date-parts":[[2009,8,28]],"date-time":"2009-08-28T11:20:57Z","timestamp":1251458457000},"page":"447-460","source":"Crossref","is-referenced-by-count":4,"title":["The resource-constrained activity insertion problem with\u00a0minimum and maximum time lags"],"prefix":"10.1007","volume":"12","author":[{"given":"Christian","family":"Artigues","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyril","family":"Briand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,8,29]]},"reference":[{"issue":"2","key":"124_CR1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0377-2217(99)00496-8","volume":"127","author":"C. Artigues","year":"2000","unstructured":"Artigues, C., & Roubellat, F. (2000). A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes. European Journal of Operational Research, 127(2), 297\u2013316.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"124_CR2","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/S0377-2217(02)00758-0","volume":"149","author":"C. Artigues","year":"2003","unstructured":"Artigues, C., Michelon, P., & Reusser, S. (2003). Insertion techniques for static and dynamic resource-constrained project scheduling. European Journal of Operational Research, 149(2), 249\u2013267.","journal-title":"European Journal of Operational Research"},{"key":"124_CR3","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02283745","volume":"16","author":"M. Bartusch","year":"1988","unstructured":"Bartusch, M., M\u00f6hring, R.H., & Radermacher, 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":"124_CR4","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01545525","volume":"20","author":"P. Brucker","year":"1998","unstructured":"Brucker, P., & Neyer, J. (1998). Tabu-search for the multi-mode job-shop problem. OR Spektrum, 20, 21\u201328.","journal-title":"OR Spektrum"},{"issue":"1","key":"124_CR5","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.ejor.2003.11.024","volume":"164","author":"C. Duron","year":"2005","unstructured":"Duron, C., Proth, J. M., & Wardi, Y. (2005). Insertion of a random task in a schedule: a real-time approach. European Journal of Operational Research, 164(1), 52\u201363.","journal-title":"European Journal of Operational Research"},{"key":"124_CR6","first-page":"195","volume":"22","author":"Ph. Fortemps","year":"1997","unstructured":"Fortemps, Ph., & Hapke, M. (1997). On the disjunctive graph for project scheduling. Foundations of Computing and Decision Sciences, 22, 195\u2013209.","journal-title":"Foundations of Computing and Decision Sciences"},{"key":"124_CR7","volume-title":"Computers and intractability. A guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability. A guide to the theory of NP-completeness. New York: Freeman."},{"issue":"2","key":"124_CR8","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1016\/j.ejor.2005.12.025","volume":"177","author":"H. Gr\u00f6flin","year":"2007","unstructured":"Gr\u00f6flin, H., & Klinkert, A. (2007). Feasible insertions in job shop scheduling, short cycles and stable sets. European Journal of Operational Research, 177(2), 763\u2013785.","journal-title":"European Journal of Operational Research"},{"issue":"2\u20133","key":"124_CR9","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/S0166-218X(02)00502-4","volume":"128","author":"T. Kis","year":"2003","unstructured":"Kis, T., & Hertz, A. (2003). A lower bound for the job insertion problem. Discrete Applied Mathematics, 128(2\u20133), 395\u2013419.","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"124_CR10","doi-asserted-by":"crossref","first-page":"1308","DOI":"10.1016\/j.ejor.2005.10.077","volume":"185","author":"A. Klinkert","year":"2008","unstructured":"Klinkert, A., Gr\u00f6flin, H., & Pham-Dinh, N. (2008). Feasible job insertions in the multi-processor-task job shop. European Journal of Operational Research, 185(3), 1308\u20131318.","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"124_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/07408170490447348","volume":"36","author":"R. Leus","year":"2004","unstructured":"Leus, R., & Herroelen, W. (2004). Stability and resource allocation in project planning. IIE Transactions, 36(7), 1\u201316.","journal-title":"IIE Transactions"},{"key":"124_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24800-2","volume-title":"Project scheduling with time windows and scarce resources","author":"K. Neumann","year":"2003","unstructured":"Neumann, K., Schwindt, C., & Zimmermann, J. (2003). Project scheduling with time windows and scarce resources. New York: Springer."},{"key":"124_CR13","unstructured":"Vaessens, R. J. M. (1995). Generalized job shop scheduling: complexity and local search. Ph.D. thesis, Eindhoven University of Technology, Rotterdam."},{"issue":"1","key":"124_CR14","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1023\/A:1022235519958","volume":"6","author":"G. E. Vieira","year":"2003","unstructured":"Vieira, G. E., Herrmann, J. W., & Lin, E. (2003). Rescheduling manufacturing systems: A framework of strategies, policies, and methods. Journal of Scheduling, 6(1), 39\u201362.","journal-title":"Journal of Scheduling"},{"issue":"3","key":"124_CR15","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10951-007-0011-2","volume":"10","author":"S. Vonder","year":"2007","unstructured":"Vonder, S., Demeulemeester, E., & Herroelen, W. (2007). A classification of predictive-reactive project scheduling procedures. Journal of Scheduling, 10(3), 195\u2013207.","journal-title":"Journal of Scheduling"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0124-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-009-0124-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0124-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:43Z","timestamp":1559453983000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-009-0124-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,29]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["124"],"URL":"https:\/\/doi.org\/10.1007\/s10951-009-0124-x","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8,29]]}}}