Pages that link to "Item:Q817020"
From MaRDI portal
The following pages link to Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines (Q817020):
Displaying 20 items.
- Semi-online scheduling on two identical machines with rejection (Q385491) (← links)
- Preemptive online scheduling with rejection of unit jobs on two uniformly related machines (Q398903) (← links)
- Optimal semi-online algorithm for scheduling with rejection on two uniform machines (Q411229) (← links)
- Online scheduling with rejection and reordering: exact algorithms for unit size jobs (Q489737) (← links)
- Semi-online scheduling on two uniform machines with the known largest size (Q491206) (← links)
- Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling (Q491212) (← links)
- Online scheduling with rejection and withdrawal (Q650898) (← links)
- Online scheduling of unit jobs on three machines with rejection: a tight result (Q903197) (← links)
- Preemptive on-line scheduling for two uniform processors (Q1306385) (← links)
- On-line uniform machine scheduling with rejection (Q1583671) (← links)
- Graph multi-coloring for a job scheduling application (Q1686066) (← links)
- Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions (Q1698296) (← links)
- Applying ``peeling onion'' approach for competitive analysis in online scheduling with rejection (Q2029304) (← links)
- Scheduling with machine cost and rejection (Q2385470) (← links)
- Semi-online scheduling on two uniform processors (Q2481966) (← links)
- Scheduling with partial rejection (Q2661510) (← links)
- Semi on-line preemptive scheduling on two uniform machines with rejection (Q3017066) (← links)
- (Q3180325) (← links)
- Uniform machine scheduling with arrival time and rejection (Q5282517) (← links)
- TWO-MACHINE FLOW SHOP SCHEDULING WITH INDIVIDUAL OPERATION'S REJECTION (Q5411726) (← links)
