Algorithms – ESA 2005

DOI10.1007/11561071zbMath1162.90451OpenAlexW2501059503MaRDI QIDQ5475867

Klaus Jansen, Sergey Sevast'janov, Aleksei V. Fishkin, R. A. Sitters

Publication date: 27 June 2006

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

Full work available at URL: https://doi.org/10.1007/11561071

zbMATH Keywords

schedulingidentical machinespreemptionmigration delay

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (3)

Parallel machine scheduling problem with preemptive jobs and transportation delay ⋮ Scheduling on parallel machines with preemption and transportation delays ⋮ Preemptive scheduling in the presence of transportation times

This page was built for publication: Algorithms – ESA 2005