Description: Assembly line scheduling problem
The first line of a number of N (2 <= N <= 100), on behalf of the wiring on the switch to the number of assembly stations
N number of second line, followed by representatives of the assembly line 1, k-time station assembly products.
N the number of the third line, followed by the representative assembly of the first k-2 products, the time required for the assembly stations.
The fourth line four the number of I1 I2 O1 O2 (1 <= I1, I2, O2, O2 <= 100), representatives to the assembly line 1, 2 and exit
Switch wiring 1, 2, spent time.
N-1 fifth line number, followed by representatives from the assembly line 1, k-2 stations to switch to wiring the first time k+1 station.
Sixth line number N-1, followed by representatives from the assembly line 2, k-1 stations to switch to wiring the first time k+1 station.
Output:
A total of two lines
The first line, T, on behalf of exit from the product into the total time req
- [assgin02] - This program addresses the following iss
File list (Check if you may need any files):
juangpeixian.txt
Download