Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations

DOI10.1016/J.EJOR.2022.01.002OpenAlexW4206738518WikidataQ114184377 ScholiaQ114184377MaRDI QIDQ2672063

Andrzej Gnatowski, Přemysl Šucha, Antonín Novák

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

zbMATH Keywords

computational complexityschedulingtotal flow timedistributionally robust optimizationuncertain processing time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Robustness in mathematical programming (90C17)

Related Items (3)

Reconciling business analytics with graphically initialized subspace clustering for optimal nonlinear pricing ⋮ Single machine scheduling with release dates: a distributionally robust approach ⋮ Handling uncertainty in the quay crane scheduling problem: a unified distributionally robust decision model

Uses Software

• PMTK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• PMTK
• Multivariate measures of skewness for the skew-normal distribution
• A note on the complexity of \(L _{p }\) minimization
• Absolute value equations
• Nonlinear bipartite matching
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• NP-completeness of the linear complementarity problem
• Distributionally robust single machine scheduling with the total tardiness criterion
• Data-driven robust optimization
• Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
• Robust scheduling on a single machine to minimize total flow time
• Likelihood robust optimization for data-driven problems
• Distributionally robust scheduling on parallel machines under moment uncertainty
• Extreme value statistics of correlated random variables: a pedagogical review
• A distributionally robust optimization approach for outpatient colonoscopy scheduling
• Approximating total flow time on parallel machines
• Distributionally Robust Stochastic Knapsack Problem
• An Efficient Algorithm for Minimizing a Sum of p-Norms
• Tight Bounds for ℓ_p Oblivious Subspace Embeddings
• Subspace embeddings for the L ₁ -norm with applications
• More bounds on the expectation of a convex function of a random variable

This page was built for publication: Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations