Pages that link to "Item:Q4876699"

The following pages link to A Better Algorithm for an Ancient Scheduling Problem (Q4876699):

Displayed 41 items.

• Semi-online scheduling problems on a small number of machines (Q398877) ‎ (← links)
• Semi-online scheduling revisited (Q442235) ‎ (← links)
• Online scheduling with rejection and reordering: exact algorithms for unit size jobs (Q489737) ‎ (← links)
• Online scheduling with rearrangement on two related machines (Q627161) ‎ (← 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)
• Optimal on-line algorithms to minimize makespan on two machines with resource augmentation (Q927393) ‎ (← links)
• Extension of algorithm list scheduling for a semi-online scheduling problem (Q1011847) ‎ (← links)
• Semi on-line algorithms for the partition problem (Q1267197) ‎ (← links)
• The optimal on-line parallel machine scheduling (Q1568731) ‎ (← links)
• On-line scheduling revisited (Q1592757) ‎ (← links)
• A manifesto for the computational method (Q1603721) ‎ (← 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)
• Minimizing the maximum starting time on-line (Q1763375) ‎ (← links)
• Scheduling In the random-order model (Q1979454) ‎ (← links)
• Online makespan scheduling with job migration on uniform machines (Q2067667) ‎ (← links)
• A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model (Q2079980) ‎ (← links)
• Online scheduling of jobs with favorite machines (Q2289948) ‎ (← 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)
• Load balancing of temporary tasks in the \(\ell _{p}\) norm (Q2503355) ‎ (← links)
• Semi-online scheduling jobs with tightly-grouped processing times on three identical machines (Q2565855) ‎ (← 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)
• Tight Bounds for Online Vector Scheduling (Q4620410) ‎ (← links)
• (Q5009506) ‎ (← links)
• Online Makespan Scheduling with Job Migration on Uniform Machines (Q5009583) ‎ (← 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)
• On-line algorithms for packing rectangles into several strips (Q5439071) ‎ (← links)
• Semi-online scheduling with decreasing job sizes (Q5929138) ‎ (← links)
• Preemptive multiprocessor scheduling with rejection (Q5958131) ‎ (← links)
• An optimal online algorithm for scheduling two machines with release times (Q5958718) ‎ (← links)
• Machine covering in the random-order model (Q6103518) ‎ (← links)