human
Assembly Line Scheduling | DP | Python program to find minimum possible time by the car chassis to complete.
time taken to leave.
first station in line 1 time taken to leave.
Fill tables T1 [ ] and T2 [ ] using above given recursive relations.
consider exit times and return minimum.
Driver code"
How can the above be solved in Python?
assistant
#Here is code to assembly Line Scheduling and the other steps required.
 def carAssembly ( a , t , e , x ) :
	NUM_STATION = len ( a [ 0 ] )
	T1 = [ 0 for i in range ( NUM_STATION ) ]
	T2 = [ 0 for i in range ( NUM_STATION ) ]
T1 [ 0 ] = e [ 0 ] + a [ 0 ] [ 0 ]
T2 [ 0 ] = e [ 1 ] + a [ 1 ] [ 0 ]
	for i in range ( 1 , NUM_STATION ) :
		T1 [ i ] = min ( T1 [ i - 1 ] + a [ 0 ] [ i ] , T2 [ i - 1 ] + t [ 1 ] [ i ] + a [ 0 ] [ i ] )
		T2 [ i ] = min ( T2 [ i - 1 ] + a [ 1 ] [ i ] , T1 [ i - 1 ] + t [ 0 ] [ i ] + a [ 1 ] [ i ] )
	return min ( T1 [ NUM_STATION - 1 ] + x [ 0 ] , T2 [ NUM_STATION - 1 ] + x [ 1 ] )
a = [ [ 4 , 5 , 3 , 2 ] , [ 2 , 10 , 1 , 4 ] ]
t = [ [ 0 , 7 , 4 , 5 ] , [ 0 , 9 , 2 , 8 ] ]
e = [ 10 , 12 ]
x = [ 18 , 7 ]
print ( carAssembly ( a , t , e , x ) )