{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T17:36:19Z","timestamp":1768412179087,"version":"3.49.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,4,16]],"date-time":"2016-04-16T00:00:00Z","timestamp":1460764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001824","name":"Grant Agency of the Czech Republic","doi-asserted-by":"crossref","award":["GACR P103\/12\/1994"],"award-info":[{"award-number":["GACR P103\/12\/1994"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s10479-016-2184-6","type":"journal-article","created":{"date-parts":[[2016,4,16]],"date-time":"2016-04-16T14:21:04Z","timestamp":1460816464000},"page":"209-237","update-policy":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Time symmetry of resource constrained project scheduling with general temporal constraints and take-give resources"],"prefix":"10.1007","volume":"248","author":[{"ORCID":"https:\/\/linproxy.fan.workers.dev:443\/https\/orcid.org\/0000-0002-8135-1296","authenticated-orcid":false,"given":"Zden\u011bk","family":"Hanz\u00e1lek","sequence":"first","affiliation":[]},{"given":"P\u0159emysl","family":"\u0160\u016fcha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,16]]},"reference":[{"issue":"5","key":"2184_CR1","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/s10951-009-0124-x","volume":"12","author":"C Artigues","year":"2009","unstructured":"Artigues, C., & Briand, C. (2009). The resource-constrained activity insertion problem with minimum and maximum time lags. Journal of Scheduling, 12(5), 447\u2013460.","journal-title":"Journal of Scheduling"},{"issue":"4","key":"2184_CR2","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s10951-009-0125-9","volume":"14","author":"F Ballest\u00edn","year":"2011","unstructured":"Ballest\u00edn, F., Barrios, A., & Valls, V. (2011). An evolutionary algorithm for the resource-constrained project scheduling problem with minimum and maximum time lags. Journal of Scheduling, 14(4), 391\u2013406.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"2184_CR3","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s10479-010-0788-9","volume":"186","author":"JH Bartels","year":"2011","unstructured":"Bartels, J. H., Gather, T., & Zimmermann, J. (2011). Dismantling of nuclear power plants at optimal NPV. Annals of Operations Research, 186(1), 407\u2013427.","journal-title":"Annals of Operations Research"},{"key":"2184_CR4","unstructured":"Behrmann, G., Brinksma, E., Hendriks, M., Mader, A. (2005). Production scheduling by reachability analysis - a case study. In: Workshop on parallel and distributed real-time systems, p. 140. IEEE Computer Society Press."},{"issue":"1\u20133","key":"2184_CR5","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0166-218X(99)00015-3","volume":"94","author":"P Brucker","year":"1999","unstructured":"Brucker, P., Hilbig, T., & Hurink, J. (1999). A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags. Discrete Applied Mathematics, 94(1\u20133), 77\u201399.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"2184_CR6","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10479-007-0276-z","volume":"159","author":"P Brucker","year":"2008","unstructured":"Brucker, P., & Kampmeyer, T. (2008). Cyclic job shop scheduling problems with blocking. Annals of Operations Research, 159(1), 161\u2013181.","journal-title":"Annals of Operations Research"},{"key":"2184_CR7","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.jpdc.2014.11.005","volume":"77","author":"L Bukata","year":"2015","unstructured":"Bukata, L., Sucha, P., & Hanzalek, Z. (2015). Solving the resource constrained project scheduling problem using the parallel tabu search designed for the CUDA platform. Journal of Parallel and Distributed Computing, 77, 58\u201368.","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"1","key":"2184_CR8","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/A:1013617802515","volume":"8","author":"A Cesta","year":"2002","unstructured":"Cesta, A., Oddi, A., & Smith, S. F. (2002). A constraint-based method for project scheduling with time windows. Journal of Heuristics, 8(1), 109\u2013136.","journal-title":"Journal of Heuristics"},{"key":"2184_CR9","unstructured":"Demeulemeester, E.L., Herroelen, W. (2002). Project scheduling: A research handbook. Kluwer"},{"issue":"1","key":"2184_CR10","first-page":"87","volume":"232","author":"N Hachemi El","year":"2015","unstructured":"El Hachemi, N., El Hallaoui, I., Gendreau, M., & Rousseau, L. M. (2015). Flow-based integer linear programs to solve the weekly log-truck scheduling problem. Annals of Operations Research, 232(1), 87\u201397.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"2184_CR11","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/PL00013356","volume":"23","author":"B Franck","year":"2001","unstructured":"Franck, B., Neumann, K., & Schwindt, C. (2001). Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling. OR Spektrum, 23(3), 297\u2013324.","journal-title":"OR Spektrum"},{"issue":"1","key":"2184_CR12","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10479-012-1106-5","volume":"213","author":"E Gafarov","year":"2014","unstructured":"Gafarov, E., Lazarev, A., & Werner, F. (2014). Approximability results for the resource-constrained project scheduling problem with a single type of resources. Annals of Operations Research, 213(1), 115\u2013130.","journal-title":"Annals of Operations Research"},{"key":"2184_CR13","doi-asserted-by":"crossref","unstructured":"Herroelen, W., De Reyck, B., Demeulemeester, E. (1998). Resource-constrained project scheduling : A survey of recent developments. Computers and Operations Research 25(4), 279\u2013302 Elsevier","DOI":"10.1016\/S0305-0548(97)00055-5"},{"issue":"1","key":"2184_CR14","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/j.cor.2010.05.006","volume":"38","author":"J Hurink","year":"2011","unstructured":"Hurink, J., Kok, A., Paulus, J., & Schutten, J. (2011). Time-constrained project scheduling with adjacent resources. Computers and Operations Research, 38(1), 310\u2013319. Elsevier.","journal-title":"Computers and Operations Research"},{"key":"2184_CR15","unstructured":"Kelbel, J., Hanz\u00e1lek, Z. (2006) A case study on earliness\/tardiness scheduling by constraint programming. In: Twelfth International Conference on Principles and Practice of Constraint Programming, pp. 108\u2013113. Laboratoire d\u2019Informatique de Nantes Atlantique"},{"issue":"1","key":"2184_CR16","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. European Journal of Operational Research, 174(1), 23\u201337.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"2184_CR17","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0004-3702(02)00362-4","volume":"143","author":"P Laborie","year":"2003","unstructured":"Laborie, P. (2003). Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results. Artificial Intelligence, 143(2), 151\u2013188.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"2184_CR18","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s10479-010-0777-z","volume":"186","author":"O Lambrechts","year":"2011","unstructured":"Lambrechts, O., Demeulemeester, E., & Herroelen, W. (2011). Time slack-based techniques for robust project scheduling subject to resource uncertainty. Annals of Operations Research, 186(1), 443\u2013464.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"2184_CR19","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. European Journal of Operational Research, 56(3), 370\u2013379.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"2184_CR20","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/S0377-2217(01)00338-1","volume":"143","author":"A Mascis","year":"2002","unstructured":"Mascis, A., & Pacciarelli, D. (2002). Job-shop scheduling with blocking and no-wait constraints. European Journal of Operational Research, 143(3), 498\u2013517.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"2184_CR21","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/s00291-004-0174-6","volume":"26","author":"C Mellentien","year":"2004","unstructured":"Mellentien, C., Schwindt, C., & Trautmann, N. (2004). Scheduling the factory pick-up of new cars. OR Spectrum, 26(4), 579\u2013601.","journal-title":"OR Spectrum"},{"key":"2184_CR22","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. Berlin: Springer."},{"issue":"3","key":"2184_CR23","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/s001860200251","volume":"56","author":"K Neumann","year":"2002","unstructured":"Neumann, K., & Schwindt, C. (2002). Project scheduling with inventory constraints. Mathematical Methods of Operations Research, 56(3), 513\u2013533.","journal-title":"Mathematical Methods of Operations Research"},{"issue":"1\u20134","key":"2184_CR24","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., & Michelon, P. (2004). LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search. Annals of Operations Research, 131(1\u20134), 237\u2013257.","journal-title":"Annals of Operations Research"},{"key":"2184_CR25","unstructured":"Rau, B.R. (2000). Iterative modulo scheduling. In: PROGRESS 2000 Workshop on Embedded Systems, Utrecht, The Netherlands."},{"key":"2184_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-27852-4","volume-title":"Resource allocation in project management","author":"C Schwindt","year":"2005","unstructured":"Schwindt, C. (2005). Resource allocation in project management. Berlin: Springer."},{"issue":"6","key":"2184_CR27","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1111\/1475-3995.00427","volume":"10","author":"C Schwindt","year":"2003","unstructured":"Schwindt, C., & Trautmann, N. (2003). Scheduling the production of rolling ingots: Industrial context, model and solution method. International Transactions in Operational Research, 10(6), 547\u2013563.","journal-title":"International Transactions in Operational Research"},{"key":"2184_CR28","unstructured":"Smith, T.B. (2004) An effective algorithm for project scheduling with arbitrary temporal constraints. In: Proceedings of the 19th National Conference on Artificial Intelligence., pp. 544\u2013549. AAAI Press, Menlo Park, California, San Jose, California, USA."},{"issue":"1","key":"2184_CR29","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1007\/s10479-015-1976-4","volume":"235","author":"O Sobeyko","year":"2015","unstructured":"Sobeyko, O., & M\u00f6nch, L. (2015). Grouping genetic algorithms for solving single machine multiple orders per job scheduling problems. Annals of Operations Research, 235(1), 709\u2013739.","journal-title":"Annals of Operations Research"},{"key":"2184_CR30","doi-asserted-by":"crossref","unstructured":"Terada, J., Vo, H., Joslin, D. (2006). Combining genetic algorithms with squeaky-wheel optimization. In: GECCO \u201906: Proceedings of the 8th annual conference on Genetic and evolutionary computation, pp. 1329\u20131336. ACM Press, New York, NY, USA.","DOI":"10.1145\/1143997.1144203"},{"issue":"1\u20134","key":"2184_CR31","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. Annals of Operations Research, 102(1\u20134), 65\u201381.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"2184_CR32","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., & Quintanilla, S. (2005). Justification and RCPSP: A technique that pays. European Journal of Operational Research, 165(2), 375\u2013386. Project Management and Scheduling.","journal-title":"European Journal of Operational Research"}],"updated-by":[{"DOI":"10.1007\/s10479-017-2704-z","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2017,11,21]],"date-time":"2017-11-21T00:00:00Z","timestamp":1511222400000}}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2184-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/article\/10.1007\/s10479-016-2184-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2184-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2184-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T15:42:53Z","timestamp":1567784573000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/10.1007\/s10479-016-2184-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,16]]},"references-count":32,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["2184"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1007\/s10479-016-2184-6","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s10479-017-2704-z","asserted-by":"object"}]},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,16]]}}}