{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T08:26:35Z","timestamp":1726043195207},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030297640"},{"type":"electronic","value":"9783030297657"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-29765-7_41","type":"book-chapter","created":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T23:03:54Z","timestamp":1567551834000},"page":"492-503","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Balancing Schedules Using Maximum Leximin"],"prefix":"10.1007","author":[{"given":"Federico","family":"Toffano","sequence":"first","affiliation":[]},{"given":"Nic","family":"Wilson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,4]]},"reference":[{"issue":"1\u20132","key":"41_CR1","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s11134-006-7587-7","volume":"53","author":"T Bonald","year":"2006","unstructured":"Bonald, T., Massouli\u00e9, L., Proutiere, A., Virtamo, J.: A queueing analysis of max-min fairness, proportional fairness and balanced fairness. Queueing Syst. 53(1\u20132), 65\u201384 (2006)","journal-title":"Queueing Syst."},{"issue":"2","key":"41_CR2","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.artint.2008.10.010","volume":"173","author":"S Bouveret","year":"2009","unstructured":"Bouveret, S., Lema\u00eetre, M.: Computing leximin-optimal solutions in constraint networks. Artif. Intell. 173(2), 343\u2013364 (2009)","journal-title":"Artif. Intell."},{"issue":"5","key":"41_CR3","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/s00170-005-2545-9","volume":"29","author":"JF Chen","year":"2006","unstructured":"Chen, J.F.: Minimization of maximum tardiness on unrelated parallel machines with process restrictions and setups. Int. J. Adv. Manufact. Technol. 29(5), 557\u2013563 (2006)","journal-title":"Int. J. Adv. Manufact. Technol."},{"issue":"3","key":"41_CR4","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"J Du","year":"1990","unstructured":"Du, J., Leung, J.Y.T.: Minimizing total tardiness on one machine is NP-hard. Math. Oper. Res. 15(3), 483\u2013495 (1990)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"41_CR5","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0377-2217(02)00558-1","volume":"147","author":"D Dubois","year":"2003","unstructured":"Dubois, D., Fargier, H., Fortemps, P.: Fuzzy scheduling: modelling flexible constraints vs. coping with incomplete knowledge. Eur. J. Oper. Res. 147(2), 231\u2013252 (2003)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"41_CR6","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0377-2217(98)00307-5","volume":"118","author":"D Dubois","year":"1999","unstructured":"Dubois, D., Fortemps, P.: Computing improved optimal solutions to max-min flexible constraint satisfaction problems. Eur. J. Oper. Res. 118(1), 95\u2013126 (1999)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"41_CR7","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1109\/91.388176","volume":"3","author":"J Fodor","year":"1995","unstructured":"Fodor, J., Marichal, J.L., Roubens, M.: Characterization of the ordered weighted averaging operators. IEEE Trans. Fuzzy Syst. 3(2), 236\u2013240 (1995)","journal-title":"IEEE Trans. Fuzzy Syst."},{"key":"41_CR8","unstructured":"Gopinathan, A., Li, Z.: Strategyproof auctions for balancing social welfare and fairness in secondary spectrum markets. In: INFOCOM, 2011 Proceedings IEEE, pp. 3020\u20133028. IEEE (2011)"},{"issue":"3","key":"41_CR9","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1002\/1520-6750(199106)38:3<367::AID-NAV3220380307>3.0.CO;2-I","volume":"38","author":"JC Ho","year":"1991","unstructured":"Ho, J.C., Chang, Y.L.: Heuristics for minimizing mean tardiness for m parallel machines. Nav. Res. Logist. (NRL) 38(3), 367\u2013381 (1991)","journal-title":"Nav. Res. Logist. (NRL)"},{"key":"41_CR10","doi-asserted-by":"crossref","unstructured":"Huang, X.L., Bensaou, B.: On max-min fairness and scheduling in wireless ad-hoc networks: analytical framework and implementation. In: Proceedings of the 2nd ACM International Symposium on Mobile Ad Hoc Networking & Computing, pp. 221\u2013231. ACM (2001)","DOI":"10.1145\/501445.501447"},{"key":"41_CR11","unstructured":"Kurokawa, D., Procaccia, A.D., Shah, N.: Leximin allocations in the real world. In: Roughgarden, T., Feldman, M., Schwarz, M. (eds.) Proceedings of the Sixteenth ACM Conference on Economics and Computation, EC 2015, Portland, OR, USA, June 15\u201319, 2015, pp. 345\u2013362. ACM (2015)"},{"key":"41_CR12","unstructured":"Marbach, P.: Priority service and max-min fairness. In: INFOCOM 2002, Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, Proceedings, IEEE, vol. 1, pp. 266\u2013275. IEEE (2002)"},{"key":"41_CR13","volume-title":"Fair Division and Collective Welfare","author":"H Moulin","year":"2004","unstructured":"Moulin, H.: Fair Division and Collective Welfare. MIT Press, London (2004)"},{"issue":"1","key":"41_CR14","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1287\/opre.1060.0341","volume":"55","author":"D Nace","year":"2007","unstructured":"Nace, D., Orlin, J.B.: Lexicographically minimum and maximum load linear programming problems. Oper. Res. 55(1), 182\u2013187 (2007)","journal-title":"Oper. Res."},{"key":"41_CR15","unstructured":"Nace, D., Pioro, M., Doan, L.: A tutorial on max-min fairness and its applications to routing, load-balancing and network design. In: 4th IEEE International Conference on Computer Sciences Research, Innovation and Vision for the Future (RIVF 2006) (2006)"},{"key":"41_CR16","first-page":"25","volume":"2014","author":"W Ogryczak","year":"2014","unstructured":"Ogryczak, W., Luss, H., Pi\u00f3ro, M., Nace, D., Tomaszewski, A.: Fairoptimization and networks: a survey. J. Appl. Math. 2014, 25 (2014)","journal-title":"J. Appl. Math."},{"issue":"2","key":"41_CR17","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1109\/TSP.2004.840816","volume":"53","author":"DP Palomar","year":"2005","unstructured":"Palomar, D.P., Fonollosa, J.R.: Practical algorithms for a family of waterfilling solutions. IEEE Trans. Signal Process. 53(2), 686\u2013695 (2005)","journal-title":"IEEE Trans. Signal Process."},{"issue":"5","key":"41_CR18","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1109\/TNET.2007.896231","volume":"15","author":"B Radunovi\u0107","year":"2007","unstructured":"Radunovi\u0107, B., Boudec, J.Y.L.: A unified framework for max-min and min-max fairness with applications. IEEE\/ACM Trans. Netw. (TON) 15(5), 1073\u20131083 (2007)","journal-title":"IEEE\/ACM Trans. Netw. (TON)"},{"key":"41_CR19","unstructured":"Tassiulas, L., Sarkar, S.: Maxmin fair scheduling in wireless networks. In: INFOCOM 2002, Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, Proceedings, IEEE, vol. 2, pp. 763\u2013772. IEEE (2002)"},{"key":"41_CR20","doi-asserted-by":"crossref","unstructured":"Toffano, F., Wilson, N.: Balancing Schedules Using Maximum Leximin (Extended version including proofs). Unpublished Document (2019)","DOI":"10.1007\/978-3-030-29765-7_41"},{"issue":"1","key":"41_CR21","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1109\/21.87068","volume":"18","author":"RR Yager","year":"1988","unstructured":"Yager, R.R.: On ordered weighted averaging aggregation operators in multicriteria decisionmaking. IEEE Trans. Syst. Man Cybern. 18(1), 183\u2013190 (1988). https:\/\/doi.org\/10.1109\/21.87068","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"3","key":"41_CR22","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0925-5273(01)00175-X","volume":"76","author":"F Yalaoui","year":"2002","unstructured":"Yalaoui, F., Chu, C.: Parallel machine scheduling to minimize total tardiness. Int. J. Prod. Econ. 76(3), 265\u2013279 (2002)","journal-title":"Int. J. Prod. Econ."},{"issue":"2","key":"41_CR23","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1016\/j.jet.2010.10.018","volume":"146","author":"\u00d6 Yilmaz","year":"2011","unstructured":"Yilmaz, \u00d6.: Kidney exchange: an egalitarian mechanism. J. Econ. Theory 146(2), 592\u2013618 (2011)","journal-title":"J. Econ. Theory"},{"key":"41_CR24","doi-asserted-by":"crossref","DOI":"10.1515\/9780691214054","volume-title":"Equity: In Theory and Practice","author":"HP Young","year":"1995","unstructured":"Young, H.P.: Equity: In Theory and Practice. Princeton University Press, Princeton (1995)"}],"container-title":["Lecture Notes in Computer Science","Symbolic and Quantitative Approaches to Reasoning with Uncertainty"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29765-7_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,18]],"date-time":"2021-01-18T02:53:30Z","timestamp":1610938410000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-29765-7_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030297640","9783030297657"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29765-7_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"4 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECSQARU","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Symbolic and Quantitative Approaches with Uncertainty","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgrade","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Serbia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecsqaru2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.mi.sanu.ac.rs\/~ecsqaru2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"62","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":"41","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":"3","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":"66% - 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.1","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":"2.9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","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)"}}]}}