Pages that link to "Item:Q2240719"
From MaRDI portal
The following pages link to Irreducible bin packing and normality in routing open shop (Q2240719):
Displaying 3 items.
- New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan (Q1761791) (← links)
- Exponential tightness for integral-type functionals of centered independent differently distributed random variables (Q2145744) (← links)
- Approximation algorithms for two-machine proportionate routing open shop on a tree (Q6134059) (← links)