Pages that link to "Item:Q2242051"
From MaRDI portal
The following pages link to Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms (Q2242051):
Displaying 5 items.
- Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
- Parallel machine selection and job scheduling to minimize machine cost and job tardiness (Q2387248) (← links)
- Exponential neighborhood search for a parallel machine scheduling problem (Q2459402) (← links)
- Scheduling two classes of exponential jobs on parallel processors: structural results and worst-case analysis (Q3981884) (← links)
- Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time (Q4661237) (← links)