Pages that link to "Item:Q882532"
From MaRDI portal
The following pages link to On-line scheduling with rejection on identical parallel machines (Q882532):
Displaying 13 items.
- Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines (Q290334) (← links)
- Permutation flow shop scheduling with order acceptance and weighted tardiness (Q419558) (← links)
- Online scheduling with rejection and reordering: exact algorithms for unit size jobs (Q489737) (← links)
- Online scheduling of unit jobs on three machines with rejection: a tight result (Q903197) (← links)
- On-line scheduling of unit time jobs with rejection on uniform machines (Q1031971) (← links)
- On-line uniform machine scheduling with rejection (Q1583671) (← links)
- Scheduling on parallel identical machines with late work criterion: offline and online cases (Q1702733) (← 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)
- (Q3180325) (← links)
- A Semi-Online Algorithm for Single Machine Scheduling with Rejection (Q5024475) (← links)
- Parallel machine scheduling with service hierarchy and rejection (Q5282528) (← links)