Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Approximation schemes for the min-max starting time problem

From MaRDI portal
Publication:1762841
Jump to:navigation, search

DOI10.1007/S00236-004-0145-ZzbMath1086.90022OpenAlexW2028821829MaRDI QIDQ1762841

Tamir Tassa, Leah Epstein

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

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


Related Items (3)

Online Single Machine Scheduling to Minimize the Maximum Starting Time ⋮ 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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1762841&oldid=14111783"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 07:30.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki