Scribd Logo
Upload

Welcome to Scribd!

  • 4 views

    Tarea 3

    Uploaded by

    lucas gamer2003
    The document shows demand for services over 7 time periods from 8am to 10pm. It aims to minimize the number of volunteers (X1, X2, etc.) assigned to each period to meet the demand, subject to the constraints that no period has fewer volunteers than its required demand. It then provides an example schedule assigning 4 volunteers in period 1, 2 in period 2, and so on, that meets all constraints and results in a minimum total of 20 volunteers.

    Copyright:

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

    You might also like

    Tarea 3

    Uploaded by

    lucas gamer2003
    4 views2 pages
    The document shows demand for services over 7 time periods from 8am to 10pm. It aims to minimize the number of volunteers (X1, X2, etc.) assigned to each period to meet the demand, subject to the constraints that no period has fewer volunteers than its required demand. It then provides an example schedule assigning 4 volunteers in period 1, 2 in period 2, and so on, that meets all constraints and results in a minimum total of 20 volunteers.

    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
    The document shows demand for services over 7 time periods from 8am to 10pm. It aims to minimize the number of volunteers (X1, X2, etc.) assigned to each period to meet the demand, subject to the constraints that no period has fewer volunteers than its required demand. It then provides an example schedule assigning 4 volunteers in period 1, 2 in period 2, and so on, that meets all constraints and results in a minimum total of 20 volunteers.

    Copyright:

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

    Tarea 3

    Uploaded by

    lucas gamer2003
    The document shows demand for services over 7 time periods from 8am to 10pm. It aims to minimize the number of volunteers (X1, X2, etc.) assigned to each period to meet the demand, subject to the constraints that no period has fewer volunteers than its required demand. It then provides an example schedule assigning 4 volunteers in period 1, 2 in period 2, and so on, that meets all constraints and results in a minimum total of 20 volunteers.

    Copyright:

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

    INICIO FINAL DEMANDA

    8:00 10:00 4
    10:00 12:00 6
    12:00 14:00 8
    14:00 16:00 6
    16:00 18:00 4
    18:00 20:00 6
    20:00 22:00 8

    TURNO FUNCION OBJETIVO Restricciones


    08:00 - 10:00 1 X1 Minimizar los voluntarios X1
    10:00 - 13:00 2 X2 X1+X2+X3+X4+X5=ZminX1 X2
    13:00 - 16:00 3 X3 X2 X3
    16:00 - 19:00 4 X4 X3
    19:00 - 22:00 5 X5 X3

    TURNO 1 2
    CANTIDAD 4 2
    HORARIO 1 1
    HORARIO 2 1 1
    HORARIO 3 1
    HORARIO 4
    HORARIO 5
    HORARIO 6
    HORARIO 7
    >= 4
    >= 6
    >= 8
    X4 >= 6
    X4 >= 4
    X4 >= 6
    X4 X5 >= 8

    3 4 5 RESULTADO
    6 6 2 20
    4 >= 4
    6 >= 6
    1 8 >= 8
    1 1 12 >= 6
    1 1 12 >= 4
    1 6 >= 6
    1 1 8 >= 8

    You might also like