Pages that link to "Item:Q2059090"
From MaRDI portal
The following pages link to A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing (Q2059090):
Displayed 4 items.
- Exponential tightness for integral-type functionals of centered independent differently distributed random variables (Q2145744) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- An FPTAS for scheduling with resource constraints (Q6047696) (← links)
- Approximation algorithms for two-machine proportionate routing open shop on a tree (Q6134059) (← links)
