Question: Give an explanation in psuedo code, not actual code Given a gas station with two pumps, and a collection of cars 1, 2, ..., n

Give an explanation in psuedo code, not actual code
Given a gas station with two pumps, and a collection of cars 1, 2, ..., n with filling time is for item i (on both pumps). Find a schedule that assigns cars to the two pumps, so that if the first pump is assigned a sum of tl and the second a sum of t2, max {t1, t2} is minimum. Note that you only have to decide which car is assigned to pump 1 and which to pump 2, because the order will not change the sum
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
