Proportional optimization and fairness
From MaRDI portal
Recommendations
- Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
- Solution of the Liu-Layland problem via bottleneck just-in-time sequencing
- scientific article; zbMATH DE number 5172390
- Proportionate progress: A notion of fairness in resource allocation
- Just-in-time sequencing in mixed-model production systems relating with fair representation in apportionment theory
Cited in
(16)- Using aggregation to reduce response time variability in cyclic fair sequences
- Optimization problems in fair division theory.
- Routing equal-size messages on a slotted ring
- An optimality-argument for equal weighting
- Fair apportionment in the view of the Venice Commission's recommendation
- Solution of the Liu-Layland problem via bottleneck just-in-time sequencing
- scientific article; zbMATH DE number 1903384 (Why is no real title available?)
- Webster sequences, apportionment problems, and just-in-time sequencing
- Inequity averse optimization in operational research
- A branch and bound algorithm for the response time variability problem
- Fair task allocation problem
- Do balanced words have a short period?
- Minimising maximum response time
- Maximin fairness in project budget allocation
- Fair optimization and networks: a survey
- Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines
This page was built for publication: Proportional optimization and fairness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q947706)
