Balancing schedules using maximum leximin

Simple item page
dc.contributor.authorToffano, Federico
dc.contributor.authorWilson, Nic
dc.contributor.editorKern-Isberner, Gabriele
dc.contributor.editorOgnjanović, Zoran
dc.contributor.funderScience Foundation Irelanden
dc.contributor.funderEuropean Regional Development Funden
dc.contributor.funderUnited Technologiesen
dc.date.accessioned2019-10-17T14:05:57Z
dc.date.available2019-10-17T14:05:57Z
dc.date.issued2019-09-04
dc.date.updated2019-10-17T13:46:53Z
dc.description.abstractWe 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.en
dc.description.statusPeer revieweden
dc.description.versionAccepted Versionen
dc.format.mimetypeapplication/pdfen
dc.identifier.citationToffano, 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_41en
dc.identifier.doi10.1007/978-3-030-29765-7_41en
dc.identifier.endpage503en
dc.identifier.issn0302-9743
dc.identifier.journaltitleLecture Notes in Computer Scienceen
dc.identifier.startpage492en
dc.identifier.urihttps://hdl.handle.net/10468/8794
dc.identifier.volume11726en
dc.language.isoenen
dc.publisherSpringeren
dc.relation.projectinfo:eu-repo/grantAgreement/SFI/SFI Research Centres/12/RC/2289/IE/INSIGHT - Irelands Big Data and Analytics Research Centre/en
dc.relation.urihttps://link.springer.com/chapter/10.1007%2F978-3-030-29765-7_41
dc.rights© 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_41en
dc.subjectFair divisionen
dc.subjectPreferencesen
dc.subjectScheduling under uncertaintyen
dc.titleBalancing schedules using maximum leximinen
dc.typeConference itemen
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
11148_Balancing-schedules.pdf
Size:
326.57 KB
Format:
Adobe Portable Document Format
Description:
Accepted version
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
2.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Computer Science - Conference Items
Insight Centre for Data Analytics - Conference Items