I was hoping I could get some help on how to correctly interpret a hasse diagram for a job scheduling problem.
The following is the Hasse Diagram I am referring to: Hasse Diagram
Is it correct for me to say that task BW cannot be started until tasks FP and GC are completed?
Or do the lines connecting FP to BW and GC to BW simply imply that they are just related to one another (ie. can only start task BW once task FP is complete OR once task GC is complete?)
I am studying for a final exam I have tomorrow and would really appreciate some help and clarification about this. Thanks in advance, really hope to hear from someone soon!
UPDATE: I am adding an image of all the information that is provided in the problem.
Here it is: Information provided in the problem/question
