pp 1–20

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

Research Paper

DOI: 10.1007/s10288-017-0344-4

Cite this article as:
Boudt, K., Jakobsons, E. & Vanduffel, S. 4OR-Q J Oper Res (2017). doi:10.1007/s10288-017-0344-4


Several problems in operations research, such as the assembly line crew scheduling problem and the k-partitioning problem can be cast as the problem of finding the intra-column rearrangement (permutation) of a matrix such that the row sums show minimum variability. A necessary condition for optimality of the rearranged matrix is that for every block containing one or more columns it must hold that its row sums are oppositely ordered to the row sums of the remaining columns. We propose the block rearrangement algorithm with variance equalization (BRAVE) as a suitable method to achieve this situation. It uses a carefully motivated heuristic—based on an idea of variance equalization—to find optimal blocks of columns and rearranges them. When applied to the number partitioning problem, we show that BRAVE outperforms the well-known greedy algorithm and the Karmarkar–Karp differencing algorithm.


Assembly line crew scheduling Greedy algorithm Rearrangements k-Partitioning Karmarkar–Karp differencing algorithm 

Mathematics Subject Classification

90B35 90B90 90C27 97M40 90C59 

Copyright information

© Springer-Verlag Berlin Heidelberg 2017

Authors and Affiliations

  1. 1.Vrije Universiteit Brussel (VUB)BrusselsBelgium
  2. 2.Vrije Universiteit AmsterdamAmsterdamThe Netherlands
  3. 3.ETH ZürichZürichSwitzerland

Personalised recommendations