# Comand Line to compile:
g++ -O3 Instance.h Main.cpp -o BJer.out

# Batch Model
The first line is the number of instances that will be executed
The next lines will be on the format "alpha beta ksi instance_adress"
Example:
3
0.50 0.50 0.50 Instancias/YFJS01.txt
0.25 0.75 0.00 Instancias/DAFJS01.txt
0.33 0.33 0.33 Instancias/DAFJS15.txt

This will execute the instances YFJS01, DAFJS01 and DAFJS15 with alpha 
beta and ksi parameters as 0.50 0.50 and 0.50, 0.25 0.75 and 0.00 and 
0.33 0.33 0.33 respectively.

# The fresh code that you are getting will execute the beam search code. 
To execute the List Scheduling algorithm go to the Main function in the 
Main.cpp file and comment the line 1276 
"BeamSearchReturn r = beamSearchIni(instance.m, instance.o, instance.F, instance.p, instance.S, instance.P, alfa, beta, ksi);" 
and uncomment the line 1275 
"ListSchedulingReturn r = listScheduling(instance.m, instance.o, instance.F, instance.p, instance.S, instance.P);". 
After this, recompile the code using the same command described at the 
beginning of this readme. The batch stay the same. The code will ignore 
the parameters alpha beta and ksi to execute the List Scheduling 
algorithm.

# The solutions files will be created at the folder "FilesResults" on 
the format "InstanceName_alphaValue_betaValue_ksiValue.txt". Inside 
the solution files, the first line is the number of instance operations, 
the second line are the machines that each operation will be processed. 
The third line are the start time of each operation's process and the
fourth and last line are the processing time of each operation on the
designed machine.

Enjoy =)