PHPSimplex

Optimizing resources with Linear Programming



Allocative personnel's problem

A company has reserved 5 candidates to occupy 4 work jobs. The work jobs consist in driving 4 different hardwares (one worker for each hardware). The company tested the 5 workers at the 4 machines, doing the same work every worker at every machine, Obtaining the following times:

  Machine 1 Machine 2 Machine 3 Machine 4
Candidate A 10 6 6 5
Candidate B 8 7 6 6
Candidate C 8 6 5 6
Candidate D 9 7 7 6
Candidate E 8 7 6 5

Determining wich candidates must choose the company and to wich machine must be assigned.

 

Determining decision variables and expressing them algebraically. In this case:

Determining the restrictions and expressing them as equations or inequalities in function of the decision variables.

Expressing all implicit conditions established by the origin of variables: negativeness, integer, only a few allowed values... . In this case, the restrictions are that workpeople's assignments to hardware must be boolean (0 not assigned, 1 yes), and so, can't be negatives:

Determining objective function:

Perform a change of variable with the following correspondence:

XA1 XA2 XA3 XA4 XB1 XB2 XB3 XB4 XC1 XC2
X1 X2 X3 X4 X5 X6 X7 X8 X9 X10

XC3 XC4 XD1 XD2 XD3 XD4 XE1 XE2 XE3 XE4
X11 X12 X13 X14 X15 X16 X17 X18 X19 X20

Solve with PHPSimplex.

Copyright ©2006-2016 PHPSimplex. All rights reserved.
Follow us on Twitter
X

PHPSimplex
Version 0.81

Copyright ©2006-2016. All rights reserved.

Developed by:
Daniel Izquierdo Granja
Juan José Ruiz Ruiz

English translation by:
Luciano Miguel Tobaria

French translation by:
Ester Rute Ruiz