Pages that link to "Item:Q4606335"
From MaRDI portal
The following pages link to Online Non-preemptive Scheduling in a Resource Augmentation Model based on Duality (Q4606335):
Displaying 12 items.
- Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence (Q2165267) (← links)
- Dual representation and its online scheduling method for event-varying DESs with capacity constraints (Q3542998) (← links)
- Simple paths with exact and forbidden lengths (Q4562938) (← links)
- Non-Preemptive Flow-Time Minimization via Rejections (Q5002748) (← links)
- Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines (Q5009625) (← links)
- An Optimal Control Framework for Online Job Scheduling with General Cost Functions (Q5058033) (← links)
- Game efficiency through linear programming duality (Q5090446) (← links)
- Approximating \(k\)-forest with resource augmentation: a primal-dual approach (Q5919564) (← links)
- An on-line \textit{seru} scheduling algorithm with proactive waiting considering resource conflicts (Q6112585) (← links)
- Minimizing the maximum flow time in the online food delivery problem (Q6130315) (← links)
- A best possible online algorithm for minimizing the total completion time and the total soft penalty cost (Q6181379) (← links)
- Two-Agent Scheduling with Resource Augmentation on Multiple Machines (Q6487363) (← links)