Combining tasks in groups according to their priorities, readiness and deadlines

Pavlov A.A., Misiura E.B., Lisiecki T.N.

We consider the one machine scheduling problem of minimizing the total earliness and tardiness of independent tasks against due dates (ET) with setups. We propose a heuristic algorithm to search a local optimal solution of the problem. Experimental studies have shown the effectiveness of the algorithm, which allows to solve large dimensional problems for a short time.


Full text (pdf)