{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:14:16Z","timestamp":1742912056522,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030927011"},{"type":"electronic","value":"9783030927028"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92702-8_9","type":"book-chapter","created":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T06:00:24Z","timestamp":1641016824000},"page":"130-143","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Weighted Completion Time Minimization for\u00a0Capacitated Parallel Machines"],"prefix":"10.1007","author":[{"given":"Ilan Reuven","family":"Cohen","sequence":"first","affiliation":[]},{"given":"Izack","family":"Cohen","sequence":"additional","affiliation":[]},{"given":"Iyar","family":"Zaks","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Albagli-Kim, S., Shachnai, H., Tamir, T.: Scheduling jobs with dwindling resource requirements in clouds. In: IEEE INFOCOM 2014-IEEE Conference on Computer Communications, pp. 601\u2013609. IEEE (2014)","DOI":"10.1109\/INFOCOM.2014.6847985"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.ejor.2019.09.052","volume":"291","author":"N Balouka","year":"2019","unstructured":"Balouka, N., Cohen, I.: A robust optimization approach for the multi-mode resource-constrained project scheduling problem. Eur. J. Oper. Res. 291, 457\u2013470 (2019)","journal-title":"Eur. J. Oper. Res."},{"issue":"04","key":"9_CR3","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.: Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms. Disc. Math. Algorithms Appl 3(04), 553\u2013586 (2011)","journal-title":"Disc. Math. Algorithms Appl"},{"key":"9_CR4","unstructured":"Cohen, I., Postek, K., Shtern, S.: An adaptive robust optimization model for parallel machine scheduling. arXiv preprint arXiv:2102.08677 (2021)"},{"issue":"1\u20134","key":"9_CR5","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.: Grasp to minimize makespan for a capacitated batch-processing machine. Int. J. Adv. Manuf. Technol. 68(1\u20134), 407\u2013414 (2013)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"2","key":"9_CR6","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., Isaacs, I.M.: Bounds for the optimal scheduling of n jobs on m processors. Manag. Sci. 11(2), 268\u2013279 (1964)","journal-title":"Manag. Sci."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Fox, K., Korupolu, M.: Weighted flowtime on capacitated machines. In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 129\u2013143. SIAM (2013)","DOI":"10.1137\/1.9781611973105.10"},{"key":"9_CR8","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability. In: A Guide to the Theory of NP-Completeness (1979)"},{"issue":"4","key":"9_CR9","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1287\/opre.29.4.646","volume":"29","author":"SC Graves","year":"1981","unstructured":"Graves, S.C.: A review of production scheduling. Oper. Res. 29(4), 646\u2013675 (1981)","journal-title":"Oper. Res."},{"issue":"12","key":"9_CR10","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.: Efficient approximation algorithms for the bounded flexible scheduling problem in clouds. IEEE Trans. Parallel Distrib. Syst. 28(12), 3511\u20133520 (2017)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"9_CR11","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-981-10-8055-5_10","volume-title":"Computational Intelligence in Data Mining","author":"A Hota","year":"2019","unstructured":"Hota, A., Mohapatra, S., Mohanty, S.: Survey of different load balancing approach-based algorithms in cloud computing: a comprehensive review. In: Behera, H.S., Nayak, J., Naik, B., Abraham, A. (eds.) Computational Intelligence in Data Mining. AISC, vol. 711, pp. 99\u2013110. Springer, Singapore (2019). https:\/\/doi.org\/10.1007\/978-981-10-8055-5_10"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Im, S., Naghshnejad, M., Singhal, M.: 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 (2016)","DOI":"10.1109\/INFOCOM.2016.7524417"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-030-29400-7_8","volume-title":"Euro-Par 2019: Parallel Processing","author":"K Jansen","year":"2019","unstructured":"Jansen, K., Rau, M.: Linear time algorithms for multiple cluster scheduling and multiple strip packing. In: Yahyapour, R. (ed.) Euro-Par 2019. LNCS, vol. 11725, pp. 103\u2013116. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29400-7_8"},{"key":"9_CR14","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.: Scheduling parallel jobs on heterogeneous platforms. Electron. Notes Disc. Math. 55, 9\u201312 (2016)","journal-title":"Electron. Notes Disc. Math."},{"issue":"3","key":"9_CR15","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.: Maximizing the total profit of rectangles packed into a rectangle. Algorithmica 47(3), 323\u2013342 (2007)","journal-title":"Algorithmica"},{"issue":"4","key":"9_CR16","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1137\/0215081","volume":"15","author":"T Kawaguchi","year":"1986","unstructured":"Kawaguchi, T., Kyan, S.: Worst case bound of an LRF schedule for the mean weighted flow-time problem. SIAM J. Comput. 15(4), 1119\u20131129 (1986)","journal-title":"SIAM J. Comput."},{"key":"9_CR17","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.: A comprehensive survey for scheduling techniques in cloud computing. J. Netw. Comput. Appl 143, 1\u201333 (2019)","journal-title":"J. Netw. Comput. Appl"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-030-41672-0_16","volume-title":"Complexity and Approximation","author":"S Liu","year":"2020","unstructured":"Liu, S.: A review for submodular optimization on machine scheduling problems. In: Du, D.-Z., Wang, J. (eds.) Complexity and Approximation. LNCS, vol. 12000, pp. 252\u2013267. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-41672-0_16"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Liu, Y., Xu, H., Lau, W.C.: 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 (2019)","DOI":"10.1109\/INFOCOM.2019.8737465"},{"issue":"2","key":"9_CR20","first-page":"1","volume":"4","author":"L Malhotra","year":"2014","unstructured":"Malhotra, L., Agarwal, D., Jaiswal, A., et al.: Virtualization in cloud computing. J. Inf. Tech. Softw. Eng. 4(2), 1\u20133 (2014)","journal-title":"J. Inf. Tech. Softw. Eng."},{"key":"9_CR21","series-title":"Produktion und Logistik","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-658-22362-5_2","volume-title":"On Combinatorial Optimization and Mechanism Design Problems Arising at Container Ports","author":"S Meiswinkel","year":"2018","unstructured":"Meiswinkel, S.: Mechanism design and machine scheduling: literature review. In: On Combinatorial Optimization and Mechanism Design Problems Arising at Container Ports. PL, pp. 15\u201330. Springer, Wiesbaden (2018). https:\/\/doi.org\/10.1007\/978-3-658-22362-5_2"},{"issue":"2","key":"9_CR22","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: Exact algorithms to minimize makespan on single and parallel batch processing machines. Eur. J. Oper. Res. 285(2), 470\u2013483 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26580-3","volume-title":"Scheduling","author":"M Pinedo","year":"2012","unstructured":"Pinedo, M.: Scheduling, vol. 5. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-319-26580-3"},{"issue":"1\u20132","key":"9_CR24","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith, W.E.: Various optimizers for single-stage production. Naval Res. Logist. Q. 3(1\u20132), 59\u201366 (1956)","journal-title":"Naval Res. Logist. Q."},{"key":"9_CR25","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.: The Design of Approximation Algorithms. Cambridge University Press, Cambridge (2011)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92702-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T06:22:53Z","timestamp":1641018173000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92702-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030927011","9783030927028"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92702-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo2021.tecnico.ulisboa.pt\/WAOA2021\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}