A survey on makespan minimization in semi-online environments (Q1617278): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10951-018-0567-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2797898895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On randomized online scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent Advances for a Classical Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Bounds for Online Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the value of job migration in online makespan minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online makespan minimization with parallel schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for on-line load balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The on-line multiprocessor scheduling problem with known sum of the tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi on-line scheduling on three processors with known sum of the tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-on-line scheduling on two parallel processors with an upper bound on the items / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387663 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling on two uniform processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line routing of virtual circuits with applications to load balancing and machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line bin-stretching / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms for related machines with temporary jobs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms for an ancient scheduling problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better lower bound for on-line scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-Line Load Balancing for Related Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online bin stretching with three bins / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-phase algorithm for bin stretching with stretching factor 1.5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted Online Problems with Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling on two uniform machines with the known largest size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Several semi-online scheduling problems on two identical machines with combined information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling with reassignment on two uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling with known maximum job size on two uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling with bounded job sizes on two uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling with known partial information about job sizes on two identical machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling with combined information on two identical machines in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling" / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-on-line multiprocessor scheduling with given total processing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms better than LPT for semi-online scheduling with decreasing processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for online uniform-machine scheduling to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms for online scheduling with bounded rearrangement at the end / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower and upper bounds for on-line scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for List Schedules on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: ONLINE MINIMUM MAKESPAN SCHEDULING WITH A BUFFER / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Independent Tasks on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Makespan Scheduling with Sublinear Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: General parametric scheme for the online uniform machine scheduling problem with two different speeds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling with a buffer on related machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight upper bounds for semi-online scheduling on two uniform machines with known optimum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online algorithms for parallel machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling with rearrangement on two related machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal and online preemptive scheduling on uniformly related machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online preemptive scheduling: one algorithm for all variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on deterministic online algorithms for scheduling on related machines without preemption / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Reordering for Online Minimum Makespan Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin stretching revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal non-preemptive semi-online scheduling on two related machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized on-line scheduling on two uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling with ``end of sequence'' information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3031924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter Bounds for LPT Scheduling on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower bounds for the online bin stretching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online bin stretching with bunch techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On robust online scheduling algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for LPT Schedules on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952670 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimality of list scheduling for online uniform machines scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The optimal on-line parallel machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling jobs with tightly-grouped processing times on three identical machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of algorithm list scheduling for a semi-online scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi on-line scheduling on two identical machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for online makespan minimization on a small number of related machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Better Algorithm for an Ancient Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for bin stretching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for semi-online multiprocessor scheduling with given total processing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi on-line algorithms for the partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter approximation bounds for LPT scheduling in two special cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approximation bounds for LPT scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan minimization in online scheduling with machine eligibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling problems on a small number of machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: An On-Line Algorithm for Some Uniform Processor Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinal algorithms for parallel machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling on two uniform machines to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonclairvoyant scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive ratio of list scheduling on uniform machines and randomized heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two semi-online scheduling problems on two uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms with advice for bin packing and scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for the Online Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling with Bounded Migration / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory and algorithms for combinatorial reoptimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling with decreasing job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Parallel Machines On-Line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved semi-online makespan scheduling with a reordering buffer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-on-line scheduling with ordinal data on two uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-on-line problems on two identical machines with combined partial information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling problems on two identical machines with inexact partial information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo lower bounds for online parallel machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling with reassignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling with one rearrangement at the end: revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Load Balancing for Response Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Semi-online Scheduling Algorithms on a Small Number of Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on on-line scheduling with partial information / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 06:44, 17 July 2024

scientific article
Language Label Description Also known as
English
A survey on makespan minimization in semi-online environments
scientific article

    Statements

    A survey on makespan minimization in semi-online environments (English)
    0 references
    0 references
    7 November 2018
    0 references
    competitive ratio
    0 references
    semi-online algorithms
    0 references
    bin stretching
    0 references
    reassignment
    0 references
    known total size
    0 references
    reordering buffers
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers