Balancing schedules using maximum leximin

The submission of new items to CORA is currently unavailable due to a repository upgrade. For further information, please contact cora@ucc.ie. Thank you for your understanding.

Files in this item

Icon
Name: 11148_Balancing-s ...
Size: 326.5Kb
Format: PDF
Description: Accepted version
View/Open

Balancing schedules using maximum leximin

Toffano, Federico; Wilson, Nic
Date: 2019-09-04
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
Related: https://link.springer.com/chapter/10.1007%2F978-3-030-29765-7_41
Full text restriction information: Access to this article is restricted until 12 months after publication by request of the publisher.
Restriction lift date: 2020-09-04
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
Published Version: 10.1007/978-3-030-29765-7_41

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.

Show full item record

This item appears in the following Collection(s)

This website uses cookies. By using this website, you consent to the use of cookies in accordance with the UCC Privacy and Cookies Statement. For more information about cookies and how you can disable them, visit our Privacy and Cookies statement