1. A job in a machine shop must undergo five operationsA, B, C, D, and E. Each operation can be performed on either of two machines. The following table summarizes the time required for each machine to perform each operation:

	A	B	C	D	E
Machine 1	7	8	4	4	9
Machine 2	5	3	9	6	8

Formulate a model that can be solved to determine the job routing that minimizes the maximum amount of time used on either machine. That is, ifis the total time used on machinei, find the solution that minimizes the maximum of t1 andt2.