有两条装配线，编号分别为1和2。每一条装配线上有个n装配点，将第i条线上的第个j装配点记为Si,j，设在装配点Si,j的装配时间为Ai,j。假设要装配一辆汽车，将汽车底盘从进厂点送入第i号装配线，需要时间Ei。在装配点Si,j装配后，如果汽车传送到同一号装配线的装配点Si,j+1进行装配，则传送不需要时间。如果汽车完成装配点Si,j的工作后传送到另一号装配线进行下一步的工作，则需要传送时间Ti,j。汽车在装配点Si,n装配后，将汽车成品从装配线上退下来，需要花费时间Xi。装配线调度问题是如何确定每一个装配点的装配需要在哪号线上进行，使得当汽车成品出来时，花费的总时间最少。-Today TheBeet go to the door in what the Shandong pancake stalls to buy pancake to his pay when he discovered that his wallet contained only a 100. So he needs to break this 100 money to open, but TheBeet do not like coins, another for some reason, TheBeet do not like 20 yuan notes, while inside there are too many do not like a banknote wallet, so he hopes to get minimize the number of notes. Given the number of stall holders of existing notes, seeking to spread primarily through irregular TheBeet how to meet his request.