An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables
From MaRDI portal
Publication:3638063
DOI10.1007/978-3-642-02927-1_47zbMath1248.68118OpenAlexW1720023619MaRDI QIDQ3638063
Publication date: 14 July 2009
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://macau.uni-kiel.de/servlets/MCRFileNodeServlet/macau_derivate_00003002/tr-1002-bericht.pdf
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items (1)
This page was built for publication: An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables