{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T18:07:57Z","timestamp":1764785277253,"version":"3.41.2"},"reference-count":31,"publisher":"World Scientific Pub Co Pte Ltd","issue":"06","funder":[{"name":"Van Lang University","award":["VLU-RP-202302"],"award-info":[{"award-number":["VLU-RP-202302"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Asia Pac. J. Oper. Res."],"published-print":{"date-parts":[[2024,12]]},"abstract":"<jats:p> We address in this paper a variant of the scheduling-location (ScheLoc) problem on tree networks with interval edge lengths where the total deviation of the uncertain data cannot exceed a threshold. We further use the minmax regret concept to deal with the corresponding uncertainty. In order to solve the problem, we investigate the structure of the schedule which leads to the maximum regret value at a fixed point. Then we consider the machine location belonging to a specific edge of the tree and partition the underlying edge into regions with linear maximum regret function. Finally, we develop a combinatorial algorithm that solves the minmax regret ScheLoc problem in polynomial time based on a finite dominating set approach. <\/jats:p>","DOI":"10.1142\/s0217595924500027","type":"journal-article","created":{"date-parts":[[2024,1,15]],"date-time":"2024-01-15T07:11:37Z","timestamp":1705302697000},"source":"Crossref","is-referenced-by-count":1,"title":["The Minmax Regret Scheduling-Location Problem on Trees with Interval-Data Edge Lengths"],"prefix":"10.1142","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0068-7055","authenticated-orcid":false,"given":"Huy Minh","family":"Le","sequence":"first","affiliation":[{"name":"Faculty of Fundamental Sciences, Van Lang University, 69\/68 Dang Thuy Tram Street, Ward 13, Binh Thanh District, Ho Chi Minh City, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7522-4557","authenticated-orcid":false,"given":"Kien Trung","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Teacher College, Can Tho University, 3\/2 Street, Can Tho City, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liem Dinh","family":"Tien","sequence":"additional","affiliation":[{"name":"Faculty of Fundamental Sciences, Van Lang University, 69\/68 Dang Thuy Tram Street, Ward 13, Binh Thanh District, Ho Chi Minh City, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2024,2,29]]},"reference":[{"key":"S0217595924500027BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00257-X"},{"key":"S0217595924500027BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2020.10.003"},{"key":"S0217595924500027BIB003","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050"},{"key":"S0217595924500027BIB004","doi-asserted-by":"publisher","DOI":"10.1137\/080734510"},{"volume-title":"Scheduling Algorithms","year":"2007","author":"Brucker P","key":"S0217595924500027BIB005"},{"key":"S0217595924500027BIB006","doi-asserted-by":"publisher","DOI":"10.1142\/S021759592150007X"},{"key":"S0217595924500027BIB007","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199803)31:2<93::AID-NET4>3.0.CO;2-E"},{"key":"S0217595924500027BIB008","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032343"},{"key":"S0217595924500027BIB009","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-008-0094-4"},{"key":"S0217595924500027BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.vaccine.2022.09.079"},{"key":"S0217595924500027BIB011","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.3.450"},{"key":"S0217595924500027BIB012","first-page":"77","volume":"16","author":"Hennes H","year":"2007","journal-title":"Studied Locational Analysis"},{"volume-title":"Integration of Scheduling and Location Models","year":"2005","author":"Hennes H","key":"S0217595924500027BIB013"},{"volume-title":"Scheduling-Location Algorithms with Application in Evacuation Planning","year":"2016","author":"He\u00dfler C","key":"S0217595924500027BIB014"},{"volume-title":"Scheduling-Location (ScheLoc): Models, Theory and Algorithms","year":"2009","author":"Kalsch MT","key":"S0217595924500027BIB015"},{"key":"S0217595924500027BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.04.014"},{"key":"S0217595924500027BIB017","first-page":"159","volume-title":"Sequencing and Scheduling with Inaccurate Data","author":"Kasperski A","year":"2014"},{"key":"S0217595924500027BIB018","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2620-6"},{"key":"S0217595924500027BIB019","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2019.11.001"},{"key":"S0217595924500027BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70743-X"},{"key":"S0217595924500027BIB021","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.10.003"},{"volume-title":"Discrete Location Theory","year":"1990","author":"Mirchandani PB","key":"S0217595924500027BIB022"},{"key":"S0217595924500027BIB023","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.06.064"},{"key":"S0217595924500027BIB024","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595922500336"},{"volume-title":"Location Theory","year":"2008","author":"Nickel S","key":"S0217595924500027BIB025"},{"volume-title":"Scheduling: Theory, Algorithms, and Systems","year":"2008","author":"Pinedo ML","key":"S0217595924500027BIB026"},{"key":"S0217595924500027BIB027","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.5.1154"},{"key":"S0217595924500027BIB028","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2022.102617"},{"key":"S0217595924500027BIB029","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmsy.2022.04.018"},{"key":"S0217595924500027BIB030","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595921500135"},{"key":"S0217595924500027BIB031","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105704"}],"container-title":["Asia-Pacific Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0217595924500027","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T06:05:12Z","timestamp":1736402712000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0217595924500027"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,29]]},"references-count":31,"journal-issue":{"issue":"06","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["10.1142\/S0217595924500027"],"URL":"https:\/\/doi.org\/10.1142\/s0217595924500027","relation":{},"ISSN":["0217-5959","1793-7019"],"issn-type":[{"type":"print","value":"0217-5959"},{"type":"electronic","value":"1793-7019"}],"subject":[],"published":{"date-parts":[[2024,2,29]]},"article-number":"2450002"}}