- There are
njobs each consisting of two parts:
- There are two people:
Ais completing part
aof each job (one at a time), and
Bis completing part
bof each job (also one at a time).
- Constraint: part
aof each job must be completed before part
- We are given for each
a[i]: the time that it takes to complete part
The problem is to find an algorithm to determine
- an order such that the total time to complete all jobs is minimized.
B are able to work in parallel.
My question is: how can we solve this problem? And, what is a good reference to learn to solve similar scheduling problems?