The following pages link to (Q3031924):
Displaying 50 items.
- A lower bound for randomized on-line multiprocessor scheduling (Q287130) (← links)
- A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer (Q290202) (← links)
- 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)
- Lower bounds for online makespan minimization on a small number of related machines (Q398887) (← links)
- Semi-online scheduling revisited (Q442235) (← links)
- Semi-online scheduling with known partial information about job sizes on two identical machines (Q551204) (← links)
- Semi-on-line multiprocessor scheduling with given total processing time (Q557814) (← links)
- Online scheduling with rejection and withdrawal (Q650898) (← links)
- On the optimality of list scheduling for online uniform machines scheduling (Q694192) (← links)
- Online scheduling with a buffer on related machines (Q711400) (← links)
- Several semi-online scheduling problems on two identical machines with combined information (Q714838) (← links)
- Improved bounds for online scheduling with eligibility constraints (Q719259) (← links)
- Online scheduling on three uniform machines (Q765372) (← 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)
- Online parallel machines scheduling with two hierarchies (Q837151) (← links)
- Semi-online scheduling problems on two identical machines with inexact partial information (Q884466) (← links)
- Improved upper bounds for online malleable job scheduling (Q892840) (← links)
- An efficient algorithm for semi-online multiprocessor scheduling with given total processing time (Q906558) (← links)
- Optimal on-line algorithms to minimize makespan on two machines with resource augmentation (Q927393) (← links)
- Online scheduling with reassignment (Q935241) (← links)
- On-line scheduling of parallel jobs on two machines (Q954945) (← links)
- More on online bin packing with two item sizes (Q955329) (← links)
- On-line scheduling of multi-core processor tasks with virtualization (Q991470) (← links)
- Extension of algorithm list scheduling for a semi-online scheduling problem (Q1011847) (← links)
- Minimum partition of an independence system into independent sets (Q1013303) (← links)
- Semi on-line algorithms for the partition problem (Q1267197) (← links)
- Coloring inductive graphs on-line (Q1312187) (← links)
- Some recent results in the analysis of greedy algorithms for assignment problems (Q1317524) (← links)
- A better lower bound for on-line scheduling (Q1327292) (← links)
- The optimal on-line parallel machine scheduling (Q1568731) (← 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)
- Multiprofessor scheduling (Q1686063) (← links)
- Online MapReduce processing on two identical parallel machines (Q1698073) (← links)
- Algorithms better than LPT for semi-online scheduling with decreasing processing times (Q1758275) (← links)
- Batched bin packing (Q1779689) (← links)
- Pseudo lower bounds for online parallel machine scheduling (Q1785411) (← links)
- A note on on-line scheduling with partial information (Q1886493) (← links)
- New lower and upper bounds for on-line scheduling (Q1892104) (← links)
- Online malleable job scheduling for \(m\leq 3\) (Q1944031) (← links)
- Scheduling In the random-order model (Q1979454) (← links)
- An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time (Q2043022) (← links)
- Starting time minimization for the maximum job variant (Q2057591) (← links)
- Online makespan scheduling with job migration on uniform machines (Q2067667) (← links)
- General bounds for incremental maximization (Q2118105) (← links)
- Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence (Q2165267) (← links)
