Starting time minimization for the maximum job variant

DOI10.1016/J.DAM.2021.10.013MaRDI QIDQ2057591zbMATH OpenOpenAlexFDO

Authors Leah Epstein, Asaf Levin

Publication date 7 December 2021

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2021.10.013

zbMATH Keywords

competitive analysisschedulingload balancingmultiprocessor

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 1947413
• Minimizing the maximum starting time on-line
• Online single machine scheduling to minimize the maximum starting time

Cites work

• scientific article; zbMATH DE number 4130003 (Why is no real title available?)
• A lower bound on deterministic online algorithms for scheduling on related machines without preemption
• A note on an open-end bin packing problem
• A survey on makespan minimization in semi-online environments
• An On-Line Algorithm for Some Uniform Processor Scheduling
• Approximation schemes for the min-max starting time problem
• Asymptotic fully polynomial approximation schemes for variants of open-end bin packing
• Bounds for Certain Multiprocessing Anomalies
• Bounds for List Schedules on Uniform Processors
• Fully dynamic bin packing revisited
• Minimizing the maximum starting time on-line
• On-Line Load Balancing for Related Machines
• On-line scheduling revisited
• Online scheduling with bounded migration
• Online single machine scheduling to minimize the maximum starting time
• Parameterized on-line open-end bin packing
• Randomized on-line scheduling on two uniform machines
• Robust approximation schemes for cube packing
• Robust polynomial-time approximation schemes for parallel machine scheduling with job arrivals and departures

Cited in

(5)

• Scheduling start time dependent jobs to minimize the total weighted completion time
• Mathematical Foundations of Computer Science 2003
• Minimizing the maximum starting time on-line
• Online minimization of the maximum starting time: migration helps
• scientific article; zbMATH DE number 1947413 (Why is no real title available?)

This page was built for publication: Starting time minimization for the maximum job variant

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2057591)