{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:45:36Z","timestamp":1740149136675,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,5,25]],"date-time":"2021-05-25T00:00:00Z","timestamp":1621900800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,25]],"date-time":"2021-05-25T00:00:00Z","timestamp":1621900800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s12351-021-00647-0","type":"journal-article","created":{"date-parts":[[2021,5,25]],"date-time":"2021-05-25T15:31:20Z","timestamp":1621956680000},"page":"1639-1673","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimizing makespan under data prefetching constraints for embedded vision systems: a study of optimization methods and their performance"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3739-2899","authenticated-orcid":false,"given":"Khadija","family":"Hadj Salem","sequence":"first","affiliation":[]},{"given":"Vincent","family":"Jost","sequence":"additional","affiliation":[]},{"given":"Yann","family":"Kieffer","sequence":"additional","affiliation":[]},{"given":"Luc","family":"Libralesso","sequence":"additional","affiliation":[]},{"given":"St\u00e9phane","family":"Mancini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,25]]},"reference":[{"issue":"1","key":"647_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0360-8352(02)00183-3","volume":"44","author":"M Al-Fawzan","year":"2003","unstructured":"Al-Fawzan M, Al-Sultan KS (2003) A tabu search based algorithm for minimizing the number of tool switches on a flexible machine. Comput Ind Eng 44(1):35\u201347","journal-title":"Comput Ind Eng"},{"doi-asserted-by":"crossref","unstructured":"Amaya J, Cotta C, Fern\u00e1ndez A (2008) A memetic algorithm for the tool switching problem. In: Hybrid metaheuristics, Springer, p 190\u2013202","key":"647_CR5","DOI":"10.1007\/978-3-540-88439-2_14"},{"issue":"1\u20133","key":"647_CR6","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0166-218X(99)00139-0","volume":"99","author":"C Arbib","year":"2000","unstructured":"Arbib C, Flammini M, Nardelli E (2000) How to survive while visiting a graph. Discrete Appl Math 99(1\u20133):279\u2013293","journal-title":"Discrete Appl Math"},{"issue":"4","key":"647_CR7","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1080\/07408178808966195","volume":"20","author":"J Bard","year":"1988","unstructured":"Bard J (1988) A heuristic for minimizing the number of tool switches on a flexible machine. IIE Trans 20(4):382\u2013391","journal-title":"IIE Trans"},{"doi-asserted-by":"crossref","unstructured":"Bellas N, Chai S, Dwyer M, Linzmeier D (2009) Real-time fisheye lens distortion correction using automatically generated streaming accelerators. In: 17th IEEE symposium on field programmable custom computing machines, FCCM\u201909. p 149\u2013156","key":"647_CR8","DOI":"10.1109\/FCCM.2009.16"},{"unstructured":"Benoist T, Estellon B, Gardi F, Megel R, Nouioua K. (2011) Localsolver 1. x: a black-box local-search solver for 0-1 programming. 4 or 9(3):299","key":"647_CR9"},{"unstructured":"Calmels D (2018) The job sequencing and tool switching problem: state-of-the-art literature review, classification, and trends. Int J Prod Res, p 1\u201321","key":"647_CR10"},{"issue":"3","key":"647_CR11","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1016\/j.ejor.2015.02.018","volume":"244","author":"D Catanzaro","year":"2015","unstructured":"Catanzaro D, Gouveia L, Labb\u00e9 M (2015) Improved integer linear programming formulations for the job sequencing and tool switching problem. Euro J Opera Res 244(3):766\u2013777","journal-title":"Euro J Opera Res"},{"issue":"4","key":"647_CR12","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1051\/ro:2007036","volume":"41","author":"H Cherroun","year":"2007","unstructured":"Cherroun H, Darte A, Feautrier P (2007) Reservation table scheduling: branch-and-bound based optimization vs. integer linear programming techniques. RAIRO-Oper Res 41(4):427\u2013454","journal-title":"RAIRO-Oper Res"},{"issue":"1","key":"647_CR13","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01324874","volume":"6","author":"Y Crama","year":"1994","unstructured":"Crama Y, Kolen A, Oerlemans A, Spieksma F (1994) Minimizing the number of tool switches on a flexible machine. Int J Flex Manuf Syst 6(1):33\u201354","journal-title":"Int J Flex Manuf Syst"},{"issue":"3","key":"647_CR14","first-page":"243","volume":"22","author":"P Feautrier","year":"1988","unstructured":"Feautrier P (1988) Parametric integer programming. Revue fran\u00e7aise d\u2019automatique, d\u2019informatique et de recherche op\u00e9rationnelle 22(3):243\u2013268","journal-title":"Revue fran\u00e7aise d\u2019automatique, d\u2019informatique et de recherche op\u00e9rationnelle"},{"issue":"2","key":"647_CR15","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"M Garey","year":"1976","unstructured":"Garey M, Johnson D, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1(2):117\u2013129","journal-title":"Math Oper Res"},{"key":"647_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1665-5","volume-title":"Handbook of metaheuristics","author":"M Gendreau","year":"2010","unstructured":"Gendreau M, Potvin J (2010) Handbook of metaheuristics, vol 2. Springer, Berlin"},{"key":"647_CR17","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R Graham","year":"1979","unstructured":"Graham R, Lawler E, Lenstra J, Rinnooy Kan A (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Annal Discret Math 5:287\u2013326","journal-title":"Annal Discret Math"},{"unstructured":"Hadj\u00a0Salem K, Kieffer Y, Mancini M (2016) Formulation and practical solution for the optimization of memory accesses in embedded vision systems. In: Proceedings of the 2016 federated conference on computer science and information systems, FedCSIS 2016, Gda\u0144sk, Poland, 11\u201314 Sept 2016, p 609\u2013617","key":"647_CR18"},{"doi-asserted-by":"crossref","unstructured":"Hadj\u00a0Salem K, Kieffer Y, Mancini M (2018) Meeting the challenges of optimized memory management in embedded vision systems using operations research, Springer International Publishing, p 177\u2013205","key":"647_CR19","DOI":"10.1007\/978-3-319-59861-1_11"},{"issue":"8","key":"647_CR20","first-page":"689","volume":"30","author":"A Hertz","year":"1998","unstructured":"Hertz A, Laporte G, Mittaz M, Stecke K (1998) Heuristics for minimizing tool switches when scheduling part types on a flexible machine. IIE Trans 30(8):689\u2013694","journal-title":"IIE Trans"},{"unstructured":"Ibm ilog cplex optimization. http:\/\/ibmdecisionoptimization.github.io\/docplex-doc\/cp\/index.html","key":"647_CR1"},{"issue":"1","key":"647_CR21","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1080\/07408170490257871","volume":"36","author":"G Laporte","year":"2004","unstructured":"Laporte G, Salazar-Gonzalez J, Semet F (2004) Exact algorithms for the job sequencing and tool switching problem. IIE Trans 36(1):37\u201345","journal-title":"IIE Trans"},{"key":"647_CR22","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","volume":"4","author":"E Lawler","year":"1993","unstructured":"Lawler E, Lenstra J, Rinnooy Kan A, Shmoys D (1993) Sequencing and scheduling: Algorithms and complexity. Handbooks Oper Res Manag Sci 4:445\u2013522","journal-title":"Handbooks Oper Res Manag Sci"},{"unstructured":"Libralesso L, Bouhassoun AM, Cambazard H, Jost V (2019) Tree search algorithms for the sequential ordering problem. arXiv preprint arXiv:1911.12427","key":"647_CR23"},{"unstructured":"Libralesso L, Jost V, Hadj\u00a0Salem K, Fontan F, Maffray F (2019) Triangle width: at the intersection of graph theory, scheduling and matrix visualization. Preprint submitted to Annals of Operations Research","key":"647_CR24"},{"doi-asserted-by":"crossref","unstructured":"Mancini S, Rousseau F (2012) Enhancing non-linear kernels by an optimized memory hierarchy in a high level synthesis flow. In: Proceedings of the conference on design, automation and test in Europe, EDA Consortium, p 1130\u20131133","key":"647_CR25","DOI":"10.1109\/DATE.2012.6176666"},{"issue":"1","key":"647_CR26","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1080\/00207548808947840","volume":"26","author":"P Ow","year":"1988","unstructured":"Ow P, Morton T (1988) Filtered beam search in scheduling. Int J Prod Res 26(1):35\u201362","journal-title":"Int J Prod Res"},{"key":"647_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26580-3","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"M Pinedo","year":"2016","unstructured":"Pinedo M (2016) Scheduling: Theory, Algorithms, and Systems. Springer, Berlin"},{"issue":"2","key":"647_CR28","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF00123680","volume":"6","author":"C Privault","year":"1995","unstructured":"Privault C, Finke G (1995) Modelling a tool switching problem on a single nc-machine. J Intell Manuf 6(2):87\u201394","journal-title":"J Intell Manuf"},{"issue":"2","key":"647_CR29","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/S0377-2217(98)00319-1","volume":"118","author":"I Sabuncuoglu","year":"1999","unstructured":"Sabuncuoglu I, Bayiz M (1999) Job shop scheduling with beam search. Euro J Oper Res 118(2):390\u2013412","journal-title":"Euro J Oper Res"},{"issue":"5","key":"647_CR30","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1287\/opre.36.5.767","volume":"36","author":"C Tang","year":"1988","unstructured":"Tang C, Denardo E (1988) Models arising from a flexible manufacturing machine, part i: minimization of the number of tool switches. Oper Res 36(5):767\u2013777","journal-title":"Oper Res"},{"key":"647_CR31","first-page":"776","volume":"2","author":"A Thornton","year":"1997","unstructured":"Thornton A, Sangwine S (1997) Log-polar sampling incorporating a novel spatially variant filter to improve object recognition. Sixth Int Conf Image Process Appl 2:776\u2013779","journal-title":"Sixth Int Conf Image Process Appl"},{"unstructured":"Tool switching problem benchmarks. http:\/\/www.unet.edu.ve\/~jedgar\/ToSP\/ToSP.htm","key":"647_CR2"},{"unstructured":"Tool switching problem visualization. http:\/\/librallu.gitlab.io\/hypergraph-viz\/","key":"647_CR3"},{"key":"647_CR32","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.cor.2015.11.012","volume":"69","author":"T Vidal","year":"2016","unstructured":"Vidal T (2016) Split algorithm in o (n) for the capacitated vehicle routing problem. Comput Oper Res 69:40\u201347","journal-title":"Comput Oper Res"},{"issue":"2","key":"647_CR33","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1023\/B:VISI.0000013087.49260.fb","volume":"57","author":"P Viola","year":"2004","unstructured":"Viola P, Jones M (2004) Robust real-time face detection. Int J Comput Vision 57(2):137\u2013154","journal-title":"Int J Comput Vision"},{"issue":"9\u201310","key":"647_CR34","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1007\/s00170-003-1925-2","volume":"25","author":"B Zhou","year":"2005","unstructured":"Zhou B, Xi L, Cao Y (2005) A beam-search-based algorithm for the tool switching problem on a flexible machine. Int J Adv Manuf Technol 25(9\u201310):876\u2013882","journal-title":"Int J Adv Manuf Technol"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-021-00647-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-021-00647-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-021-00647-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T14:22:09Z","timestamp":1672237329000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-021-00647-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,25]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["647"],"URL":"https:\/\/doi.org\/10.1007\/s12351-021-00647-0","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"type":"print","value":"1109-2858"},{"type":"electronic","value":"1866-1505"}],"subject":[],"published":{"date-parts":[[2021,5,25]]},"assertion":[{"value":"12 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 May 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}