scientific article
From MaRDI portal
Publication:3031924
zbMath0689.68051MaRDI QIDQ3031924
Ulrich Faigle, György Turán, Walter Kern
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
A better lower bound for on-line scheduling, A survey on makespan minimization in semi-online environments, Online makespan minimization with parallel schedules, A lower bound for randomized on-line multiprocessor scheduling, Scheduling with testing on multiple identical parallel machines, Online makespan minimization with budgeted uncertainty, A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer, Semi on-line scheduling on three processors with known sum of the tasks, List's worst-average-case or WAC ratio, A note on on-line scheduling with partial information, Online parallel machines scheduling with two hierarchies, New lower and upper bounds for on-line scheduling, Tight upper bounds for semi-online scheduling on two uniform machines with known optimum, Separating online scheduling algorithms with the relative worst order ratio, An Optimal Preemptive Algorithm for Online MapReduce Scheduling on Two Parallel Machines, Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence, Approximation and online algorithms for multidimensional bin packing: a survey, Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing, On the value of job migration in online makespan minimization, Semi-online scheduling problems on two identical machines with inexact partial information, Randomized algorithms for that ancient scheduling problem, An on-line scheduling problem of parallel machines with common maintenance time, Semi-online scheduling problems on a small number of machines, Lower bounds for online makespan minimization on a small number of related machines, Multiprofessor scheduling, Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties, Improved upper bounds for online malleable job scheduling, Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time, Parallel solutions for preemptive makespan scheduling on two identical machines, Machine covering in the random-order model, Improved approximation algorithms for multiprocessor scheduling with testing, Online early work maximization on three hierarchical machines with a common due date, The constrained parallel-machine scheduling problem with divisible processing times and penalties, Online MapReduce processing on two identical parallel machines, Online malleable job scheduling for \(m\leq 3\), An efficient algorithm for semi-online multiprocessor scheduling with given total processing time, Semi-online scheduling revisited, Tight Bounds for Online Vector Scheduling, Online scheduling with rejection and withdrawal, Optimal on-line algorithms to minimize makespan on two machines with resource augmentation, An efficient algorithm for bin stretching, Online scheduling with reassignment, Scheduling In the random-order model, Online Makespan Scheduling with Job Migration on Uniform Machines, Competitive online scheduling of perfectly malleable jobs with setup times, On-line scheduling of parallel jobs on two machines, More on online bin packing with two item sizes, Algorithms better than LPT for semi-online scheduling with decreasing processing times, Semi-online scheduling with decreasing job sizes, On the optimality of list scheduling for online uniform machines scheduling, Semi-on-line scheduling problems for maximizing the minimum machine completion time, Semi-online scheduling with known partial information about job sizes on two identical machines, Semi-on-line multiprocessor scheduling with given total processing time, Worst-case analysis for on-line service policies, Online scheduling with a buffer on related machines, Several semi-online scheduling problems on two identical machines with combined information, Batched bin packing, Improved bounds for online scheduling with eligibility constraints, Load balancing of temporary tasks in the \(\ell _{p}\) norm, Pseudo lower bounds for online parallel machine scheduling, On-line scheduling of multi-core processor tasks with virtualization, Preemptive multiprocessor scheduling with rejection, On-line bin-stretching, An optimal online algorithm for scheduling two machines with release times, Semi-online scheduling with combined information on two identical machines in parallel, Online scheduling of jobs with favorite machines, An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time, Extension of algorithm list scheduling for a semi-online scheduling problem, Minimum partition of an independence system into independent sets, Semi on-line algorithms for the partition problem, Starting time minimization for the maximum job variant, Online Order Scheduling Problem with the Same Order Size on Two Identical Machines, Online makespan scheduling with job migration on uniform machines, Online scheduling on three uniform machines, The optimal on-line parallel machine scheduling, Tight lower bounds for semi-online scheduling on two uniform machines with known optimum, Semi-online scheduling jobs with tightly-grouped processing times on three identical machines, On-line booking policies and competitive analysis of medical examination in hospital, Coloring inductive graphs on-line, Some recent results in the analysis of greedy algorithms for assignment problems, General bounds for incremental maximization
