Balancing schedules using maximum leximin

Thumbnail Image
Files
11148_Balancing-schedules.pdf(326.57 KB)
Accepted version
Date
2019-09-04
Authors
Toffano, Federico
Wilson, Nic
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
Published Version
10.1007/978-3-030-29765-7_41
Research Projects
Organizational Units
Journal Issue
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.
Description
Keywords
Fair division , Preferences , Scheduling under uncertainty
Citation
Toffano, F. and Wilson, N. (2019) 'Balancing Schedules Using Maximum Leximin', ECSQARU 2019: Symbolic and Quantitative Approaches to Reasoning with Uncertainty, Belgrade, Serbia, 18-20 September, Lecture Notes in Computer Science (LNCS, volume 11726) Cham: Springer International Publishing, pp. 492-503. doi: 10.1007/978-3-030-29765-7_41
Link to publisher’s version
https://link.springer.com/chapter/10.1007%2F978-3-030-29765-7_41
URI
https://hdl.handle.net/10468/8794
Collections
Computer Science - Conference Items
Insight Centre for Data Analytics - Conference Items
Copyright
© Springer Nature Switzerland AG 2019. This is a post-peer-review, pre-copyedit version of an article published in Lecture Notes in Computer Science The final authenticated version is available online at: http://dx.doi.org/10.1007/978-3-030-29765-7_41