Name Initial Accelerated Activity Successor Time Cost Time Extra B $2 S3 $3 BE D G H F G H None S5 $6 2 wk 3 wk 3 wk 2 wk 2 wk 2 wk Same I wk 2 wk I wk $2 $2 $2 $3 $2 $2 None $3 Same I wk 2 wk 1 wk G H 3 wk 2 wk S2 $3 10.3 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 seg- ments of activities must always keep a buffer of at least 1 day between them to answer these questions: Time 00 7 6 B 5 A 4 3 2 1 Vork 1 2 3 4 5 6 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 theo- retically maximally possible for a linear schedule with m activities and n work units. Name Initial Accelerated Activity Successor Time Cost Time Extra B $2 S3 $3 BE D G H F G H None S5 $6 2 wk 3 wk 3 wk 2 wk 2 wk 2 wk Same I wk 2 wk I wk $2 $2 $2 $3 $2 $2 None $3 Same I wk 2 wk 1 wk G H 3 wk 2 wk S2 $3 10.3 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 seg- ments of activities must always keep a buffer of at least 1 day between them to answer these questions: Time 00 7 6 B 5 A 4 3 2 1 Vork 1 2 3 4 5 6 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 theo- retically maximally possible for a linear schedule with m activities and n work units