Approximation schemes for the min-max starting time problem

DOI10.1007/S00236-004-0145-ZMaRDI QIDQ1762841zbMATH OpenOpenAlexFDO

Authors Leah Epstein, Tamir Tassa

Publication date 11 February 2005

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00236-004-0145-z

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Minimax problems in mathematical programming (90C47) Approximation algorithms (68W25)

Recommendations

• Mathematical Foundations of Computer Science 2003
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Approximation schemes for scheduling on parallel machines

Cited in

(6)

• scientific article; zbMATH DE number 1839470 (Why is no real title available?)
• Online single machine scheduling to minimize the maximum starting time
• scientific article; zbMATH DE number 1094167 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2003
• Online minimization of the maximum starting time: migration helps
• Starting time minimization for the maximum job variant

This page was built for publication: Approximation schemes for the min-max starting time problem

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