Paste
Copy
Cut
Options

¡Tu solución está lista!

Nuestra ayuda de expertos desglosó tu problema en una solución confiable y fácil de entender.

Mira la respuesta

  • Pregunta: please asnwer what is the slack for each tast 2-13 and how long will the project take to finishCritical Path Method Given the following data and dependency graph, Task id: 1, duration: 6, predecessors: [] Task id: 2, duration: 5, predecessors: [1] Task id: 3, duration: 2, predecessors: [1] Task id: 4, duration: 6, predecessors: [1] Task id: 5, duration: 4,

    please asnwer what is the slack for each tast 2-13 and how long will the project take to finish
    Critical Path Method Given the following data and dependency graph, Task id: 1, duration: 6, predecessors: [] Task id: 2, duration: 5, predecessors: [1] Task id: 3, duration: 2, predecessors: [1] Task id: 4, duration: 6, predecessors: [1] Task id: 5, duration: 4, predecessors: [2, 3] Task id: 6, duration: 1, predecessors: [4] Task id: 7, duration: 2, predecessors: [4] Task id: 8, duration: 4, predecessors: [4] Task id: 9, duration: 3, predecessors: [2] Task id: 10, duration: 4, predecessors: [5,6] Task id: 11, duration: 1, predecessors: [7,8] Task id: 12, duration: 4, predecessors: [9, 10] Task id: 13, duration: 2, predecessors: [6, 11] Task id: 14, duration: 1, predecessors: [12, 13] 2 3 1.8 5 7 3.P Use the critical path method to answer these questions. 9 10 11 12 13 14

    student submitted image, transcription available below
    Muestra el texto de la transcripción de la imagen
  • Chegg Logo
    Hay 3 pasos para resolver este problema.
    Solución
    Paso 1
    The critical path method (CPM) is a project management technique used to determine the longest path ...
    Mira la respuesta completa
    answer image blur
    Paso 2
    Desbloquea
    Paso 3
    Desbloquea
    Respuesta
    Desbloquea
Texto de la transcripción de la imagen:
Critical Path Method Given the following data and dependency graph, Task id: 1, duration: 6 , predecessors: [] Taskid: 2 , duration: 5 , predecessors: [1] Taskid: 3 , duration: 2, predecessors: [1] Task id: 4, duration: 6, predecessors: [1] Task id: 5 , duration: 4, predecessors: \\( (2,3) \\) Task id: 6 , duration: 1 , predecessors: [4] Task id: 7 , duration: 2 , predecessors: [4] Task id: 8 , duration: 4 , predecessors: [4] Task id: 9 , duration: 3 , predecessors: [2] Task id: 10 , duration: 4 , predecessors: \\( [5,6] \\) Task id: 11, duration: 1, predecessors: \\( [7,8] \\) Task id: 12 , duration: 4 , predecessors: \\( [9,10] \\) Task id: 13, duration: 2 , predecessors: \\( [6,11] \\) Task id: 14, duration: 1 , predecessors: \\( [12,13] \\) vse ule critucal path metrod to answer tnese questions.