Scheduling problem (1/rj): multiple tasks on single machine, with different release and due dates. Multiple objective functions are considered.

Solution methods: greedy heuristic and Tabu Search. Alternatively, user may input solution and program calculates all objective function values.