• Home   /  
  • Archive by category "1"

Assignment Method Maximization Applications

Assignment Problem Calculator

This application solves the assignment problem using the Hungarian algorithm. The linear assigment problems with the objecttive of maximizing profit or minimizing cost can be solved with this calculator. For example, you want to hire three workers to do three tasks. The cost/task of the workers is shown in the table below.

cost/tasktask 1task 2task 3
worker 1855841
worker 2548295
worker 3927298
You want to do the worker-task assignment in such a way that minimize the total cost. Solving this example with the assignment problem calculator gives the minimum cost of 167 if task 3 is assigned to worker 1, task 1 to worker 2, and task 2 to work 3.

Input Data

The valid input data of assigning $n$ tasks to $n$ workers is in the form of $n\times n$ cost matrix $C$ of nonnegative integer numbers, see Matrix Data Input for more detail of entering matrix data. The element $C_{ij}$ is the cost of assigning task $j$ to worker $i$.

Assignment Problem Calculator

В конце концов ей пришлось смириться. Когда они в ту ночь отправились спать, она старалась радоваться с ним вместе, но что-то в глубине души говорило ей: все это кончится плохо. Она оказалась права, но никогда не подозревала насколько.

One thought on “Assignment Method Maximization Applications

Leave a comment

L'indirizzo email non verrà pubblicato. I campi obbligatori sono contrassegnati *