On fairness as a rostering objective
| Autor: | Anna Lavygina, Alan Crispin, Kristopher Welsh |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Operations research
010201 computation theory & mathematics Computer science Simulated annealing 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing 0102 computer and information sciences 02 engineering and technology 01 natural sciences Evolutionary computation Scheduling (computing) |
| Zdroj: | GECCO (Companion) |
| Popis: | Many combinatorial optimization problems involve scheduling or ordering work that will ultimately be completed by a company's employees. If solution quality is measured by a simple weighted sum of the constraint violations for each employee, an optimizer may produce solutions in which a small number of employees suffer a highly disproportionate share of these violations. We present the results of experiments in generating rosters whilst considering fairness as an additional optimization objective. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|