Balancing schedules using maximum leximin

Federico Toffano; Nic Wilson

doi:10.1007/978-3-030-29765-7_41

Balancing schedules using maximum leximin

Federico Toffano
, Nic Wilson

University College Cork

Research output: Chapter in Book/Report/Conference proceedings › Conference proceeding › peer-review

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.

Original language	English
Title of host publication	Symbolic and Quantitative Approaches to Reasoning with Uncertainty - 15th European Conference, ECSQARU 2019, Proceedings
Editors	Gabriele Kern-Isberner, Zoran Ognjanović
Publisher	Springer Verlag
Pages	492-503
Number of pages	12
ISBN (Print)	9783030297640
DOIs	https://doi.org/10.1007/978-3-030-29765-7_41
Publication status	Published - 2019
Event	15th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU 2019 - Belgrade, Serbia Duration: 18 Sep 2019 → 20 Sep 2019

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11726 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	15th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU 2019
Country/Territory	Serbia
City	Belgrade
Period	18/09/19 → 20/09/19

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 9 Industry, Innovation, and Infrastructure

Keywords

Fair division
Preferences
Scheduling under uncertainty

Access to Document

10.1007/978-3-030-29765-7_41

Cite this

Toffano, F., & Wilson, N. (2019). Balancing schedules using maximum leximin. In G. Kern-Isberner, & Z. Ognjanović (Eds.), Symbolic and Quantitative Approaches to Reasoning with Uncertainty - 15th European Conference, ECSQARU 2019, Proceedings (pp. 492-503). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11726 LNAI). Springer Verlag. https://doi.org/10.1007/978-3-030-29765-7_41

Toffano, Federico ; Wilson, Nic. / Balancing schedules using maximum leximin. Symbolic and Quantitative Approaches to Reasoning with Uncertainty - 15th European Conference, ECSQARU 2019, Proceedings. editor / Gabriele Kern-Isberner ; Zoran Ognjanović. Springer Verlag, 2019. pp. 492-503 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{fb878a3983454c3dacb1abaff46b6f5e,

title = "Balancing schedules using maximum leximin",

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 = "Fair division, Preferences, Scheduling under uncertainty",

author = "Federico Toffano and Nic Wilson",

note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2019.; 15th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU 2019 ; Conference date: 18-09-2019 Through 20-09-2019",

year = "2019",

doi = "10.1007/978-3-030-29765-7\_41",

language = "English",

isbn = "9783030297640",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "492--503",

editor = "Gabriele Kern-Isberner and Zoran Ognjanovi{\'c}",

booktitle = "Symbolic and Quantitative Approaches to Reasoning with Uncertainty - 15th European Conference, ECSQARU 2019, Proceedings",

address = "Germany",

}

Toffano, F & Wilson, N 2019, Balancing schedules using maximum leximin. in G Kern-Isberner & Z Ognjanović (eds), Symbolic and Quantitative Approaches to Reasoning with Uncertainty - 15th European Conference, ECSQARU 2019, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11726 LNAI, Springer Verlag, pp. 492-503, 15th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU 2019, Belgrade, Serbia, 18/09/19. https://doi.org/10.1007/978-3-030-29765-7_41

Balancing schedules using maximum leximin. / Toffano, Federico; Wilson, Nic.
Symbolic and Quantitative Approaches to Reasoning with Uncertainty - 15th European Conference, ECSQARU 2019, Proceedings. ed. / Gabriele Kern-Isberner; Zoran Ognjanović. Springer Verlag, 2019. p. 492-503 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11726 LNAI).

Research output: Chapter in Book/Report/Conference proceedings › Conference proceeding › peer-review

TY - GEN

T1 - Balancing schedules using maximum leximin

AU - Toffano, Federico

AU - Wilson, Nic

N1 - Publisher Copyright: © Springer Nature Switzerland AG 2019.

PY - 2019

Y1 - 2019

N2 - 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.

AB - 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.

KW - Fair division

KW - Preferences

KW - Scheduling under uncertainty

UR - https://www.scopus.com/pages/publications/85072860162

U2 - 10.1007/978-3-030-29765-7_41

DO - 10.1007/978-3-030-29765-7_41

M3 - Conference proceeding

AN - SCOPUS:85072860162

SN - 9783030297640

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 492

EP - 503

BT - Symbolic and Quantitative Approaches to Reasoning with Uncertainty - 15th European Conference, ECSQARU 2019, Proceedings

A2 - Kern-Isberner, Gabriele

A2 - Ognjanović, Zoran

PB - Springer Verlag

T2 - 15th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU 2019

Y2 - 18 September 2019 through 20 September 2019

ER -

Toffano F, Wilson N. Balancing schedules using maximum leximin. In Kern-Isberner G, Ognjanović Z, editors, Symbolic and Quantitative Approaches to Reasoning with Uncertainty - 15th European Conference, ECSQARU 2019, Proceedings. Springer Verlag. 2019. p. 492-503. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-29765-7_41

Balancing schedules using maximum leximin

Abstract

Publication series

Conference

UN SDGs

Keywords

Access to Document

Other files and links

Fingerprint

Cite this