Examine the linear schedule with sequential activities A, B, and C as shown in the figure. Assume that B and C can be interrupted at integer work or time units and that any segments of activities must always keep a buffer of at least 1 day between them to answer these questions:

a. Can deliberate interruptions within activities of a linear schedule help in minimizing its total project duration? If so, why; if not, why not?

b. Which activities should be interrupted? At what work unit? By what break? Does one unique solution exist? What is the minimum project duration?

c. Derive a heuristic (i.e., a simple guideline that works well in most cases) to determine quickly which activity should be interrupted and where.

d. Express in a formula how many interruptions are theoretically maximally possible for a linear schedule with m activities and n work units.

87 6 5 4 3 2 1 Time C 1 2 3 4 5 6 B A Work