Trade-off between utility and fairness in two-agent single-machine scheduling
Year of publication: |
2025
|
---|---|
Authors: | Agnetis, Alessandro ; Benini, Mario ; Nicosia, Gaia ; Pacifici, Andrea |
Published in: |
European journal of operational research : EJOR. - Amsterdam [u.a.] : Elsevier, ISSN 0377-2217, ZDB-ID 1501061-2. - Vol. 323.2025, 3 (16.6.), p. 767-779
|
Subject: | Branch and bound | Kalai-Smorodinsky fairness | Lagrangian relaxation | Two-agent scheduling | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Gerechtigkeit | Justice | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound |
-
Minimizing makespan on a single machine with release dates and inventory constraints
Davari, Morteza, (2020)
-
Rostami, Mohammad, (2020)
-
Barketau, M., (2013)
- More ...
-
Scheduling three chains on two parallel machines
Agnetis, Alessandro, (2010)
-
Parallel dedicated machines scheduling with chain precedence constraints
Agnetis, Alessandro, (2012)
-
A survey of berth allocation and quay crane scheduling problems in container terminals
Agnetis, Alessandro, (2010)
- More ...