The following pages link to (Q3206646):
Displaying 4 items.
- Minimizing the number of late jobs on unrelated machines (Q811339) (← links)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem (Q1771351) (← links)
- Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs (Q2304114) (← links)
