{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:33:31Z","timestamp":1740123211359,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T00:00:00Z","timestamp":1697673600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T00:00:00Z","timestamp":1697673600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["226\/21"],"award-info":[{"award-number":["226\/21"]}],"id":[{"id":"10.13039\/501100003977","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":[[2024,7]]},"DOI":"10.1007\/s10479-023-05613-x","type":"journal-article","created":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T20:40:22Z","timestamp":1697748022000},"page":"429-452","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A theoretical and empirical study of job scheduling in cloud computing environments: the weighted completion time minimization problem with capacitated parallel machines"],"prefix":"10.1007","volume":"338","author":[{"given":"Ilan Reuven","family":"Cohen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6775-3256","authenticated-orcid":false,"given":"Izack","family":"Cohen","sequence":"additional","affiliation":[]},{"given":"Iyar","family":"Zaks","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,19]]},"reference":[{"key":"5613_CR1","doi-asserted-by":"crossref","unstructured":"Albagli-Kim, S., Shachnai, H., & Tamir, T. (2014). Scheduling jobs with dwindling resource requirements in clouds. In IEEE INFOCOM 2014-IEEE conference on computer communications (pp. 601\u2013609). IEEE.","DOI":"10.1109\/INFOCOM.2014.6847985"},{"issue":"2","key":"5613_CR2","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.ejor.2019.09.052","volume":"291","author":"N Balouka","year":"2021","unstructured":"Balouka, N., & Cohen, I. (2021). A robust optimization approach for the multi-mode resource-constrained project scheduling problem. European Journal of Operational Research, 291(2), 457\u2013470.","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"5613_CR3","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/BF02057160","volume":"58","author":"L Bianco","year":"1995","unstructured":"Bianco, L., Blazewicz, J., Dell\u2019Olmo, P., & Drozdowski, M. (1995). Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors. Annals of Operations Research, 58(7), 493\u2013517.","journal-title":"Annals of Operations Research"},{"issue":"10","key":"5613_CR4","doi-asserted-by":"publisher","first-page":"1151","DOI":"10.1080\/24725854.2018.1560752","volume":"51","author":"S Bitton","year":"2019","unstructured":"Bitton, S., Cohen, I., & Cohen, M. (2019). Joint repair sourcing and stocking policies for repairables using Erlang-A and Erlang-B queueing models. IISE Transactions, 51(10), 1151\u20131166.","journal-title":"IISE Transactions"},{"issue":"04","key":"5613_CR5","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1142\/S1793830911001413","volume":"3","author":"M Bougeret","year":"2011","unstructured":"Bougeret, M., Dutot, P.-F., Jansen, K., Robenek, C., & Trystram, D. (2011). Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms. Discrete Mathematics, Algorithms and Applications, 3(04), 553\u2013586.","journal-title":"Discrete Mathematics, Algorithms and Applications"},{"issue":"2","key":"5613_CR6","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.ejor.2019.12.043","volume":"284","author":"Y Bukchin","year":"2020","unstructured":"Bukchin, Y., Raviv, T., & Zaides, I. (2020). The consecutive multiprocessor job scheduling problem. European Journal of Operational Research, 284(2), 427\u2013438.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"5613_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1002\/(SICI)1520-6750(199902)46:1<57::AID-NAV4>3.0.CO;2-H","volume":"46","author":"J Chen","year":"1999","unstructured":"Chen, J., & Lee, C.-Y. (1999). General multiprocessor task scheduling. Naval Research Logistics (NRL), 46(1), 57\u201374.","journal-title":"Naval Research Logistics (NRL)"},{"key":"5613_CR8","doi-asserted-by":"crossref","unstructured":"Cohen, I. R., Cohen, I., & Zaks, I. (2021). Weighted completion time minimization for capacitated parallel machines. In International workshop on approximation and online algorithms (pp. 130\u2013143). Springer.","DOI":"10.1007\/978-3-030-92702-8_9"},{"issue":"1","key":"5613_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.ejor.2022.07.018","volume":"306","author":"I Cohen","year":"2023","unstructured":"Cohen, I., Postek, K., & Shtern, S. (2023). An adaptive robust optimization model for parallel machine scheduling. European Journal of Operational Research, 306(1), 83\u2013104.","journal-title":"European Journal of Operational Research"},{"issue":"1\u20134","key":"5613_CR10","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s00170-013-4737-z","volume":"68","author":"P Damodaran","year":"2013","unstructured":"Damodaran, P., Ghrayeb, O., & Guttikonda, M. C. (2013). GRASP to minimize makespan for a capacitated batch-processing machine. The International Journal of Advanced Manufacturing Technology, 68(1\u20134), 407\u2013414.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"2","key":"5613_CR11","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1287\/mnsc.11.2.268","volume":"11","author":"WL Eastman","year":"1964","unstructured":"Eastman, W. L., Even, S., & Martin Isaacs, I. (1964). Bounds for the optimal scheduling of n jobs on m processors. Management Science, 11(2), 268\u2013279.","journal-title":"Management Science"},{"key":"5613_CR12","doi-asserted-by":"crossref","unstructured":"Fox, K., & Korupolu, M. (2013). Weighted flowtime on capacitated machines. In Proceedings of the twenty-fourth annual ACM-SIAM symposium on discrete algorithms (pp. 129\u2013143). SIAM.","DOI":"10.1137\/1.9781611973105.10"},{"issue":"13","key":"5613_CR13","doi-asserted-by":"publisher","first-page":"3762","DOI":"10.1080\/00207543.2014.922708","volume":"52","author":"ER Gafarov","year":"2014","unstructured":"Gafarov, E. R., Dolgui, A., & Werner, F. (2014). A new graphical approach for solving single-machine scheduling problems approximately. International Journal of Production Research, 52(13), 3762\u20133777.","journal-title":"International Journal of Production Research"},{"key":"5613_CR14","unstructured":"Garey, M. R, & Johnson, D. S. (1979). Computers and intractability. In A guide to the theory of NP-completeness."},{"issue":"12","key":"5613_CR15","doi-asserted-by":"publisher","first-page":"3511","DOI":"10.1109\/TPDS.2017.2731843","volume":"28","author":"L Guo","year":"2017","unstructured":"Guo, L., & Shen, H. (2017). Efficient approximation algorithms for the bounded flexible scheduling problem in clouds. IEEE Transactions on Parallel and Distributed Systems, 28(12), 3511\u20133520.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"5613_CR16","unstructured":"Gurobi Optimization, LLC. (2021). Gurobi optimizer reference manual. https:\/\/www.gurobi.com"},{"issue":"2","key":"5613_CR17","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10710-005-7580-7","volume":"6","author":"E Hart","year":"2005","unstructured":"Hart, E., Ross, P., & Corne, D. (2005). Evolutionary scheduling: A review. Genetic Programming and Evolvable Machines, 6(2), 191\u2013220.","journal-title":"Genetic Programming and Evolvable Machines"},{"key":"5613_CR18","doi-asserted-by":"crossref","unstructured":"Hota, A., Mohapatra, S., & Mohanty, S. (2019). Survey of different load balancing approach-based algorithms in cloud computing: A comprehensive review. In: Computational intelligence in data mining (pp. 99\u2013110).","DOI":"10.1007\/978-981-10-8055-5_10"},{"key":"5613_CR19","doi-asserted-by":"crossref","unstructured":"Im, S., Naghshnejad, M., & Singhal, M. (2016). Scheduling jobs with non-uniform demands on multiple servers without interruption. In IEEE INFOCOM 2016-The 35th annual IEEE international conference on computer communications (pp. 1\u20139). IEEE.","DOI":"10.1109\/INFOCOM.2016.7524417"},{"key":"5613_CR20","doi-asserted-by":"crossref","unstructured":"Jain, N., & Choudhary, S. (2016). Overview of virtualization in cloud computing. In 2016 Symposium on colossal data analysis and networking (CDAN) (pp. 1\u20134). IEEE.","DOI":"10.1109\/CDAN.2016.7570950"},{"key":"5613_CR21","doi-asserted-by":"crossref","unstructured":"Jansen, K., & Rau, M. (2019). Linear time algorithms for multiple cluster scheduling and multiple strip packing. In European conference on parallel processing (pp. 103\u2013116). Springer.","DOI":"10.1007\/978-3-030-29400-7_8"},{"key":"5613_CR22","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.endm.2016.10.003","volume":"55","author":"K Jansen","year":"2016","unstructured":"Jansen, K., & Trystram, D. (2016). Scheduling parallel jobs on heterogeneous platforms. Electronic Notes in Discrete Mathematics, 55, 9\u201312.","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"3","key":"5613_CR23","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s00453-006-0194-5","volume":"47","author":"K Jansen","year":"2007","unstructured":"Jansen, K., & Zhang, G. (2007). Maximizing the total profit of rectangles packed into a rectangle. Algorithmica, 47(3), 323\u2013342.","journal-title":"Algorithmica"},{"issue":"4","key":"5613_CR24","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1137\/0215081","volume":"15","author":"T Kawaguchi","year":"1986","unstructured":"Kawaguchi, T., & Kyan, S. (1986). Worst case bound of an LRF schedule for the mean weighted flow-time problem. SIAM Journal on Computing, 15(4), 1119\u20131129.","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"5613_CR25","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s00291-018-0512-8","volume":"40","author":"D Kress","year":"2018","unstructured":"Kress, D., Meiswinkel, S., & Pesch, E. (2018). Mechanism design for machine scheduling problems: Classification and literature overview. OR Spectrum, 40(3), 583\u2013611.","journal-title":"OR Spectrum"},{"key":"5613_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jnca.2019.06.006","volume":"143","author":"M Kumar","year":"2019","unstructured":"Kumar, M., Sharma, S. C., Goel, A., & Singh, S. P. (2019). A comprehensive survey for scheduling techniques in cloud computing. Journal of Network and Computer Applications, 143, 1\u201333.","journal-title":"Journal of Network and Computer Applications"},{"key":"5613_CR27","doi-asserted-by":"crossref","unstructured":"Liu, S. (2020). A Review for submodular optimization on machine scheduling problems. In Complexity and approximation (pp. 252\u2013267). Springer.","DOI":"10.1007\/978-3-030-41672-0_16"},{"key":"5613_CR28","doi-asserted-by":"crossref","unstructured":"Liu, Y., Xu, H., & Lau, W. C. (2019). Online job scheduling with resource packing on a cluster of heterogeneous servers. In: IEEE INFOCOM 2019-IEEE conference on computer communications (pp. 1441\u20131449). IEEE.","DOI":"10.1109\/INFOCOM.2019.8737465"},{"issue":"2","key":"5613_CR29","first-page":"1","volume":"4","author":"L Malhotra","year":"2014","unstructured":"Malhotra, L., Agarwal, D., Jaiswal, A., et al. (2014). Virtualization in cloud computing. Journal of Information Technology & Software Engineering, 4(2), 1\u20133.","journal-title":"Journal of Information Technology & Software Engineering"},{"key":"5613_CR30","unstructured":"MIP Python\u2019s Package. (n.d.). https:\/\/www.python-mip.com"},{"issue":"2","key":"5613_CR31","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/j.ejor.2020.01.065","volume":"285","author":"\u0130 Muter","year":"2020","unstructured":"Muter, \u0130. (2020). Exact algorithms to minimize makespan on single and parallel batch processing machines. European Journal of Operational Research, 285(2), 470\u2013483.","journal-title":"European Journal of Operational Research"},{"key":"5613_CR32","doi-asserted-by":"crossref","unstructured":"Pinedo, M. (2012). Scheduling (Vol. 5). Springer.","DOI":"10.1007\/978-1-4614-2361-4"},{"key":"5613_CR33","doi-asserted-by":"crossref","unstructured":"Shin, S., Kim, Y., & Lee, S. (2015). Deadline-guaranteed scheduling algorithm with improved resource utilization for cloud computing. In 2015 12th Annual IEEE consumer communications and networking conference (CCNC) (pp. 814\u2013819). IEEE.","DOI":"10.1109\/CCNC.2015.7158082"},{"issue":"1\u20132","key":"5613_CR34","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith, W. E. (1956). Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3(1\u20132), 59\u201366.","journal-title":"Naval Research Logistics Quarterly"},{"key":"5613_CR35","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.tre.2013.03.003","volume":"54","author":"N Umang","year":"2013","unstructured":"Umang, N., Bierlaire, M., & Vacca, I. (2013). Exact and heuristic methods to solve the berth allocation problem in bulk ports. Transportation Research Part E: Logistics and Transportation Review, 54, 14\u201331.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"15","key":"5613_CR36","doi-asserted-by":"publisher","first-page":"4579","DOI":"10.1080\/00207543.2020.1766721","volume":"59","author":"S Wang","year":"2021","unstructured":"Wang, S., & Cui, W. (2021). Approximation algorithms for the min-max regret identical parallel machine scheduling problem with outsourcing and uncertain processing time. International Journal of Production Research, 59(15), 4579\u20134592.","journal-title":"International Journal of Production Research"},{"key":"5613_CR37","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735","volume-title":"The design of approximation algorithms","author":"DP Williamson","year":"2011","unstructured":"Williamson, D. P., & Shmoys, D. B. (2011). The design of approximation algorithms. Cambridge University Press."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-023-05613-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-023-05613-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-023-05613-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T16:23:12Z","timestamp":1721060592000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-023-05613-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,19]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["5613"],"URL":"https:\/\/doi.org\/10.1007\/s10479-023-05613-x","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2023,10,19]]},"assertion":[{"value":"1 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"This research does not contain any studies with human participants performed by any of the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human participants"}},{"value":"Ilan Reuven Cohen declares that he has no conflict of interest. Izack Cohen declares that he has no conflict of interest. Iyar Zaks declares that he has no conflict of interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}