asl | Python Fiddle

def print_assembly(l,n,L):
    if n == 0:
        return
    else:
        print_assembly(l,n-1,l[L][n-1])
        print "Line %d Station %d" % (L,n)

n = raw_input("Enter Number of stations:")

print "Enter the entry time for each line"

e = []
a = []
t = []
x = []
f = []
l = []
t.append(None)

for i in range(2):
    e.append(raw_input("Line " + str(i+1) + ": "))
    
print "Enter the assembly time of " + n + " stations in each line"

n = int(n)
for i in range(2):
    ta = []
    print "Station "+str(i+1)
    for j in range(n):
        ta.append(raw_input("Line " + str(j+1) + ": "))
    a.append(ta)

print "Enter the transfer times: "
k=[]
for i in range(n-1):
    k.append(raw_input("From Line 1 Station " + str(i+1) + " to Line 2 Station " + str(i+2)))
    t.append(k)
k=[]
for i in range(n-1):
    k.append(raw_input("From Line 1 Station " + str(i+1) + " to Line 2 Station " + str(i+2)))
    t.append(k)
    
print "Enter the exit times of two lines: "

for i in range(2):
    x.append(raw_input("Line "+str(i)))

for i in range(n):
    fi = []
    f.append(fi)

f[1].append(e[0] + a[1][0])
f[2].append(e[1] + a[2][0])

for j in range(1,n-1):
    if (f[1][j-1]+a[1][j])<(f[2][j-1]+t[1][j-1]+a[1][j]):
        f[1].append(f[1][j-1]+a[1][j])
        l[1].append(1)
    else:
        f[1].append(f[2][j-1]+t[1][j-1]+a[1][j])
        l[1].append(2)
        
    if (f[2][j-1]+a[2][j])<(f[1][j-1]+t[0][j-1]+a[2][j]):
        f[2].append(f[2][j-1]+a[2][j])
        l[2].append(2)
    else:
        f[2].append(f[1][j-1]+t[0][j-1]+a[2][j])
        l[2].append(1)
        
if f[1][n-1] + x[1] < f[2][n-1] + x[2]:
    F = f[1][n-1] + x[0]
    L = 1
else:
    F = f[2][n-1] + x[1]
    L = 2
    
print "Optimal Cost: " + str(F)
print "Order of assembly:\n"

print_assembly(l,n,L)

Python Fiddle

Python Cloud IDE