Pages that link to "Item:Q5369526"
From MaRDI portal
The following pages link to Estimating The Makespan of The Two-Valued Restricted Assignment Problem (Q5369526):
Displaying 7 items.
- Estimating the makespan of the two-valued restricted assignment problem (Q1751100) (← links)
- The 2-valued case of makespan minimization with assignment constraints (Q1941692) (← links)
- Approximation algorithms for the graph balancing problem with two speeds and two job lengths (Q2424664) (← links)
- Structured Instances of Restricted Assignment with Two Processing Times (Q2971651) (← links)
- (Q5091233) (← links)
- On minimizing the makespan when some jobs cannot be assigned on the same machine (Q5111718) (← links)
- A Quasi-Polynomial Approximation for the Restricted Assignment Problem (Q5138780) (← links)