Pages that link to "Item:Q1777224"
From MaRDI portal
The following pages link to Preemptive online algorithms for scheduling with machine cost (Q1777224):
Displaying 12 items.
- The generalization of scheduling with machine cost (Q392182) (← links)
- New upper and lower bounds for online scheduling with machine cost (Q429648) (← links)
- Uniform parallel machine scheduling problems with fixed machine cost (Q683926) (← links)
- Batching deteriorating items with applications in computer communication and reverse logistics (Q884021) (← links)
- Online algorithms for scheduling with machine activation cost on two uniform machines (Q886402) (← links)
- Online scheduling with general machine cost functions (Q1026108) (← links)
- An optimal online algorithm for scheduling with general machine cost functions (Q2173052) (← links)
- Scheduling games on uniform machines with activation cost (Q2344765) (← links)
- Scheduling with machine cost and rejection (Q2385470) (← links)
- Online scheduling with machine cost and rejection (Q2462392) (← links)
- Competitive ratios for preemptive and non-preemptive online scheduling with nondecreasing concave machine cost (Q2629987) (← links)
- ONLINE ALGORITHMS FOR SCHEDULING WITH MACHINE ACTIVATION COST (Q3439890) (← links)
