Pages that link to "Item:Q4268892"
From MaRDI portal
The following pages link to Better Bounds for Online Scheduling (Q4268892):
Displaying 20 items.
- Utilization of nonclairvoyant online schedules (Q2508980) (← links)
- Semi-online scheduling jobs with tightly-grouped processing times on three identical machines (Q2565855) (← links)
- A semi-on-line scheduling problem of two parallel machines with common maintenance time (Q2920365) (← links)
- Online minimum makespan scheduling with a buffer (Q2929632) (← links)
- Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures (Q3186540) (← links)
- Improved Upper Bounds on the Competitive Ratio for Online Realtime Scheduling (Q3527235) (← links)
- Tight Bounds for Online Vector Scheduling (Q4620410) (← links)
- On Approximation Algorithms for Two-Stage Scheduling Problems (Q4632219) (← links)
- (Q5009506) (← links)
- Online Makespan Scheduling with Job Migration on Uniform Machines (Q5009583) (← links)
- Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines (Q5169463) (← links)
- Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming (Q5245846) (← links)
- On-line algorithms for packing rectangles into several strips (Q5439071) (← links)
- Streaming algorithms for bin packing and vector scheduling (Q5919096) (← links)
- Randomized on-line scheduling on two uniform machines (Q5937432) (← links)
- Preemptive multiprocessor scheduling with rejection (Q5958131) (← links)
- Algorithms for single machine scheduling problem with release dates and submodular penalties (Q6039534) (← links)
- Parallel solutions for preemptive makespan scheduling on two identical machines (Q6102847) (← links)
- Machine covering in the random-order model (Q6103518) (← links)
- Online cardinality constrained scheduling (Q6556169) (← links)
