Pages that link to "Item:Q653317"
From MaRDI portal
The following pages link to Optimal algorithms for online scheduling with bounded rearrangement at the end (Q653317):
Displaying 17 items.
- Online scheduling with one rearrangement at the end: revisited (Q456073) (← links)
- Online scheduling with rearrangement on two related machines (Q627161) (← links)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- Scheduling on parallel identical machines with late work criterion: offline and online cases (Q1702733) (← links)
- Optimal transport natural gradient for statistical manifolds with continuous sample space (Q2006192) (← links)
- A mean field games approach to cluster analysis (Q2045120) (← links)
- Online makespan scheduling with job migration on uniform machines (Q2067667) (← links)
- Summary statistics and discrepancy measures for approximate Bayesian computation via surrogate posteriors (Q2080374) (← links)
- Online scheduling with migration on two hierarchical machines (Q2091110) (← links)
- The geodesic distance on the generalized gamma manifold for texture image retrieval (Q2127293) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- Online minimum makespan scheduling with a buffer (Q2929632) (← links)
- Online Makespan Scheduling with Job Migration on Uniform Machines (Q5009583) (← links)
- Multisource Single-Cell Data Integration by MAW Barycenter for Gaussian Mixture Models (Q6079777) (← links)
- Parallel solutions for preemptive makespan scheduling on two identical machines (Q6102847) (← links)
- Projection-based techniques for high-dimensional optimal transport problems (Q6602009) (← links)
- Distributionally robust optimization using optimal transport for Gaussian mixture models (Q6640177) (← links)
