Pages that link to "Item:Q1892104"

The following pages link to New lower and upper bounds for on-line scheduling (Q1892104):

Displaying 35 items.

• 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)
• Online scheduling with rejection and reordering: exact algorithms for unit size jobs (Q489737) (← links)
• Online hierarchical scheduling: an approach using mathematical programming (Q621843) (← links)
• Online scheduling with rejection and withdrawal (Q650898) (← 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)
• Improved upper bounds for online malleable job scheduling (Q892840) (← links)
• Restarts can help in the on-line minimization of the maximum delivery time on a single machine (Q1592755) (← 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)
• New lower and upper bounds for on-line scheduling (Q1892104) (← 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)
• Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing (Q2168774) (← links)
• Worst-case analysis for on-line service policies (Q2268767) (← links)
• Improved algorithm for a generalized on-line scheduling problem on identical machines (Q2432940) (← links)
• Semi-online scheduling: a survey (Q2669808) (← links)
• Optimal on-line algorithms for single-machine scheduling (Q4645938) (← links)
• (Q5009506) (← links)
• Online Makespan Scheduling with Job Migration on Uniform Machines (Q5009583) (← 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)
• Randomized on-line scheduling on two uniform machines (Q5937432) (← links)
• Preemptive multiprocessor scheduling with rejection (Q5958131) (← links)
• On-line bin-stretching (Q5958712) (← links)
• An optimal online algorithm for scheduling two machines with release times (Q5958718) (← links)