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

DOI10.1016/J.EJOR.2022.01.002MaRDI QIDQ2672063OpenAlexWikidataFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 1614382 (Why is no real title available?)
• A distributionally robust optimization approach for outpatient colonoscopy scheduling
• A note on the complexity of \(L _{p }\) minimization
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• Absolute value equations
• An Efficient Algorithm for Minimizing a Sum of p-Norms
• Approximating total flow time on parallel machines
• Data-driven robust optimization
• Distributionally robust scheduling on parallel machines under moment uncertainty
• Distributionally robust single machine scheduling with the total tardiness criterion
• Distributionally robust stochastic knapsack problem
• Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
• Extreme value statistics of correlated random variables: a pedagogical review
• Likelihood robust optimization for data-driven problems
• Machine learning. A probabilistic perspective
• More bounds on the expectation of a convex function of a random variable
• Multivariate measures of skewness for the skew-normal distribution
• NP-completeness of the linear complementarity problem
• Nonlinear bipartite matching
• On complexity of stochastic programming problems
• On duality theory of conic linear problems.
• PMTK
• Robust scheduling on a single machine to minimize total flow time
• Scheduling algorithms
• Subspace embeddings for the L ₁ -norm with applications
• Tight bounds for \(\ell_p\) oblivious subspace embeddings

Cited in

(7)

• A distributionally robust approach for the two-machine permutation flow shop scheduling
• Distributionally robust scheduling on parallel machines under moment uncertainty
• A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
• Reconciling business analytics with graphically initialized subspace clustering for optimal nonlinear pricing
• The Complexity of Scheduling for p-Norms of Flow and Stretch
• Handling uncertainty in the quay crane scheduling problem: a unified distributionally robust decision model
• Single machine scheduling with release dates: a distributionally robust approach

Describes a project that uses

Uses Software

• PMTK

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)