{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:55:05Z","timestamp":1740142505771,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Van Lang University"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s40314-024-02650-5","type":"journal-article","created":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T09:13:37Z","timestamp":1711962817000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An integrated approach for allocation and scheduling-location problems on graphs"],"prefix":"10.1007","volume":"43","author":[{"given":"Kien Trung","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0068-7055","authenticated-orcid":false,"given":"Huy Minh","family":"Le","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,1]]},"reference":[{"key":"2650_CR1","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","volume":"28","author":"E Balas","year":"1980","unstructured":"Balas E, Zemel E (1980) An algorithm for large zero-one knapsack problems. Oper Res 28:1130\u20131154","journal-title":"Oper Res"},{"issue":"1","key":"2650_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/1884639","volume":"101","author":"BD Bernheim","year":"1986","unstructured":"Bernheim BD, Whinston MD (1986) Menu Auctions, Resource Allocation, and Economic Influence. Q J Econ 101(1):1\u201331","journal-title":"Q J Econ"},{"key":"2650_CR3","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/s00453-007-9157-8","volume":"55","author":"B Bhattacharya","year":"2009","unstructured":"Bhattacharya B, Shi Q, Tamir A (2009) Optimal algorithms for the path\/tree-shaped facility location problems in trees. Algorithmica 55:601\u2013618","journal-title":"Algorithmica"},{"key":"2650_CR4","unstructured":"Blazewicz J, Cellary W, Slowinski R, Weglarz J (1986) Scheduling under resource constraints\u2014deterministic models. Ann Oper Res 7"},{"key":"2650_CR5","volume-title":"Career choice and development","author":"D Brown","year":"2002","unstructured":"Brown D (2002) Career choice and development. John Wiley & Sons, New Jersey"},{"key":"2650_CR6","volume-title":"Scheduling algorithms","author":"P Brucker","year":"2007","unstructured":"Brucker P (2007) Scheduling algorithms. Springer Verlag, Heidelberg"},{"key":"2650_CR7","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/0377-2217(87)90240-2","volume":"29","author":"N Christofides","year":"1987","unstructured":"Christofides N, Alvarez-Valdes R, Tamarit JM (1987) Project scheduling with resource constraints: a branch and bound approach. Eur J Oper Res 29:262\u2013273","journal-title":"Eur J Oper Res"},{"key":"2650_CR8","volume-title":"A psychological theory of work adjustment: an individual differences model and its applications","author":"RV Dawis","year":"1984","unstructured":"Dawis RV, Lofquist LH (1984) A psychological theory of work adjustment: an individual differences model and its applications. University of Minnesota Press, Minnesota"},{"issue":"12","key":"2650_CR9","doi-asserted-by":"publisher","first-page":"1590","DOI":"10.1287\/mnsc.37.12.1590","volume":"37","author":"A Drexl","year":"1991","unstructured":"Drexl A (1991) Scheduling of project networks by job assignment. Manag Sci 37(12):1590\u20131602","journal-title":"Manag Sci"},{"key":"2650_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56082-8","volume-title":"Facility location\u2014applications and theory","author":"Z Drezner","year":"2002","unstructured":"Drezner Z, Hamacher HW (2002) Facility location\u2014applications and theory. Springer-Verlag, Berlin-Heidelberg"},{"key":"2650_CR11","volume-title":"Integrated scheduling and location models","author":"H Hennes","year":"2005","unstructured":"Hennes H (2005) Integrated scheduling and location models. Shaker Verlag, Aachen"},{"key":"2650_CR12","first-page":"77","volume":"16","author":"H Hennes","year":"2001","unstructured":"Hennes H, Hamacher HW (2001) Integrated scheduling and location models: single machine makespan problem. Stud Locat Anal 16:77\u201390","journal-title":"Stud Locat Anal"},{"key":"2650_CR13","volume-title":"Scheduling-location algorithms with application in evacuation planning","author":"CJ Hessler","year":"2016","unstructured":"Hessler CJ (2016) Scheduling-location algorithms with application in evacuation planning. Dr Hut Verlag, M\u00fcchen"},{"issue":"2","key":"2650_CR14","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.cor.2009.04.014","volume":"37","author":"MT Kalsch","year":"2010","unstructured":"Kalsch MT, Drezner Z (2010) Solving scheduling and location problems in the plane simultaneously. Comput Oper Res 37(2):256\u2013264","journal-title":"Comput Oper Res"},{"key":"2650_CR15","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems. I: the $$p$$-centers. SIAM J Appl Math 37:513\u2013538","journal-title":"SIAM J Appl Math"},{"key":"2650_CR16","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems. II: the $$p$$-medians. SIAM J Appl Math 37:539\u2013560","journal-title":"SIAM J Appl Math"},{"key":"2650_CR17","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.orl.2019.11.001","volume":"48","author":"SO Krumke","year":"2020","unstructured":"Krumke SO, Le HM (2020) Robust absolute single machine makespan scheduling-location problem on trees. Oper Res Lett 48:29\u201332","journal-title":"Oper Res Lett"},{"issue":"6","key":"2650_CR18","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1016\/j.orl.2022.11.001","volume":"50","author":"SO Krumke","year":"2022","unstructured":"Krumke SO, Le HM (2022) 2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem. Oper Res Lett 50(6):732\u2013737","journal-title":"Oper Res Lett"},{"issue":"8","key":"2650_CR19","doi-asserted-by":"publisher","first-page":"045","DOI":"10.11650\/twjm\/1500405135","volume":"12","author":"TCL Lai","year":"2008","unstructured":"Lai TCL, Chianglin CY, Yu PL (2008) Optimal adjustment of competence set with linear programming. Taiwan J Math 12(8):045\u20132062","journal-title":"Taiwan J Math"},{"key":"2650_CR20","unstructured":"Maheriya A, Patel J (2019) Improve makespan in job allocation using modified Hungarian algorithm in cloud computing. In: proceedings: https:\/\/api.semanticscholar.org\/CorpusID:212731704"},{"key":"2650_CR21","volume-title":"Career development and services: a cognitive approach","author":"GW Peterson","year":"1991","unstructured":"Peterson GW, Sampson JP, Reardon RC (1991) Career development and services: a cognitive approach. Thomson Brooks\/Cole Publishing Co, California"},{"issue":"2","key":"2650_CR22","doi-asserted-by":"publisher","first-page":"501","DOI":"10.11650\/tjm\/190602","volume":"24","author":"VH Pham","year":"2020","unstructured":"Pham VH, Nguyen KT (2020) Inverse anti-$$k$$-centrum problem on networks with variable edge lengths. Taiwan J Math 24(2):501\u2013522","journal-title":"Taiwan J Math"},{"key":"2650_CR23","doi-asserted-by":"crossref","unstructured":"Shahbazia B, Akbarnezhadb A, Reyc D, Ahmadian Fard Fini A (2018) A mathematical job allocation model to maximize career development opportunities for construction workers. In: Proceeding: International Association for automation and robotics in construction (IAARC) 761\u2013766","DOI":"10.22260\/ISARC2018\/0105"},{"key":"2650_CR24","first-page":"252","volume":"10","author":"JP Stinson","year":"1978","unstructured":"Stinson JP, Davis EW, Khumawala BM (1978) Multiple resource constrained scheduling using branch and bound. AHE Trans 10:252\u2013259","journal-title":"AHE Trans"},{"key":"2650_CR25","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1287\/mnsc.28.10.1197","volume":"28","author":"FB Talbot","year":"1982","unstructured":"Talbot FB (1982) Resource-constrained project scheduling with time-resource trade-offs: the non-preemptive case. Manag Sci 28:1197\u20131210","journal-title":"Manag Sci"},{"issue":"3","key":"2650_CR26","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.11650\/tjm.17.2013.2254","volume":"17","author":"WH Wei","year":"2013","unstructured":"Wei WH (2013) Robust estimation: location-scale and regression problems. Taiwan J Math 17(3):1055\u20131093","journal-title":"Taiwan J Math"},{"key":"2650_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108813","volume":"174","author":"P Wu","year":"2022","unstructured":"Wu P, Wang Y, Cheng J, Li Y (2022) An improved mixed-integer programming approach for bi-objective parallel machine scheduling and location. Comput Ind Eng 174:108813","journal-title":"Comput Ind Eng"},{"key":"2650_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105936","volume":"147","author":"C Zhang","year":"2022","unstructured":"Zhang C, Li Y, Cao J, Yang Z, Coelho LC (2022) Exact and metaheuristic methods for the parallel machine scheduling and location problem with delivery time and due date. Comput Oper Res 147:105936","journal-title":"Comput Oper Res"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-02650-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-024-02650-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-02650-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T05:21:51Z","timestamp":1712553711000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-024-02650-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["2650"],"URL":"https:\/\/doi.org\/10.1007\/s40314-024-02650-5","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2024,4]]},"assertion":[{"value":"8 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 April 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We have no conflicts of interest to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"147"}}