This folder contains the results of both datasets. 

******************************************
Dataset1:
******************************************
Update after review: the objective function of the model is updated and now is defined as the expected utility work per piece produced. The results presented for Dataset1 are solved for the expected utility work per sequence. The new objective value can be calculated by dividing the old objective function by the number of products (10 in all cases).

The results are separated based on the limit solution time of 3600 and 14400 seconds.

Excel files "Results_3600.xlsx" and "Results_14400.xlsx" constain the information on solutions, solution time, cuts, and nodes for every instance.

The folders "Results for 3600 seconds" and "Results for 14400 seconds" contains the solution and log files of every instance.
The results are further classified based on the algorithm used. 
Mono: refers to the monolithic model
A_B_C_D refers to the features of the Combinatorial Benders Decomposition. Y represents a 'yes' or enabled and N represents a 'no' or disabled.
The features or organized in order A_B_C_D, in which
A refers to the LP-based cuts.
B refers to the Idle time cuts.
C refers to the Preprocessing.
D refers to the Partial cuts.
_______________________________________________
Structure of the Solution files:
Name: Sol_ + instance name

The contents of the solution file is detailed here. The text or elements of the file is noted between quotation marks.

Introdutory text with instance name and parameters:
"## Balancing of Stochastic Paced Assembly Lines ## 
Solution Log of Instance "INSTANCE NAME"
Parameters: #Tasks XX #Stations YY #Scenarios ZZ"

Report on solution time, upper bound on the solution value and lower bound:
"Solution Time: XXX of YYY seconds (limit)
Solution Value Q: AAA, Bound: BBB"

The solution is given by the assigned station to each task:

"Feasible balancing answer (station of every task): 
1 4 3 ..."

The resulting processing times per model and station is given in a matrix form:
"Processing times in each station (odered by model (lines) and station(columns)):
x x x
y y y ...
..."
_______________________________________________
Structure of the log files:
Name: Log_ + instance name

The log instances contains the description of all feasible node found by the master problem and the results of the cuts of the subproblems. 

"Log from instance INSTANCE NAME
Node No.	MasterZ	0s	1s	2s	3s	Int	Time"

After printing the instance name, each printed line refers to a found feasible solution of the master problem.
The information given (per column) is:
Node No.: Node number (ordered by the feasible solutions of the master problem).
MasterZ: Approximation of the objective function value on the master problem.
0s: Utility work calculated by the LP-Based cut.
1s: Utility work necessary for the sequencing of every station individually (Partial subproblem L1).
2s: Utility work necessary for the sequencing of every 2 stations individually (Partial subproblem L2).
3s: Utility work necessary for the sequencing of every 3 stations individually (Partial subproblem L3).
Int: Utility work necessary for the sequencing of all complete subproblems (considers all stations).
Time: The point in time in which the node was found.
