Scheduling with time windows and solution set restriction

In the paper special assignment problems are considered. Using a goal controlled deep search or branch and bound algorithm for the construction of the assignment tree, the number of solutions to be calculated and the number of efficient solutions of the assignment problem depend on the following facts:the choosen combination of weights in the preference function (to control the branching sequence),the interactive decisions if the number of solution exceeds a given bound (changing the parameters for automatically reducing of the solution set),the interactive modelling (see chapter 6) (changing constraints, goals, evaluation functions). The ideas discussed here for small scheduling problems are useful for other assignment problems mentioned above in case of multicriteria optimization, too. A knowledge based support for the 3 given decision problems influencing the assignment tree will be important for an effective use of such systems.