Pages that link to "Item:Q1728475"
From MaRDI portal
The following pages link to Price of fairness in two-agent single-machine scheduling problems (Q1728475):
Displaying 13 items.
- Rawlsian fairness in push and pull supply chains (Q2029962) (← links)
- Optimally rescheduling jobs with a last-in-first-out buffer (Q2066687) (← links)
- The price of fairness for a two-agent scheduling game minimizing total completion time (Q2082220) (← links)
- Pareto-scheduling of two competing agents with their own equal processing times (Q2140187) (← links)
- Decentralized task coordination (Q2171631) (← links)
- Online single-machine scheduling to minimize the linear combination of makespans of two agents (Q2234790) (← links)
- Two competitive agents to minimize the weighted total late work and the total completion time (Q2243272) (← links)
- Efficiency and equity in the multi organization scheduling problem (Q2661769) (← links)
- Scheduling with competing agents, total late work and job rejection (Q2668778) (← links)
- Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work (Q6076476) (← links)
- Computing welfare-maximizing fair allocations of indivisible goods (Q6109821) (← links)
- A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem (Q6114936) (← links)
- Competitive two-agent scheduling with release dates and preemption on a single machine (Q6116025) (← links)
