Pages that link to "Item:Q2464405"
From MaRDI portal
The following pages link to A stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs (Q2464405):
Displaying 4 items.
- Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time (Q933504) (← links)
- A survey of scheduling problems with setup times or costs (Q2467249) (← links)
- Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds (Q2845031) (← links)
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work (Q6077487) (← links)