Pages that link to "Item:Q1031971"
From MaRDI portal
The following pages link to On-line scheduling of unit time jobs with rejection on uniform machines (Q1031971):
Displaying 12 items.
- Preemptive online scheduling with rejection of unit jobs on two uniformly related machines (Q398903) (← links)
- Online scheduling with rejection and reordering: exact algorithms for unit size jobs (Q489737) (← links)
- On-line scheduling with rejection on identical parallel machines (Q882532) (← links)
- Online scheduling of unit jobs on three machines with rejection: a tight result (Q903197) (← links)
- On-line uniform machine scheduling with rejection (Q1583671) (← links)
- On-line scheduling of unit time jobs with rejection: Minimizing the total completion time (Q1870022) (← links)
- Applying ``peeling onion'' approach for competitive analysis in online scheduling with rejection (Q2029304) (← links)
- Scheduling with rejection and non-identical job arrivals (Q2425836) (← links)
- Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost (Q2444843) (← links)
- Parameter Learning Online Algorithm for Multiprocessor Scheduling with Rejection (Q3551105) (← links)
- A Semi-Online Algorithm for Single Machine Scheduling with Rejection (Q5024475) (← links)
- Uniform machine scheduling with arrival time and rejection (Q5282517) (← links)