Scribd Logo
Upload

Welcome to Scribd!

  • Question 3

    Uploaded by

    Ayanda Hintsa
    6 views4 pages
    The document describes a scheduling problem with 8 tasks (A-H) that need to be assigned to 4 stations. It provides the following information: 1) Task dependencies and the number of following tasks for each task. 2) The station each task can be assigned to. 3) The processing time for each task. 4) A table that schedules the tasks by finding the task with the most remaining followers, longest processing time, or if none remains, the task with the most followers.

    Original Description:

    Question 3

    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 describes a scheduling problem with 8 tasks (A-H) that need to be assigned to 4 stations. It provides the following information: 1) Task dependencies and the number of following tasks for each task. 2) The station each task can be assigned to. 3) The processing time for each task. 4) A table that schedules the tasks by finding the task with the most remaining followers, longest processing time, or if none remains, the task with the most followers.

    Copyright:

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

    Question 3

    Uploaded by

    Ayanda Hintsa
    The document describes a scheduling problem with 8 tasks (A-H) that need to be assigned to 4 stations. It provides the following information: 1) Task dependencies and the number of following tasks for each task. 2) The station each task can be assigned to. 3) The processing time for each task. 4) A table that schedules the tasks by finding the task with the most remaining followers, longest processing time, or if none remains, the task with the most followers.

    Copyright:

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

    10 sec.

    20 sec. 35 sec.

    D
    B
    40 sec. E
    35 sec A

    30 sec
    C 20 sec.
    10 sec.
    Number of
    Number of
    Tasks Station Task Following
    Following Tasks Tasks
    A 7 Station 1 A 7
    B 4 B 4
    C, D or E 2 Station 2 E 2
    F or G 1 D 2
    H 0 Station 3 C 2
    F 1
    Station 4 G 1
    H 0

    Longest Task
    Task Time
    E 40
    A 35
    F 35
    C 30
    B 20
    G 20
    D 10
    H 10
    Feasible
    Task Time Remaining Unassigned Task With Task With Longest
    Remaining
    (in seconds) Time (Seconds) Most Folowers Operating Time
    Tasks
    35 30 B
    20 10 None
    40 25 C, D or E C, D or E E
    10 15 None
    30 35 F or G F or G F
    35 0 None
    20 45 H
    10 35 None

    You might also like