Abstract
We consider the problem of assigning, in a fair way, time limits for processes in manufacturing a product, subject to a deadline where the duration of each activity can be uncertain. We focus on an approach based on choosing the maximum element according to a leximin ordering, and we prove the correctness of a simple iterative procedure for generating this maximally preferred element. Our experimental testing illustrates the efficiency of our approach.
Keywords
This material is based upon works supported by the Science Foundation Ireland under Grant No. 12/RC/2289 which is co-funded under the European Regional Development Fund, and by United Technologies Corporation under the Insight-UCC Collaboration Project.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
This is different from the classic water pouring/filling algorithms for allocating power [17].
- 2.
For space reasons, almost all the proofs have been omitted; they can be found in the longer version [20], which also contains auxiliary results and many more details about the implementation and experimental testing.
References
Bonald, T., Massoulié, L., Proutiere, A., Virtamo, J.: A queueing analysis of max-min fairness, proportional fairness and balanced fairness. Queueing Syst. 53(1–2), 65–84 (2006)
Bouveret, S., Lemaître, M.: Computing leximin-optimal solutions in constraint networks. Artif. Intell. 173(2), 343–364 (2009)
Chen, J.F.: Minimization of maximum tardiness on unrelated parallel machines with process restrictions and setups. Int. J. Adv. Manufact. Technol. 29(5), 557–563 (2006)
Du, J., Leung, J.Y.T.: Minimizing total tardiness on one machine is NP-hard. Math. Oper. Res. 15(3), 483–495 (1990)
Dubois, D., Fargier, H., Fortemps, P.: Fuzzy scheduling: modelling flexible constraints vs. coping with incomplete knowledge. Eur. J. Oper. Res. 147(2), 231–252 (2003)
Dubois, D., Fortemps, P.: Computing improved optimal solutions to max-min flexible constraint satisfaction problems. Eur. J. Oper. Res. 118(1), 95–126 (1999)
Fodor, J., Marichal, J.L., Roubens, M.: Characterization of the ordered weighted averaging operators. IEEE Trans. Fuzzy Syst. 3(2), 236–240 (1995)
Gopinathan, A., Li, Z.: Strategyproof auctions for balancing social welfare and fairness in secondary spectrum markets. In: INFOCOM, 2011 Proceedings IEEE, pp. 3020–3028. IEEE (2011)
Ho, J.C., Chang, Y.L.: Heuristics for minimizing mean tardiness for m parallel machines. Nav. Res. Logist. (NRL) 38(3), 367–381 (1991)
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–231. ACM (2001)
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–19, 2015, pp. 345–362. ACM (2015)
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–275. IEEE (2002)
Moulin, H.: Fair Division and Collective Welfare. MIT Press, London (2004)
Nace, D., Orlin, J.B.: Lexicographically minimum and maximum load linear programming problems. Oper. Res. 55(1), 182–187 (2007)
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)
Ogryczak, W., Luss, H., Pióro, M., Nace, D., Tomaszewski, A.: Fairoptimization and networks: a survey. J. Appl. Math. 2014, 25 (2014)
Palomar, D.P., Fonollosa, J.R.: Practical algorithms for a family of waterfilling solutions. IEEE Trans. Signal Process. 53(2), 686–695 (2005)
Radunović, 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–1083 (2007)
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–772. IEEE (2002)
Toffano, F., Wilson, N.: Balancing Schedules Using Maximum Leximin (Extended version including proofs). Unpublished Document (2019)
Yager, R.R.: On ordered weighted averaging aggregation operators in multicriteria decisionmaking. IEEE Trans. Syst. Man Cybern. 18(1), 183–190 (1988). https://doi.org/10.1109/21.87068
Yalaoui, F., Chu, C.: Parallel machine scheduling to minimize total tardiness. Int. J. Prod. Econ. 76(3), 265–279 (2002)
Yilmaz, Ö.: Kidney exchange: an egalitarian mechanism. J. Econ. Theory 146(2), 592–618 (2011)
Young, H.P.: Equity: In Theory and Practice. Princeton University Press, Princeton (1995)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Toffano, F., Wilson, N. (2019). Balancing Schedules Using Maximum Leximin. In: Kern-Isberner, G., Ognjanović, Z. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2019. Lecture Notes in Computer Science(), vol 11726. Springer, Cham. https://doi.org/10.1007/978-3-030-29765-7_41
Download citation
DOI: https://doi.org/10.1007/978-3-030-29765-7_41
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-29764-0
Online ISBN: 978-3-030-29765-7
eBook Packages: Computer ScienceComputer Science (R0)