Pages that link to "Item:Q1941692"
From MaRDI portal
The following pages link to The 2-valued case of makespan minimization with assignment constraints (Q1941692):
Displaying 7 items.
- Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
- A 3/2-approximation algorithm for the graph balancing problem with two weights (Q1736801) (← links)
- Estimating the makespan of the two-valued restricted assignment problem (Q1751100) (← links)
- Makespan minimization on unrelated parallel machines with a few bags (Q2173300) (← links)
- Approximation algorithms for the graph balancing problem with two speeds and two job lengths (Q2424664) (← links)
- On some special cases of the restricted assignment problem (Q2630343) (← links)
- Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs (Q5919098) (← links)