Pages that link to "Item:Q2398650"
From MaRDI portal
The following pages link to Unary NP-hardness of minimizing the number of tardy jobs with deadlines (Q2398650):
Displayed 11 items.
- A note on competing-agent Pareto-scheduling (Q1996756) (← links)
- Single-machine scheduling with positional due indices and positional deadlines (Q2010931) (← links)
- Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost (Q2144217) (← links)
- Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices (Q2190797) (← links)
- Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines (Q2231743) (← links)
- Scheduling to tradeoff between the number and the length of accepted jobs (Q2235744) (← links)
- ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost (Q2284315) (← links)
- Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines (Q2286436) (← links)
- Parallel Machine Scheduling with Due Date-to-Deadline Window, Order Sharing and Time Value of Money (Q5865924) (← links)
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work (Q6077487) (← links)
- Single-machine scheduling of multiple projects with controllable processing times (Q6167669) (← links)
