Pages that link to "Item:Q3110610"
From MaRDI portal
The following pages link to One scheduling problem with rejection (Q3110610):
Displaying 5 items.
- Minimizing maximum delivery completion time for order scheduling with rejection (Q830938) (← links)
- A general scheme for solving a large set of scheduling problems with rejection in FPT time (Q2142679) (← links)
- A greedy heuristic for solving scheduling problems with bounded rejection cost (Q2147117) (← links)
- A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling (Q2168763) (← links)
- Scheduling with partial rejection (Q2661510) (← links)