Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations
DOI10.1016/J.EJOR.2022.01.002OpenAlexW4206738518WikidataQ114184377 ScholiaQ114184377MaRDI QIDQ2672063FDOQ2672063
Authors: Andrzej Gnatowski, Antonín Novák, Přemysl Šůcha 
Publication date: 8 June 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.01.002
Recommendations
- Distributionally robust scheduling on parallel machines under moment uncertainty
- Exact algorithms for distributionally \(\beta \)-robust machine scheduling with uncertain processing times
- Distributionally robust single machine scheduling with the total tardiness criterion
- Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
computational complexityschedulingtotal flow timedistributionally robust optimizationuncertain processing time
Deterministic scheduling theory in operations research (90B35) Robustness in mathematical programming (90C17)
Cites Work
- PMTK
- Title not available (Why is that?)
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- Machine learning. A probabilistic perspective
- On duality theory of conic linear problems.
- Distributionally robust stochastic knapsack problem
- An Efficient Algorithm for Minimizing a Sum of p-Norms
- A note on the complexity of \(L _{p }\) minimization
- Absolute value equations
- Scheduling algorithms
- Robust scheduling on a single machine to minimize total flow time
- Likelihood robust optimization for data-driven problems
- On complexity of stochastic programming problems
- NP-completeness of the linear complementarity problem
- Data-driven robust optimization
- Multivariate measures of skewness for the skew-normal distribution
- Approximating total flow time on parallel machines
- Distributionally robust single machine scheduling with the total tardiness criterion
- Nonlinear bipartite matching
- More bounds on the expectation of a convex function of a random variable
- Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
- Extreme value statistics of correlated random variables: a pedagogical review
- Distributionally robust scheduling on parallel machines under moment uncertainty
- A distributionally robust optimization approach for outpatient colonoscopy scheduling
- Subspace embeddings for the L 1 -norm with applications
- Tight Bounds for ℓp Oblivious Subspace Embeddings
Cited In (7)
- Distributionally robust scheduling on parallel machines under moment uncertainty
- Single machine scheduling with release dates: a distributionally robust approach
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
- A distributionally robust approach for the two-machine permutation flow shop scheduling
- Handling uncertainty in the quay crane scheduling problem: a unified distributionally robust decision model
- Reconciling business analytics with graphically initialized subspace clustering for optimal nonlinear pricing
- The Complexity of Scheduling for p-Norms of Flow and Stretch
Uses Software
This page was built for publication: Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2672063)
