{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,10]],"date-time":"2025-05-10T04:02:12Z","timestamp":1746849732320,"version":"3.40.5"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T00:00:00Z","timestamp":1729555200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T00:00:00Z","timestamp":1729555200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12361066"],"award-info":[{"award-number":["12361066"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008871","name":"Science and Technology Department of Yunnan Province","doi-asserted-by":"crossref","award":["202001BB050062"],"award-info":[{"award-number":["202001BB050062"]}],"id":[{"id":"10.13039\/501100008871","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s11590-024-02154-5","type":"journal-article","created":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T12:02:39Z","timestamp":1729598559000},"page":"985-1005","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A generalized combination of parallel machine scheduling and path"],"prefix":"10.1007","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8086-712X","authenticated-orcid":false,"given":"Honglin","family":"Ding","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,22]]},"reference":[{"issue":"2","key":"2154_CR1","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17(2), 416\u2013429 (1969)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"2154_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0207001","volume":"7","author":"EG Coffman","year":"1978","unstructured":"Coffman, E.G., Garey, M.R., Johnson, D.S.: An application of bin-packing to multiprocessor scheduling. SIAM J. Comput. 7(1), 1\u201317 (1978)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"2154_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF02216826","volume":"24","author":"M Yue","year":"1990","unstructured":"Yue, M.: On the exact upper bound for the multifit processor scheduling algorithm. Ann. Oper. Res. 24(1), 233\u2013259 (1990)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"2154_CR4","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"DS Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems theoretical and practical results. J. ACM 34(1), 144\u2013162 (1987)","journal-title":"J. ACM"},{"issue":"2","key":"2154_CR5","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1137\/090749451","volume":"24","author":"K Jansen","year":"2010","unstructured":"Jansen, K.: An EPTAS for scheduling jobs on uniform processors: using an milp relaxation with a constant number of integral variables. SIAM J. Discrete Math. 24(2), 457\u2013485 (2010)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"2154_CR6","doi-asserted-by":"publisher","first-page":"1371","DOI":"10.1287\/moor.2019.1036","volume":"45","author":"K Jansen","year":"2020","unstructured":"Jansen, K., Klein, K.-M., Verschae, J.: Closing the gap for makespan scheduling via sparsification techniques. Math. Oper. Res. 45(4), 1371\u20131392 (2020)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"2154_CR7","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1002\/net.21547","volume":"63","author":"SG Nurre","year":"2014","unstructured":"Nurre, S.G., Sharkey, T.C.: Integrated network design and scheduling problems with parallel identical machines: complexity results and dispatching rules. Networks 63(4), 306\u2013326 (2014)","journal-title":"Networks"},{"key":"2154_CR8","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.tcs.2012.06.003","volume":"460","author":"Z Wang","year":"2012","unstructured":"Wang, Z., Cui, Z.: Combination of parallel machine scheduling and vertex cover. Theor. Comput. Sci. 460, 10\u201315 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"2154_CR9","first-page":"577","volume":"10","author":"Z Wang","year":"2014","unstructured":"Wang, Z., Hong, W., He, D.: A combination of parallel machine scheduling and covering problem. Pacific J. Optim. 10(3), 577\u2013591 (2014)","journal-title":"Pacific J. Optim."},{"key":"2154_CR10","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/s10878-013-9670-4","volume":"29","author":"K Nip","year":"2015","unstructured":"Nip, K., Wang, Z., Talla Nobibon, F., Leus, R.: A combination of flow shop scheduling and the shortest path problem. J. Comb. Optim. 29, 36\u201352 (2015)","journal-title":"J. Comb. Optim."},{"key":"2154_CR11","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.tcs.2015.12.027","volume":"654","author":"K Nip","year":"2016","unstructured":"Nip, K., Wang, Z., Xing, W.: A study on several combination problems of classic shop scheduling and shortest path. Theor. Comput. Sci. 654, 175\u2013187 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"12","key":"2154_CR12","first-page":"2273","volume":"40","author":"J Chen","year":"2018","unstructured":"Chen, J., Li, W.: Parallel machine scheduling problems with tree and path constraints (in Chinese). Comput. Eng. Sci. 40(12), 2273\u20132279 (2018)","journal-title":"Comput. Eng. Sci."},{"issue":"3","key":"2154_CR13","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/s10878-019-00406-0","volume":"38","author":"L Guan","year":"2019","unstructured":"Guan, L., Li, J., Li, W., Lichen, J.: Improved approximation algorithms for the combination problem of parallel machine scheduling and path. J. Comb. Optim. 38(3), 689\u2013697 (2019)","journal-title":"J. Comb. Optim."},{"key":"2154_CR14","doi-asserted-by":"crossref","unstructured":"Saito, Y., Shioura, A.: Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines. In: Ljubi\u0107, I., Barahona, F., Dey, S.S., Mahjoub, A.R. (eds.) Combinatorial Optimization. ISCO 2022. LNCS, vol. 13526, pp. 324\u2013335. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-18530-4_24"},{"issue":"1","key":"2154_CR15","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R Hassin","year":"1992","unstructured":"Hassin, R.: Approximation schemes for the restricted shortest path problem. Math. Oper. Res. 17(1), 36\u201342 (1992)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"2154_CR16","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0167-6377(01)00069-4","volume":"28","author":"DH Lorenz","year":"2001","unstructured":"Lorenz, D.H., Raz, D.: A simple efficient approximation scheme for the restricted shortest path problem. Oper. Res. Lett. 28(5), 213\u2013219 (2001)","journal-title":"Oper. Res. Lett."},{"issue":"5","key":"2154_CR17","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0020-0190(02)00205-3","volume":"83","author":"F Ergun","year":"2002","unstructured":"Ergun, F., Sinha, R., Zhang, L.: An improved FPTAS for restricted shortest path. Inf. Process. Lett. 83(5), 287\u2013291 (2002)","journal-title":"Inf. Process. Lett."},{"key":"2154_CR18","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms, vol. 1. Springer, Berlin (2001)"},{"key":"2154_CR19","doi-asserted-by":"crossref","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. In: Edsger Wybe Dijkstra: His Life, Work, and Legacy, pp. 287\u2013290 (2022)","DOI":"10.1145\/3544585.3544600"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02154-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-024-02154-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02154-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T07:36:52Z","timestamp":1746776212000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-024-02154-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,22]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["2154"],"URL":"https:\/\/doi.org\/10.1007\/s11590-024-02154-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2024,10,22]]},"assertion":[{"value":"1 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}