A survey on makespan minimization in semi-online environments
type: Item
instance of: scholarly article
title: A survey on makespan minimization in semi-online environments
zbMATH Open document ID: 1406.90041
author: Leah Epstein
published in: Journal of Scheduling
publication date: 2018-11-07T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68W27
zbMATH DE Number: 6974902
zbMATH Keywords: competitive ratio
zbMATH Keywords: semi-online algorithms
zbMATH Keywords: bin stretching
zbMATH Keywords: reassignment
zbMATH Keywords: known total size
zbMATH Keywords: reordering buffers
MaRDI profile type: Publication
full work available at URL: s10951-018-0567-z
OpenAlex ID: W2797898895
cites work: On randomized online scheduling
cites work: Recent Advances for a Classical Scheduling Problem
cites work: Better Bounds for Online Scheduling
cites work: Semi-online scheduling revisited
cites work: On the value of job migration in online makespan minimization
cites work: Online makespan minimization with parallel schedules
cites work: Improved bounds for on-line load balancing
cites work: Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks
cites work: The on-line multiprocessor scheduling problem with known sum of the tasks
cites work: Semi on-line scheduling on three processors with known sum of the tasks
cites work: Semi-on-line scheduling on two parallel processors with an upper bound on the items
cites work: Q5387663
cites work: Semi-online scheduling on two uniform processors
cites work: On-line routing of virtual circuits with applications to load balancing and machine scheduling
cites work: On-line bin-stretching
cites work: New algorithms for related machines with temporary jobs.
cites work: New algorithms for an ancient scheduling problem.
cites work: A better lower bound for on-line scheduling
cites work: On-Line Load Balancing for Related Machines
cites work: Online bin stretching with three bins
cites work: A two-phase algorithm for bin stretching with stretching factor 1.5
cites work: Weighted Online Problems with Advice
cites work: Semi-online scheduling on two uniform machines with the known largest size
cites work: Several semi-online scheduling problems on two identical machines with combined information
cites work: Online scheduling with reassignment on two uniform machines
cites work: Semi-online scheduling with known maximum job size on two uniform machines
cites work: Semi-online scheduling with bounded job sizes on two uniform machines
cites work: Semi-online scheduling with known partial information about job sizes on two identical machines
cites work: Semi-online scheduling with combined information on two identical machines in parallel
cites work: A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling"
cites work: Semi-on-line multiprocessor scheduling with given total processing time
cites work: Algorithms better than LPT for semi-online scheduling with decreasing processing times
cites work: A new algorithm for online uniform-machine scheduling to minimize the makespan
cites work: Optimal algorithms for online scheduling with bounded rearrangement at the end
cites work: New lower and upper bounds for on-line scheduling
cites work: Bounds for List Schedules on Uniform Processors
cites work: Online minimum makespan scheduling with a buffer
cites work: Scheduling Independent Tasks on Uniform Processors
cites work: Online Makespan Scheduling with Sublinear Advice
cites work: General parametric scheme for the online uniform machine scheduling problem with two different speeds
cites work: Online scheduling with a buffer on related machines
cites work: Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
cites work: Semi-online algorithms for parallel machine scheduling problems
cites work: Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling
cites work: Online scheduling with rearrangement on two related machines
cites work: Optimal and online preemptive scheduling on uniformly related machines
cites work: Semi-online preemptive scheduling: one algorithm for all variants
cites work: A lower bound on deterministic online algorithms for scheduling on related machines without preemption
cites work: The Power of Reordering for Online Minimum Makespan Scheduling
cites work: Bin stretching revisited
cites work: Optimal non-preemptive semi-online scheduling on two related machines
cites work: Randomized on-line scheduling on two uniform machines
cites work: Semi-online scheduling with ``end of sequence'' information
cites work: Q3031924
cites work: On-line scheduling revisited
cites work: Tighter Bounds for LPT Scheduling on Uniform Processors
cites work: Improved lower bounds for the online bin stretching problem
cites work: Online bin stretching with bunch techniques
cites work: An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
cites work: On robust online scheduling algorithms

A survey on makespan minimization in semi-online environments (cites work)
cites work: Bounds for LPT Schedules on Uniform Processors

A survey on makespan minimization in semi-online environments (cites work)
cites work: Q4952670

A survey on makespan minimization in semi-online environments (cites work)
cites work: Bounds for Certain Multiprocessing Anomalies

A survey on makespan minimization in semi-online environments (cites work)
cites work: Bounds on Multiprocessing Timing Anomalies

A survey on makespan minimization in semi-online environments (cites work)
cites work: On the optimality of list scheduling for online uniform machines scheduling

A survey on makespan minimization in semi-online environments (cites work)
cites work: The optimal on-line parallel machine scheduling

A survey on makespan minimization in semi-online environments (cites work)
cites work: Semi-online scheduling jobs with tightly-grouped processing times on three identical machines

A survey on makespan minimization in semi-online environments (cites work)
cites work: Extension of algorithm list scheduling for a semi-online scheduling problem

A survey on makespan minimization in semi-online environments (cites work)
cites work: Semi on-line scheduling on two identical machines

A survey on makespan minimization in semi-online environments (cites work)
cites work: Lower bounds for online makespan minimization on a small number of related machines

A survey on makespan minimization in semi-online environments (cites work)
cites work: A Better Algorithm for an Ancient Scheduling Problem

A survey on makespan minimization in semi-online environments (cites work)
cites work: An efficient algorithm for bin stretching

A survey on makespan minimization in semi-online environments (cites work)
cites work: An efficient algorithm for semi-online multiprocessor scheduling with given total processing time

A survey on makespan minimization in semi-online environments (cites work)
cites work: Semi on-line algorithms for the partition problem

A survey on makespan minimization in semi-online environments (cites work)
cites work: Algorithms – ESA 2005

A survey on makespan minimization in semi-online environments (cites work)
cites work: Tighter approximation bounds for LPT scheduling in two special cases

A survey on makespan minimization in semi-online environments (cites work)
cites work: New approximation bounds for LPT scheduling

A survey on makespan minimization in semi-online environments (cites work)
cites work: Makespan minimization in online scheduling with machine eligibility

A survey on makespan minimization in semi-online environments (cites work)
cites work: Semi-online scheduling problems on a small number of machines

A survey on makespan minimization in semi-online environments (cites work)
cites work: An On-Line Algorithm for Some Uniform Processor Scheduling

A survey on makespan minimization in semi-online environments (cites work)
cites work: Ordinal algorithms for parallel machine scheduling

A survey on makespan minimization in semi-online environments (cites work)
cites work: Online scheduling on two uniform machines to minimize the makespan

A survey on makespan minimization in semi-online environments (cites work)
cites work: Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines

A survey on makespan minimization in semi-online environments (cites work)
cites work: A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines

A survey on makespan minimization in semi-online environments (cites work)
cites work: Nonclairvoyant scheduling

A survey on makespan minimization in semi-online environments (cites work)
cites work: Competitive ratio of list scheduling on uniform machines and randomized heuristics

A survey on makespan minimization in semi-online environments (cites work)
cites work: Two semi-online scheduling problems on two uniform machines

A survey on makespan minimization in semi-online environments (cites work)
cites work: Online algorithms with advice for bin packing and scheduling problems

A survey on makespan minimization in semi-online environments (cites work)
cites work: Improved Bounds for the Online Scheduling Problem

A survey on makespan minimization in semi-online environments (cites work)
cites work: Online Scheduling with Bounded Migration

A survey on makespan minimization in semi-online environments (cites work)
cites work: A theory and algorithms for combinatorial reoptimization

A survey on makespan minimization in semi-online environments (cites work)
cites work: Semi-online scheduling with decreasing job sizes

A survey on makespan minimization in semi-online environments (cites work)
cites work: Scheduling Parallel Machines On-Line

A survey on makespan minimization in semi-online environments (cites work)
cites work: Improved semi-online makespan scheduling with a reordering buffer

A survey on makespan minimization in semi-online environments (cites work)
cites work: Semi-on-line scheduling with ordinal data on two uniform machines

A survey on makespan minimization in semi-online environments (cites work)
cites work: Semi-on-line problems on two identical machines with combined partial information

A survey on makespan minimization in semi-online environments (cites work)
cites work: Semi-online scheduling problems on two identical machines with inexact partial information

A survey on makespan minimization in semi-online environments (cites work)
cites work: Pseudo lower bounds for online parallel machine scheduling

A survey on makespan minimization in semi-online environments (cites work)
cites work: Online scheduling with reassignment

A survey on makespan minimization in semi-online environments (cites work)
cites work: Online scheduling with one rearrangement at the end: revisited

A survey on makespan minimization in semi-online environments (cites work)
cites work: Load Balancing for Response Time

A survey on makespan minimization in semi-online environments (cites work)
cites work: Optimal Semi-online Scheduling Algorithms on a Small Number of Machines

A survey on makespan minimization in semi-online environments (cites work)
cites work: A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer

A survey on makespan minimization in semi-online environments (cites work)
cites work: A note on on-line scheduling with partial information

A survey on makespan minimization in semi-online environments (DOI)
DOI: 10.1007/S10951-018-0567-Z