Abstract:
We consider the problem of minimizing the total service time of different jobs from one device preemption. We describe three linear integer programming models for the problem. Comparative study of the models and a simulation experiment are also described. Tab. 1, ill. 6, bibliogr. 7.