## Abstract

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.

Original language | English |
---|---|

Pages (from-to) | 31–50 |

Number of pages | 20 |

Journal | 4OR |

Volume | 16 |

Issue number | 1 |

Early online date | 2 Mar 2017 |

DOIs | |

Publication status | Published - Mar 2018 |

## Keywords

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