Chapter 6, Problem 5

What is the calculated cycle time?

		1.2
		2
		3.4
		4.6 Chapter 6, problem 5 What is the theoretical minimum number of stations needed?

6. Twelve tasks, with times and precedence requirements as shown in the following table, are to be assigned to workstations using a cycle time of 1.5 minutes. Two heuristic rules will be tried: (1) greatest positional weight, and (2) most following tasks. In each case, the tiebreaker will be the shortest processing time. Length Immediate Task (minutes) Predecessor a 0.1 b 0.2 a 0.9 b d 0.6 e 0.1 f 0.2 d, e g 0.4 f h 0.1 g i 0.2 h j 0.7 i k 0.3 j 1 0.2 k 6. Twelve tasks, with times and precedence requirements as shown in the following table, are to be assigned to workstations using a cycle time of 1.5 minutes. Two heuristic rules will be tried: (1) greatest positional weight, and (2) most following tasks. In each case, the tiebreaker will be the shortest processing time. Length Immediate Task (minutes) Predecessor a 0.1 b 0.2 a 0.9 b d 0.6 e 0.1 f 0.2 d, e g 0.4 f h 0.1 g i 0.2 h j 0.7 i k 0.3 j 1 0.2 k