Pages that link to "Item:Q1951910"

The following pages link to The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine (Q1951910):

Displayed 5 items.

• Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one (Q1761818) ‎ (← links)
• A metric approach for scheduling problems with minimizing the maximum penalty (Q2245804) ‎ (← links)
• Scheduling a single machine with primary and secondary objectives (Q2331605) ‎ (← links)
• Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan (Q2361139) ‎ (← links)
• Polynomially solvable subcases for the approximate solution of multi-machine scheduling problems (Q6130890) ‎ (← links)