/// <summary>
/// The solver that uses a greedy strategy to select the lowest available activity
/// when multiple jobs are available to work, but only a limited number of resources
/// are available. Does not currently produce an optimized schedule.
/// </summary>
public GreedyActivityScheduleSolver(IProjectDataSetValidationService validationService)
: base(NameString, DescriptionString, validationService)
{
}
/// <summary>
/// The solver that uses a greedy strategy to select the lowest available activity
/// when multiple jobs are available to work, but only a limited number of resources
/// are available. Does not currently produce an optimized schedule.
/// </summary>
public GreedyActivityScheduleSolver(IProjectDataSetValidationService validationService)
: base(NameString, DescriptionString, validationService)
{
}
