Pages that link to "Item:Q4706228"

The following pages link to Improved Bounds for the Online Scheduling Problem (Q4706228):

Displayed 36 items.

• An on-line scheduling problem of parallel machines with common maintenance time (Q394448) ‎ (← links)
• Semi-online scheduling problems on a small number of machines (Q398877) ‎ (← links)
• New upper and lower bounds for online scheduling with machine cost (Q429648) ‎ (← links)
• Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs (Q436585) ‎ (← links)
• Semi-online scheduling revisited (Q442235) ‎ (← links)
• Online algorithms with advice for bin packing and scheduling problems (Q496020) ‎ (← links)
• Online scheduling with rearrangement on two related machines (Q627161) ‎ (← links)
• Scheduling unit length jobs on parallel machines with lookahead information (Q657255) ‎ (← links)
• On the optimality of list scheduling for online uniform machines scheduling (Q694192) ‎ (← links)
• Improved bounds for online scheduling with eligibility constraints (Q719259) ‎ (← links)
• List's worst-average-case or WAC ratio (Q835596) ‎ (← links)
• Online parallel machines scheduling with two hierarchies (Q837151) ‎ (← links)
• Online scheduling with reassignment (Q935241) ‎ (← links)
• Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead (Q1034639) ‎ (← links)
• A survey on makespan minimization in semi-online environments (Q1617278) ‎ (← links)
• Improved lower bounds for online scheduling to minimize total stretch (Q1680548) ‎ (← links)
• Online scheduling of two job types on a set of multipurpose machines with unit processing times (Q1761990) ‎ (← links)
• Pseudo lower bounds for online parallel machine scheduling (Q1785411) ‎ (← links)
• Offline file assignments for online load balancing (Q1944067) ‎ (← links)
• Scheduling In the random-order model (Q1979454) ‎ (← links)
• Online makespan scheduling with job migration on uniform machines (Q2067667) ‎ (← links)
• Online load balancing with general reassignment cost (Q2157902) ‎ (← links)
• Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing (Q2168774) ‎ (← links)
• Online makespan minimization with parallel schedules (Q2362356) ‎ (← links)
• Improved lower bounds for the online bin stretching problem (Q2399609) ‎ (← links)
• On the value of job migration in online makespan minimization (Q2408930) ‎ (← 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)
• ONLINE ALGORITHMS FOR SCHEDULING WITH MACHINE ACTIVATION COST (Q3439890) ‎ (← links)
• Simultaneously load balancing for every p-norm, with reassignments (Q4638106) ‎ (← links)
• (Q5009506) ‎ (← links)
• Online Makespan Scheduling with Job Migration on Uniform Machines (Q5009583) ‎ (← links)
• Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming (Q5245846) ‎ (← links)
• Parallel solutions for preemptive makespan scheduling on two identical machines (Q6102847) ‎ (← links)
• Improved approximation algorithms for multiprocessor scheduling with testing (Q6113912) ‎ (← links)