Study at UCC |
Current Students |
Research |
Staff |
Teaching & Learning |
Visitors |
Alumni |
About UCC
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Toffano, Federico | |
| dc.contributor.author | Wilson, Nic | |
| dc.contributor.editor | Kern-Isberner, Gabriele | |
| dc.contributor.editor | Ognjanović, Zoran | |
| dc.date.accessioned | 2019-10-17T14:05:57Z | |
| dc.date.available | 2019-10-17T14:05:57Z | |
| dc.date.issued | 2019-09-04 | |
| dc.identifier.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 | en |
| dc.identifier.volume | 11726 | en |
| dc.identifier.startpage | 492 | en |
| dc.identifier.endpage | 503 | en |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.uri | http://hdl.handle.net/10468/8794 | |
| dc.identifier.doi | 10.1007/978-3-030-29765-7_41 | en |
| dc.description.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. | en |
| dc.format.mimetype | application/pdf | en |
| dc.language.iso | en | en |
| dc.publisher | Springer | en |
| dc.relation.uri | https://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_41 | en |
| dc.subject | Fair division | en |
| dc.subject | Preferences | en |
| dc.subject | Scheduling under uncertainty | en |
| dc.title | Balancing schedules using maximum leximin | en |
| dc.type | Conference item | en |
| dc.internal.authorcontactother | Nic Wilson, Computer Science, University College Cork, Cork, Ireland. +353-21-490-3000 Email: n.wilson@ucc.ie | en |
| dc.internal.availability | Full text available | en |
| dc.check.info | Access to this article is restricted until 12 months after publication by request of the publisher. | en |
| dc.check.date | 2020-09-04 | |
| dc.date.updated | 2019-10-17T13:46:53Z | |
| dc.description.version | Accepted Version | en |
| dc.internal.rssid | 499906872 | |
| dc.contributor.funder | Science Foundation Ireland
|
en |
| dc.contributor.funder | European Regional Development Fund
|
en |
| dc.contributor.funder | United Technologies
|
en |
| dc.description.status | Peer reviewed | en |
| dc.identifier.journaltitle | Lecture Notes in Computer Science | en |
| dc.internal.copyrightchecked | No | |
| dc.internal.licenseacceptance | Yes | en |
| dc.internal.conferencelocation | Belgrade, Serbia | en |
| dc.internal.IRISemailaddress | n.wilson@ucc.ie | en |
| dc.internal.IRISemailaddress | federico.toffano@ucc.ie | en |
| dc.relation.project | info:eu-repo/grantAgreement/SFI/SFI Research Centres/12/RC/2289/IE/INSIGHT - Irelands Big Data and Analytics Research Centre/
|
en |
