In this investigation the problem of scheduling with setup times of families is considered where the tasks in each family are performed together. The setup is sequence-independent are required for the task from another family. The goal is to minimize the total earliness and tardiness. Proposed heuristic algorithms are empirically evaluated in terms of their effectiveness. The result show that they generate solutions that are sufficiently close to optimal.
When you are citing the document, use the following link http://essuir.sumdu.edu.ua/handle/123456789/2877
