Scribd Logo
Upload

Welcome to Scribd!

  • Taller Secuenciacion

    Uploaded by

    Cesar Mauricio Pinto Martinez
    4 views14 pages
    1. The document presents an optimization problem to minimize the total delay (Z) of assigning machines to tasks. It defines variables and constraints for assigning 5 machines to 6 tasks. 2. It provides the coefficients for the delay time of each machine-task assignment and constraints requiring each machine and task to be assigned once. 3. The optimal solution is found by solving the linear program to minimize Z subject to the assignment constraints.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    XLSX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    1. The document presents an optimization problem to minimize the total delay (Z) of assigning machines to tasks. It defines variables and constraints for assigning 5 machines to 6 tasks. 2. It provides the coefficients for the delay time of each machine-task assignment and constraints requiring each machine and task to be assigned once. 3. The optimal solution is found by solving the linear program to minimize Z subject to the assignment constraints.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    4 views14 pages

    Taller Secuenciacion

    Uploaded by

    Cesar Mauricio Pinto Martinez
    1. The document presents an optimization problem to minimize the total delay (Z) of assigning machines to tasks. It defines variables and constraints for assigning 5 machines to 6 tasks. 2. It provides the coefficients for the delay time of each machine-task assignment and constraints requiring each machine and task to be assigned once. 3. The optimal solution is found by solving the linear program to minimize Z subject to the assignment constraints.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 14

    1.

    PUNTO
    2.
    1.

    2. PUNTO

    METODO DE ASIGNACIÓN
    MIN Z= 65X11+50X12+60X13+55X14+80X15+30X21+75X22+125X23+50X24+40X25+75X31+35X32+85X33
    +130X44+110X45+90X51+85X52+40X53+80X54+95X55+145X61+60X62+55X63+

    MAQUINISTA - MAQUINA
    X1,1 + X2,1 + X3,1 + X4,1 + X5,1 = 1
    X1,2 + X2,2 + X3,2 + X4,2 + X5,2 = 1
    X1,3 + X2,3 + X3,3 + X4,3 + X5,3 = 1
    X1,4 + X2,4 + X3,4 + X4,4 +
    X5,4 = 1 X1,5 + X2,5 +
    X3,5 + X4,5 + X5,5 = 1 X1,6 + X2,6 +
    X3,6 + X4,6 + X5,6 = 1

    X1,1 + X1,2 + X1,3 + X1,4 + X1,5 = 1


    X2,1 + X2,2 + X2,3 + X2,4 + X2,5 = 1
    X3,1 + X3,2 + X3,3 + X3,4 + X3,5 = 1
    X4,1 + X4,2 + X4,3 + X4,4 +
    X4,5 = 1 X5,1 + X5,2 +
    X5,3 + X5,4 + X5,5 = 1 X6,1 + X6,2 +
    X6,3 + X6,4 + X6,5 = 1

    VARIABLE RESULTADO DEMORA RESTRICCIONES


    X11 0 65 LADO IZQUIERDO LADO DERECHO
    X12 0 50 0 1
    X13 0 60 0 1
    X14 0 55 0 1
    X15 0 80 0 1
    X21 0 30 0 1
    X22 0 75 0 1
    X23 0 125 0 1
    X24 0 50 0 1
    X25 0 40 0 1
    X31 0 75 0 1
    X32 0 35 0 1
    X33 0 85
    X34 0 95
    X35 0 45
    X41 0 60
    X42 0 40
    X43 0 115
    X44 0 130
    X45 0 110
    X51 0 90
    X52 0 85
    X53 0 40
    X54 0 80
    X55 0 95
    X61 0 145
    X62 0 60
    X63 0 55
    X64 0 45
    X65 0 85
    F.O 0
    DIAGRAMA DE GANTT
    1 2 3 4 5 6 7 8 9
    PROCESO 1 E A
    PROCESO 2 E

    Cmax 49

    REGLA DE JHONSON E,A,B,D,C

    2.
    5.
    3.
    4.
    1.
    24+40X25+75X31+35X32+85X33+95X34+45X35+60X41+40X42+115X43
    +95X55+145X61+60X62+55X63+45X64+85X65
    10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32
    B D
    E A B

    TIEMPO DE TERMINACION DE LOS TRABAJOS


    33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49
    C
    D C

    You might also like