{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T11:22:04Z","timestamp":1769512924362,"version":"3.49.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T00:00:00Z","timestamp":1727049600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T00:00:00Z","timestamp":1727049600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"National Science and Technology Innovation 2030 major program","award":["2022ZD0115403"],"award-info":[{"award-number":["2022ZD0115403"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72201121"],"award-info":[{"award-number":["72201121"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72001112"],"award-info":[{"award-number":["72001112"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010023","name":"Natural Science Research of Jiangsu Higher Education Institutions of China","doi-asserted-by":"publisher","award":["22KJB630006"],"award-info":[{"award-number":["22KJB630006"]}],"id":[{"id":"10.13039\/501100010023","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2023M740238"],"award-info":[{"award-number":["2023M740238"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s10479-024-06283-z","type":"journal-article","created":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T02:01:39Z","timestamp":1727056899000},"page":"937-963","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimal scheduling on unrelated parallel machines with combinatorial auction"],"prefix":"10.1007","volume":"344","author":[{"given":"Xue","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9971-8586","authenticated-orcid":false,"given":"Ting","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuefei","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,23]]},"reference":[{"issue":"3","key":"6283_CR1","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W., & Vance, P. H. (1998). Branch-and-price: Column generation for solving huge integer programs. Operations Research, 46(3), 316\u2013329.","journal-title":"Operations Research"},{"issue":"5","key":"6283_CR2","doi-asserted-by":"publisher","first-page":"1621","DOI":"10.1007\/s10845-010-0464-6","volume":"23","author":"A Bilyk","year":"2012","unstructured":"Bilyk, A., & Monch, L. (2012). A variable neighborhood search approach for planning and scheduling of jobs on unrelated parallel machines. Journal of Intelligent Manufacturing, 23(5), 1621\u20131635.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"3","key":"6283_CR3","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1016\/S0377-2217(01)00068-6","volume":"136","author":"ZL Chen","year":"2002","unstructured":"Chen, Z. L., & Lee, C. Y. (2002). Parallel machine scheduling with a common due window. European Journal of Operational Research, 136(3), 512\u2013527.","journal-title":"European Journal of Operational Research"},{"key":"6283_CR4","doi-asserted-by":"crossref","unstructured":"Chen, Z. L., & Powell, W. B. (1999a). A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem. European Journal of Operational Research,116(1), 220\u2013232.","DOI":"10.1016\/S0377-2217(98)00136-2"},{"key":"6283_CR5","doi-asserted-by":"crossref","unstructured":"Chen, Z. L., & Powell, W. B. (1999b). Solving parallel machine scheduling problems by column generation. INFORMS Journal on Computing,11(1), 78\u201394.","DOI":"10.1287\/ijoc.11.1.78"},{"key":"6283_CR6","doi-asserted-by":"crossref","unstructured":"Cheng, R., & Gen, M. (1997). Parallel machine scheduling problems using memetic algorithms. Computers & Industrial Engineering, 33 (3): 761\u2013764. Selected Papers from the Proceedings of 1996 ICC &IC.","DOI":"10.1016\/S0360-8352(97)00247-7"},{"issue":"1","key":"6283_CR7","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"GB Dantzig","year":"1960","unstructured":"Dantzig, G. B., & Wolfe, P. (1960). Decomposition principle for linear programs. Operations Research, 8(1), 101\u2013111.","journal-title":"Operations Research"},{"issue":"3","key":"6283_CR8","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1287\/ijoc.15.3.284.16077","volume":"15","author":"S de Vries","year":"2003","unstructured":"de Vries, S., & Vohra, R. V. (2003). Combinatorial auctions: A survey. INFORMS Journal on Computing, 15(3), 284\u2013309.","journal-title":"INFORMS Journal on Computing"},{"key":"6283_CR9","doi-asserted-by":"crossref","unstructured":"Desrosiers, J., & L\u00fcbbecke, M. (2005). A Primer in Column Generation (pp. 1\u201332). Springer US, ISBN 978-0-387-25486-9.","DOI":"10.1007\/0-387-25486-2_1"},{"issue":"2","key":"6283_CR10","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1016\/j.ejor.2017.01.002","volume":"260","author":"L Fanjul-Peyro","year":"2017","unstructured":"Fanjul-Peyro, L., Perea, F., & Ruiz, R. (2017). Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources. European Journal of Operational Research, 260(2), 482\u2013493.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"6283_CR11","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1016\/j.ejor.2018.05.056","volume":"271","author":"K Fleszar","year":"2018","unstructured":"Fleszar, K., & Hindi, K. S. (2018). Algorithms for the unrelated parallel machine scheduling problem with a\u00c2 resource constraint. European Journal of Operational Research, 271(3), 839\u2013848.","journal-title":"European Journal of Operational Research"},{"key":"6283_CR12","unstructured":"Gurobi Optimization. (2020). Gurobi optimizer reference manual."},{"issue":"8","key":"6283_CR13","doi-asserted-by":"publisher","first-page":"3748","DOI":"10.1016\/j.eswa.2013.11.029","volume":"41","author":"J Jiang","year":"2014","unstructured":"Jiang, J., Ng, K. M., Poh, K. L., & Teo, K. M. (2014). Vehicle routing problem with a heterogeneous fleet and time windows. Expert Systems with Applications, 41(8), 3748\u20133760.","journal-title":"Expert Systems with Applications"},{"key":"6283_CR14","first-page":"2194","volume":"7","author":"S Jia-Xin","year":"2023","unstructured":"Jia-Xin, S., Fan-Yu, K., Cui-Xia, M., & Yu-Zhong, Z. (2023). Single-machine scheduling with step-deteriorating jobs and rejection. Journal of the Operations Research Society of China, 7, 2194\u20136698.","journal-title":"Journal of the Operations Research Society of China"},{"key":"6283_CR15","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.cie.2015.02.029","volume":"85","author":"CM Joo","year":"2015","unstructured":"Joo, C. M., & Kim, B. S. (2015). Hybrid genetic algorithms with dispatching rules for unrelated parallel machine scheduling with setup time and production availability. Computers & Industrial Engineering, 85, 102\u2013109.","journal-title":"Computers & Industrial Engineering"},{"issue":"4","key":"6283_CR16","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1287\/ijoc.2018.0809","volume":"30","author":"D Kowalczyk","year":"2018","unstructured":"Kowalczyk, D., & Leus, R. (2018). A branch-and-price algorithm for parallel machine scheduling using zdds and generic branching. INFORMS Journal on Computing, 30(4), 768\u2013782.","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"6283_CR17","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ejor.2018.11.039","volume":"275","author":"A Kramer","year":"2019","unstructured":"Kramer, A., Dell\u2019Amico, M., & Iori, M. (2019). Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines. European Journal of Operational Research, 275(1), 67\u201379.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"6283_CR18","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.ejor.2013.09.014","volume":"234","author":"Z Luo","year":"2014","unstructured":"Luo, Z., Qin, H., & Lim, A. (2014). Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints. European Journal of Operational Research, 234(1), 49\u201360.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"6283_CR19","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1016\/j.ejor.2019.10.014","volume":"286","author":"B Naderi","year":"2020","unstructured":"Naderi, B., & Roshanaei, V. (2020). Branch-relax-and-check: A tractable decomposition method for order acceptance and identical parallel machine scheduling. European Journal of Operational Research, 286(3), 811\u2013827.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"6283_CR20","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1287\/ijoc.2018.0854","volume":"32","author":"D Oliveira","year":"2020","unstructured":"Oliveira, D., & Pessoa, A. (2020). An improved branch-cut-and-price algorithm for parallel machine scheduling problems. INFORMS Journal on Computing, 32(1), 90\u2013100.","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"6283_CR21","doi-asserted-by":"publisher","first-page":"1508","DOI":"10.1016\/j.ejor.2005.11.001","volume":"176","author":"MJ Pereira Lopes","year":"2007","unstructured":"Pereira Lopes, M. J., & Val\u00e9rio de Carvalho, J. M. (2007). A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times. European Journal of Operational Research, 176(3), 1508\u20131527.","journal-title":"European Journal of Operational Research"},{"issue":"3\u20134","key":"6283_CR22","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s12532-010-0019-z","volume":"2","author":"A Pessoa","year":"2010","unstructured":"Pessoa, A., Uchoa, E., Arago, Marcus Poggi De., & Rodrigues, R. (2010). Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems. Mathematical Programming Computation, 2(3\u20134), 259\u2013290.","journal-title":"Mathematical Programming Computation"},{"key":"6283_CR23","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10479-022-04537-2","volume":"322","author":"PO Pourhejazy","year":"2022","unstructured":"Pourhejazy, P. O., Cheng, C. Y., Ying, K. C., & Nam, N. H. (2022). Meta-lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups. Annals of Operations Research, 322, 125\u2013146.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"6283_CR24","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.advengsoft.2008.03.020","volume":"40","author":"A Rossi","year":"2009","unstructured":"Rossi, A., & Boschi, E. (2009). A hybrid heuristic to solve the parallel machines job-shop scheduling problem. Advances in Engineering Software, 40(2), 118\u2013127.","journal-title":"Advances in Engineering Software"},{"issue":"3","key":"6283_CR25","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1287\/mnsc.1040.0336","volume":"51","author":"T Sandholm","year":"2005","unstructured":"Sandholm, T., Suri, S., Gilpin, A., & Levine, D. (2005). Cabob: A fast optimal algorithm for winner determination in combinatorial auctions. Management Science, 51(3), 374\u2013390.","journal-title":"Management Science"},{"key":"6283_CR26","unstructured":"Sava, J.A. (2022). It outsourcing industry\u2014statistics & facts. Technical report, Statita, 2 ."},{"key":"6283_CR27","first-page":"16","volume":"1","author":"D Shabtay","year":"2013","unstructured":"Shabtay, D., Gaspar, N., & Kaspi, M. (2013). A survey on offline scheduling with rejection. Journal of Scheduling, 1, 16.","journal-title":"Journal of Scheduling"},{"key":"6283_CR28","doi-asserted-by":"crossref","unstructured":"Sheremetov, L., Mart\u00ed\u00adnez-Mu\u00f1oz, J., & Chi-Chim, M. (2018). Two-stage genetic algorithm for parallel machines scheduling problem. Cyclic steam stimulation of high viscosity oil reservoirs. Applied Soft Computing,64, 317\u2013330.","DOI":"10.1016\/j.asoc.2017.12.021"},{"key":"6283_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105394","volume":"134","author":"RS Trindade","year":"2021","unstructured":"Trindade, R. S., de Ara\u00fajo, O. C., & Fampa, M. (2021). Arc-flow approach for single batch-processing machine scheduling. Computers & Operations Research, 134, 105394.","journal-title":"Computers & Operations Research"},{"issue":"6","key":"6283_CR30","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1287\/opre.47.6.862","volume":"47","author":"JM van den Akker","year":"1999","unstructured":"van den Akker, J. M., Hoogeveen, J. A., & van de Velde, S. L. (1999). Parallel machine scheduling by column generation. Operations Research, 47(6), 862\u2013872.","journal-title":"Operations Research"},{"key":"6283_CR31","doi-asserted-by":"crossref","unstructured":"Wang, D., Yin, Y., & Cheng, T. C. E. (2018a). Parallel-machine rescheduling with job unavailability and rejection. Omega,81, 246\u2013260.","DOI":"10.1016\/j.omega.2018.04.008"},{"key":"6283_CR32","doi-asserted-by":"crossref","unstructured":"Wang, T., Baldacci, R., Lim, A., & Qian, H. (2018b). A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine. European Journal of Operational Research,271(3), 826\u2013838.","DOI":"10.1016\/j.ejor.2018.05.050"},{"issue":"1","key":"6283_CR33","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.ejor.2021.10.011","volume":"300","author":"T Wang","year":"2022","unstructured":"Wang, T., Qian, H., & Lim, A. (2022). An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs. European Journal of Operational Research, 300(1), 20\u201334.","journal-title":"European Journal of Operational Research"},{"key":"6283_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108899","volume":"175","author":"S Wang","year":"2023","unstructured":"Wang, S., Ruochen, W., Chu, F., & Jianbo, Y. (2023). An exact decomposition method for unrelated parallel machine scheduling with order acceptance and setup times. Computers & Industrial Engineering, 175, 108899.","journal-title":"Computers & Industrial Engineering"},{"key":"6283_CR35","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1002\/nav.21863","volume":"66","author":"X Xiong","year":"2019","unstructured":"Xiong, X., Zhou, P., Yunqiang Yin, T. C., Cheng, E., & Li, D. (2019). An exact branch-and-price algorithm for multitasking scheduling on unrelated parallel machines. Naval Research Logistics (NRL), 66, 502\u2013516.","journal-title":"Naval Research Logistics (NRL)"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06283-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-024-06283-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06283-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T17:34:54Z","timestamp":1737048894000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-024-06283-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,23]]},"references-count":35,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["6283"],"URL":"https:\/\/doi.org\/10.1007\/s10479-024-06283-z","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,23]]},"assertion":[{"value":"27 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}}]}}