Starting time minimization for the maximum job variant

DOI10.1016/J.DAM.2021.10.013zbMATH Open1479.90087OpenAlexW3208486131MaRDI QIDQ2057591FDOQ2057591

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

Recommendations

• scientific article; zbMATH DE number 1947413
• Minimizing the maximum starting time on-line
• Online single machine scheduling to minimize the maximum starting time
• On the value of job migration in online makespan minimization
• On the value of job migration in online makespan minimization

zbMATH Keywords

competitive analysisschedulingload balancingmultiprocessor

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Title not available (Why is that?)
• Mathematical Foundations of Computer Science 2003
• Online minimization of the maximum starting time: migration helps
• Scheduling start time dependent jobs to minimize the total weighted completion time
• Minimizing the maximum starting time on-line

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)