Algorithm for the solution of the Bottleneck Assignment Problem

Computing ◽  
1981 ◽  
Vol 27 (2) ◽  
pp. 179-187 ◽  
Author(s):  
G. Carpaneto ◽  
P. Toth
Keyword(s):  
Assignment Problem ◽  
Bottleneck Assignment Problem

scholarly journals Exploiting Structure in the Bottleneck Assignment Problem

2020 ◽  
Vol 53 (2) ◽  
pp. 3310-3315
Author(s):  
Mitchell Khoo ◽  
Tony A. Wood ◽  
Chris Manzie ◽  
Iman Shames
Keyword(s):  
Assignment Problem ◽  
Bottleneck Assignment Problem

The Multicommodity Multilevel Bottleneck Assignment Problem

2004 ◽  
Vol 17 ◽  
pp. 35-40 ◽  
Author(s):  
Roberto Aringhieri ◽  
Roberto Cordone
Keyword(s):  
Assignment Problem ◽  
Bottleneck Assignment Problem

scholarly journals Uncertain random simulation algorithm with application to bottleneck assignment problem

2018 ◽  
Vol 23 (21) ◽  
pp. 10977-10982
Author(s):  
Sibo Ding ◽  
Xiao-Jun Zeng ◽  
Huimin Zhang
Keyword(s):  
Assignment Problem ◽  
Simulation Algorithm ◽  
Random Simulation ◽  
Bottleneck Assignment Problem

On the bottleneck assignment problem

1977 ◽  
Vol 21 (4) ◽  
pp. 451-458 ◽  
Author(s):  
A. Ravindran ◽  
V. Ramaswami
Keyword(s):  
Assignment Problem ◽  
Bottleneck Assignment Problem

scholarly journals Decentralizing Coordination in Open Vehicle Fleets for Scalable and Dynamic Task Allocation

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-21
Author(s):  
Marin Lujak ◽  
Stefano Giordani ◽  
Andrea Omicini ◽  
Sascha Ossowski
Keyword(s):  
Task Allocation ◽  
Assignment Problem ◽  
Individual Interest ◽  
Matching Problem ◽  
Assignment Problems ◽  
Dynamic Task ◽  
Side Constraints ◽  
Dynamic Task Allocation ◽  
Bottleneck Assignment Problem ◽  
Linear Assignment

One of the major challenges in the coordination of large, open, collaborative, and commercial vehicle fleets is dynamic task allocation. Self-concerned individually rational vehicle drivers have both local and global objectives, which require coordination using some fair and efficient task allocation method. In this paper, we review the literature on scalable and dynamic task allocation focusing on deterministic and dynamic two-dimensional linear assignment problems. We focus on multiagent system representation of open vehicle fleets where dynamically appearing vehicles are represented by software agents that should be allocated to a set of dynamically appearing tasks. We give a comparison and critical analysis of recent research results focusing on centralized, distributed, and decentralized solution approaches. Moreover, we propose mathematical models for dynamic versions of the following assignment problems well known in combinatorial optimization: the assignment problem, bottleneck assignment problem, fair matching problem, dynamic minimum deviation assignment problem, Σk-assignment problem, the semiassignment problem, the assignment problem with side constraints, and the assignment problem while recognizing agent qualification; all while considering the main aspect of open vehicle fleets: random arrival of tasks and vehicles (agents) that may become available after assisting previous tasks or by participating in the fleet at times based on individual interest.

A generalized bottleneck assignment problem

1982 ◽  
Vol 36 (1) ◽  
pp. 135-138 ◽  
Author(s):  
H. W. Corley ◽  
H. Golnabi
Keyword(s):  
Assignment Problem ◽  
Bottleneck Assignment Problem
Sign in / Sign up

Export Citation Format

Share Document