Describir: Polynomial Algorithm for Constructing Pareto-Optimal Schedules for Problem 1∣<em>r</em><sub>j</sub>∣<em>L</em><sub>max</sub>,<em>C</em><sub>max</sub>