Semi-online scheduling: a survey (Q2669808)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Semi-online scheduling: a survey	scientific article

Statements

scholarly article

0 references

Semi-online scheduling: a survey (English)

0 references

Debasis Dwibedy

0 references

0 references

Computers \& Operations Research

0 references

publication date

9 March 2022

0 references

full work available at URL

https://arxiv.org/abs/2005.08614

0 references

zbMATH Keywords

competitive ratio

0 references

extra piece of information

0 references

load balancing

0 references

makespan

0 references

online algorithm

0 references

parallel machines

0 references

semi-online scheduling

0 references

MaRDI profile type

MaRDI publication profile

0 references

Recent Advances for a Classical Scheduling Problem

0 references

Semi-online scheduling revisited

0 references

Online makespan minimization with parallel schedules

0 references

On the value of job migration in online makespan minimization

0 references

Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks

0 references

The on-line multiprocessor scheduling problem with known sum of the tasks

0 references

Geometric representation for semi on-line scheduling on uniform processors

0 references

Semi-on-line scheduling on two parallel processors with an upper bound on the items

0 references

0 references

Semi on-line scheduling on three processors with known sum of the tasks

0 references

Semi-online scheduling on two uniform processors

0 references

On-line bin-stretching

0 references

On-Line Load Balancing for Related Machines

0 references

A two-phase algorithm for bin stretching with stretching factor 1.5

0 references

Semi-online scheduling on two uniform machines with the known largest size

0 references

Several semi-online scheduling problems on two identical machines with combined information

0 references

Online scheduling with reassignment on two uniform machines

0 references

Semi-online scheduling with bounded job sizes on two uniform machines

0 references

Semi-online scheduling with known partial information about job sizes on two identical machines

0 references

Semi-online scheduling with combined information on two identical machines in parallel

0 references

SEMI-ON-LINE PARALLEL MACHINES SCHEDULING UNDER KNOWN TOTAL AND LARGEST PROCESSING TIMES

0 references

The hierarchical model for load balancing on two machines

0 references

Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs

0 references

Semi-online machine covering for two uniform machines

0 references

Semi-online scheduling on two identical machines with a common due date to maximize total early work

0 references

Optimal algorithms for online scheduling with bounded rearrangement at the end

0 references

New lower and upper bounds for on-line scheduling

0 references

An optimal algorithm for preemptive on-line scheduling

0 references

Semi-online hierarchical scheduling problems with buffer or rearrangements

0 references

Semi-on-line multiprocessor scheduling with given total processing time

0 references

Algorithms better than LPT for semi-online scheduling with decreasing processing times

0 references

Approximation algorithms in batch processing

0 references

ONLINE MINIMUM MAKESPAN SCHEDULING WITH A BUFFER

0 references

Preemptive Online Scheduling with Reordering

0 references

Online scheduling with a buffer on related machines

0 references

Tight lower bounds for semi-online scheduling on two uniform machines with known optimum

0 references

Semi-online algorithms for parallel machine scheduling problems

0 references

An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time

0 references

Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling

0 references

Online scheduling with rearrangement on two related machines

0 references

Optimal preemptive semi-online scheduling on two uniform processors

0 references

Preemptive online scheduling: Optimal algorithms for all speeds

0 references

Semi-online preemptive scheduling: one algorithm for all variants

0 references

A lower bound on deterministic online algorithms for scheduling on related machines without preemption

0 references

Online Makespan Scheduling with Job Migration on Uniform Machines

0 references

The Power of Reordering for Online Minimum Makespan Scheduling

0 references

Bin stretching revisited

0 references

Tight bounds for bandwidth allocation on two links

0 references

A survey on makespan minimization in semi-online environments

0 references

Semi-online scheduling with ``end of sequence'' information

0 references

Optimal preemptive semi-online scheduling to minimize makespan on two related machines

0 references

Optimal non-preemptive semi-online scheduling on two related machines

0 references

Optimal on-line algorithms to minimize makespan on two machines with resource augmentation

0 references

Max-min Online Allocations with a Reordering Buffer

0 references

Combining request scheduling with web caching

0 references

On-line scheduling revisited

0 references

Improved lower bounds for the online bin stretching problem

0 references

Online bin stretching with bunch techniques

0 references

Bounds for Certain Multiprocessing Anomalies

0 references

Bounds on Multiprocessing Timing Anomalies

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

Semi-on-line scheduling problems for maximizing the minimum machine completion time

0 references

Semi-online scheduling jobs with tightly-grouped processing times on three identical machines

0 references

Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines

0 references

Ordinal on-line scheduling for maximizing the minimum machine completion time

0 references

Semi on-line scheduling on two identical machines

0 references

Preemptive semi-online algorithms for parallel machine scheduling with known total size

0 references

Online and semi-online hierarchical scheduling for load balancing on uniform machines

0 references

Parallel machine scheduling under a grade of service provision

0 references

0 references

Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information

0 references

Optimal online algorithms for scheduling on two identical machines under a grade of service

0 references

An efficient algorithm for bin stretching

0 references

An efficient algorithm for semi-online multiprocessor scheduling with given total processing time

0 references

Semi on-line algorithms for the partition problem

0 references

Online Minimum Makespan Scheduling with a Buffer

0 references

Semi-online scheduling problems on a small number of machines

0 references

Semi-online scheduling for jobs with release times

0 references

Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times

0 references

Ordinal algorithms for parallel machine scheduling

0 references

Online scheduling on two uniform machines to minimize the makespan

0 references

Semi-online scheduling problems on two uniform machines under a grade of service provision

0 references

Semi-online hierarchical load balancing problem with bounded processing times

0 references

A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection

0 references

Optimal semi-online algorithm for scheduling with rejection on two uniform machines

0 references

Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines

0 references

Two semi-online scheduling problems on two uniform machines

0 references

Online and semi-online scheduling of two machines under a grade of service provision

0 references

Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements

0 references

Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing

0 references

Semi-online scheduling with decreasing job sizes

0 references

Improved semi-online makespan scheduling with a reordering buffer

0 references

Semi-online machine covering on two uniform machines with known total size

0 references

Semi-on-line scheduling with ordinal data on two uniform machines

0 references

Semi-on-line problems on two identical machines with combined partial information

0 references

Semi-online scheduling problems on two identical machines with inexact partial information

0 references

Optimal semi-online algorithms for machine covering

0 references

Online scheduling with reassignment

0 references

A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times

0 references

Amortized Computational Complexity

0 references

0 references

Optimal Semi-online Scheduling Algorithms on a Small Number of Machines

0 references

Machine covering with combined partial information

0 references

Semi-online Machine Covering on Two Hierarchical Machines with Known Total Size of Low-Hierarchy Jobs

0 references

Semi-online scheduling with machine cost.

0 references

Best semi-online algorithms for unbounded parallel batch scheduling

0 references

A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer

0 references

On-line algorithms for minimizing makespan on batch processing machines

0 references

A note on on-line scheduling with partial information

0 references

Optimal online algorithms on two hierarchical machines with tightly-grouped processing times

0 references

Identifiers

10.1016/j.cor.2021.105646

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2669808

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2669808&oldid=36775743"