Pages that link to "Item:Q4268892"

The following pages link to Better Bounds for Online Scheduling (Q4268892):

Displaying 50 items.

• An on-line scheduling problem of parallel machines with common maintenance time (Q394448) (← links)
• Improved semi-online makespan scheduling with a reordering buffer (Q396624) (← links)
• Semi-online scheduling problems on a small number of machines (Q398877) (← 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 scheduling with rejection and reordering: exact algorithms for unit size jobs (Q489737) (← links)
• On-line hierarchical job scheduling on grids with admissible allocation (Q600844) (← links)
• Online hierarchical scheduling: an approach using mathematical programming (Q621843) (← links)
• Online scheduling with rearrangement on two related machines (Q627161) (← links)
• Online scheduling with rejection and withdrawal (Q650898) (← 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)
• Semi on-line scheduling on three processors with known sum of the tasks (Q835557) (← links)
• List's worst-average-case or WAC ratio (Q835596) (← links)
• Scheduling resource allocation with timeslot penalty for changeover (Q861274) (← links)
• Scheduling web advertisements: a note on the minspace problem (Q880489) (← links)
• Scheduling parallel jobs to minimize the makespan (Q880560) (← 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)
• 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)
• Tight upper bounds for semi-online scheduling on two uniform machines with known optimum (Q1642847) (← links)
• Improved lower bounds for online scheduling to minimize total stretch (Q1680548) (← links)
• Multiprofessor scheduling (Q1686063) (← links)
• On the on-line maintenance scheduling problem (Q1744635) (← links)
• Semi-on-line scheduling on two parallel processors with an upper bound on the items (Q1762979) (← links)
• Minimizing the maximum starting time on-line (Q1763375) (← links)
• Delayed information and action in on-line algorithms (Q1854463) (← 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)
• New results on competitive analysis of online SRPT scheduling (Q2080035) (← links)
• Online load balancing with general reassignment cost (Q2157902) (← links)
• Online scheduling of jobs with favorite machines (Q2289948) (← links)
• On scheduling inclined jobs on multiple two-stage flowshops (Q2319904) (← links)
• Tight lower bounds for semi-online scheduling on two uniform machines with known optimum (Q2323435) (← links)
• Online makespan minimization with parallel schedules (Q2362356) (← links)
• Separating online scheduling algorithms with the relative worst order ratio (Q2385472) (← links)
• Improved lower bounds for the online bin stretching problem (Q2399609) (← links)
• Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
• On the value of job migration in online makespan minimization (Q2408930) (← links)
• Rejecting jobs to minimize load and maximum flow-time (Q2409575) (← links)
• Improved algorithm for a generalized on-line scheduling problem on identical machines (Q2432940) (← links)
• Load balancing of temporary tasks in the \(\ell _{p}\) norm (Q2503355) (← links)
• 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)