• Draw the order-requirement digraph.
• Create a schedule for the job on two processors (humans) using the decreasing-time-list algorithm. Assume they are already in order. The first task (open box) is just one person while the other is idle after that task the rest can be divided for the optimal time.
• Determine the earliest time by which all these tasks can be completed.
• Suppose you must put together 10 in a day's shift of 8 hours. Will this be possible? Explain why or why not.

Tasks	Description	Time
Task 1	Remove parts from the box	10
Task 2	Attach wheels to the footboard	20
Task 3	Attach vertical housing to the footboard	5
Task 4	Attach handlebars to the vertical housing	5
Task 5	Put on reflector tape	10
Task 6	Attach a bell to handlebars	5
Task 7	Attach decals	10
Task 8	Attach kickstand	5
Task 9	Attach safety instructions to handlebars	5