Pages that link to "Item:Q4032943"

The following pages link to An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling (Q4032943):

Displaying 44 items.

• A lower bound for randomized on-line multiprocessor scheduling (Q287130) (← links)
• Semi-online scheduling problems on a small number of machines (Q398877) (← links)
• Lower bounds for online makespan minimization on a small number of related machines (Q398887) (← links)
• Semi-online scheduling revisited (Q442235) (← links)
• The \(k\)-server problem (Q458484) (← links)
• Online scheduling with rejection and reordering: exact algorithms for unit size jobs (Q489737) (← links)
• Online scheduling with rejection and withdrawal (Q650898) (← links)
• Scheduling unit length jobs on parallel machines with lookahead information (Q657255) (← links)
• Improved bounds for online scheduling with eligibility constraints (Q719259) (← links)
• Scheduling with testing on multiple identical parallel machines (Q832831) (← links)
• Online makespan minimization with budgeted uncertainty (Q832833) (← links)
• List's worst-average-case or WAC ratio (Q835596) (← links)
• Scheduling web advertisements: a note on the minspace problem (Q880489) (← links)
• Semi on-line algorithms for the partition problem (Q1267197) (← links)
• A new on-line scheduling heuristic (Q1319539) (← links)
• The optimal on-line parallel machine scheduling (Q1568731) (← links)
• On-line scheduling revisited (Q1592757) (← links)
• A survey on makespan minimization in semi-online environments (Q1617278) (← 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)
• Optimal preemptive semi-online scheduling to minimize makespan on two related machines (Q1866010) (← links)
• New lower and upper bounds for on-line scheduling (Q1892104) (← links)
• Scheduling In the random-order model (Q1979454) (← links)
• A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model (Q2079980) (← links)
• New results on competitive analysis of online SRPT scheduling (Q2080035) (← links)
• Online scheduling with migration on two hierarchical machines (Q2091110) (← links)
• On scheduling inclined jobs on multiple two-stage flowshops (Q2319904) (← links)
• Online makespan minimization with parallel schedules (Q2362356) (← links)
• Separating online scheduling algorithms with the relative worst order ratio (Q2385472) (← links)
• On the value of job migration in online makespan minimization (Q2408930) (← links)
• Improved algorithm for a generalized on-line scheduling problem on identical machines (Q2432940) (← links)
• On Approximation Algorithms for Two-Stage Scheduling Problems (Q4632219) (← links)
• Parallel Machine Scheduling with Uncertain Communication Delays (Q4809662) (← links)
• On two dimensional packing (Q5054823) (← links)
• Randomized algorithms for that ancient scheduling problem (Q5096939) (← 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)
• Semi-online scheduling with decreasing job sizes (Q5929138) (← links)
• Preemptive multiprocessor scheduling with rejection (Q5958131) (← links)
• On-line load balancing of temporary tasks revisited (Q5958311) (← links)
• On-line bin-stretching (Q5958712) (← links)
• An optimal online algorithm for scheduling two machines with release times (Q5958718) (← links)
• An on-line algorithm for some uniform processor Scheduling (Q6085762) (← links)
• Machine covering in the random-order model (Q6103518) (← links)