Starting time minimization for the maximum job variant
type: Item
instance of: scholarly article
title: Starting time minimization for the maximum job variant
zbMATH Open document ID: 1479.90087
author: Leah Epstein
author: Asaf Levin
published in: Discrete Applied Mathematics
publication date: 2021-12-07T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7439551
zbMATH Keywords: scheduling
zbMATH Keywords: load balancing
zbMATH Keywords: competitive analysis
zbMATH Keywords: multiprocessor
MaRDI profile type: Publication
full work available at URL: j.dam.2021.10.013
OpenAlex ID: W3208486131
cites work: On-Line Load Balancing for Related Machines
cites work: Fully dynamic bin packing revisited
cites work: Bounds for List Schedules on Uniform Processors
cites work: A lower bound on deterministic online algorithms for scheduling on related machines without preemption
cites work: A survey on makespan minimization in semi-online environments
cites work: Asymptotic fully polynomial approximation schemes for variants of open-end bin packing
cites work: Robust approximation schemes for cube packing
cites work: Randomized on-line scheduling on two uniform machines
cites work: Minimizing the maximum starting time on-line
cites work: Approximation schemes for the min-max starting time problem
cites work: Q3031924
cites work: On-line scheduling revisited
cites work: Bounds for Certain Multiprocessing Anomalies
cites work: A note on an open-end bin packing problem
cites work: An On-Line Algorithm for Some Uniform Processor Scheduling
cites work: Online Single Machine Scheduling to Minimize the Maximum Starting Time
cites work: Online Scheduling with Bounded Migration
cites work: Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures
cites work: Parameterized on-line open-end bin packing
DOI: 10.1016/J.DAM.2021.10.013
description: scientific article; zbMATH DE number 7439551