Block rearranging elements within matrix columns to minimize the variability of the row sums

DOI10.1007/s10288-017-0344-4zbMath1384.90041OpenAlexW3123892924MaRDI QIDQ1743640

Steven Vanduffel, Edgars Jakobsons, Leopoldo Catania

Publication date: 13 April 2018

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://research.vu.nl/en/publications/3afc634d-c15d-417b-878d-b8983f039810

zbMATH Keywords

greedy algorithmrearrangements\(k\)-partitioningassembly line crew schedulingKarmarkar-Karp differencing algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Case-oriented studies in operations research (90B90)

Related Items (7)

Scenario aggregation method for portfolio expectile optimization ⋮ The impact of correlation on (Range) Value-at-Risk ⋮ Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations ⋮ Rearrangement algorithm and maximum entropy ⋮ Range value-at-risk bounds for unimodal distributions under partial information ⋮ A model-free approach to multivariate option pricing ⋮ Centers of probability measures without the mean

Cites Work

• The complete mixability and convex minimization problems with monotone marginal densities
• Stochastic orders
• Quantile of a mixture with application to model risk assessment
• Multivariate arrangement increasing functions with applications in probability and statistics
• A complete anytime algorithm for number partitioning
• An exact algorithm for the identical parallel machine scheduling problem.
• A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
• Extremal dependence concepts
• The partition problem
• Computation of sharp bounds on the distribution of a function of dependent risks
• Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem
• Mathematical Risk Analysis
• Joint Mixability
• Approximation Algorithms for the Assembly Line Crew Scheduling Problem
• Permuting Elements Within Columns of a Matrix in Order to Minimize Maximum Row Sum
• Phase Transition in the Number Partitioning Problem
• Optimal Scheduling of Tasks on Identical Parallel Processors
• Algorithms for Finding Copulas Minimizing Convex Functions of Sums
• Bounds for Certain Multiprocessing Anomalies
• Rearrangement Inequalities
• Inequalities: theory of majorization and its applications

This page was built for publication: Block rearranging elements within matrix columns to minimize the variability of the row sums