Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

A PTAS for Scheduling Unrelated Machines of Few Different Types

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

DOI10.1007/978-3-662-49192-8_24zbMATH Open1442.90073OpenAlexW2403178671MaRDI QIDQ5890526FDOQ5890526

Jan Clemens Gehrke, Stefan E. J. Kraft, Klaus Jansen, Jakob Schikowski

Publication date: 10 March 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://macau.uni-kiel.de/receive/macau_mods_00002002




Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)



Cited In (4)

  • An EPTAS for scheduling on unrelated machines of few different types
  • A Family of Scheduling Algorithms for Hybrid Parallel Platforms
  • A unified framework for designing EPTAS for load balancing on parallel machines
  • Quantum annealing to solve the unrelated parallel machine scheduling problem






This page was built for publication: A PTAS for Scheduling Unrelated Machines of Few Different Types

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5890526&oldid=15689775"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 16:55. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki