## Abstract

An assignment problem arises when there exists a set of tasks that must be allocated to a set of agents. The bottleneck assignment problem (BAP) has the objective of minimising the most costly allocation of a task to an agent. Under certain conditions the structure of the BAP can be exploited such that subgroups of tasks are assigned separately with lower complexity and then merged to form a combined assignment. In particular, we discuss merging the assignments from two separate BAPs and use the solution of the subproblems to bound the solution of the combined problem. We also provide conditions for cases where the solution of the subproblems produces an exact solution to the BAP over the combined problem. We then introduce a particular algorithm for solving the BAP that takes advantage of this insight. The methods are demonstrated in a numerical case study.

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

Pages (from-to) | 3310-3315 |

Number of pages | 6 |

Journal | IFAC-PapersOnLine |

Volume | 53 |

Issue number | 2 |

DOIs | |

Publication status | Published - 2020 |

Externally published | Yes |

Event | 21st IFAC World Congress 2020 - Berlin, Germany Duration: 12 Jul 2020 → 17 Jul 2020 |