A manufacturing shop processes sheet metal jobs, wherein each job must pass through two machines (M1 and M2, in that order). The processing time (in hours) for these jobs is give in the table:

The optimal make-span (in hours) of the shop is

Keep practicing — related questions

• interface Base { boolean m1 (); byte m2(short s); } which two code fragments will compile? interface Base2 ...
• A string over a smooth massless pulley connects two blocks of masses m1 & m2 (vertically). If the accelerat...
• Consider the following: (1) Metal (2) Water (3) Air (4) Vacuum Which of the following is the correct ascend...
• Which of the above two statements define the equals and hashcode contract in JAVA? Statement -1 If two obje...
• What is the resource management problem where a process does not get the resources it needs for a long time...
• Why, according to the passage, forms must keep changing from time to time? Directions: Answer the given que...
• Can a chameleon move its eyes in two different directions at the same time?
• How does metallic character change down a group in the modern periodic table?