The following pages link to On-line scheduling revisited (Q1592757):
Displaying 13 items.
- Semi-online scheduling jobs with tightly-grouped processing times on three identical machines (Q2565855) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- ONLINE MINIMUM MAKESPAN SCHEDULING WITH A BUFFER (Q2929632) (← links)
- WORST-CASE PERFORMANCE EVALUATION ON MULTIPROCESSOR TASK SCHEDULING WITH RESOURCE AUGMENTATION (Q3016228) (← links)
- Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures (Q3186540) (← links)
- ONLINE ALGORITHMS FOR SCHEDULING WITH MACHINE ACTIVATION COST (Q3439890) (← 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)
- Streaming algorithms for bin packing and vector scheduling (Q5919096) (← 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)
