Once we have represented the issues of the problem in those ways, the following code is sufficient to generate a solution that minimizes the given criterion.

    IloNumVar criterion = ((minimizeMax) ? maxCriterion : sumCriterion);  
    model.add(IloMinimize(env, criterion));
    
    IloSolver solver(model);
    IloGoal goal = IloAssignAlternative(env) &&
      IloSetTimesForward(env,
                         criterion,
                         IloSelFirstActMinEndMin);
    
    if (solver.solve(goal)) {
      IlcInt maxCrit = solver.getIntVar(maxCriterion).getMin();
      IlcInt sumCrit = solver.getIntVar(sumCriterion).getMin();
      PrintSolution(solver, maxCrit, sumCrit);
#if defined(ILO_SDXLOUTPUT)
      IloSDXLOutput output(env);
      ofstream outFile("cassign.xml");
      output.write(IlcScheduler(solver), outFile);
      outFile.close();
#endif
    } else
      solver.out() << "No solution!" << endl;
    solver.printInformation();
    env.end();
  } catch (IloException& exc) {
    cout << exc << endl;
  }
  
  return 0;