A (2+ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective

DOI10.1016/S0196-6774(02)00251-1zbMath1030.68105OpenAlexW2090986925MaRDI QIDQ4806607

Maurice Queyranne, M. I. Sviridenko

Publication date: 14 May 2003

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0196-6774(02)00251-1

zbMATH Keywords

preemptive open shop problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (7)

Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints ⋮ Properties of optimal schedules in preemptive shop scheduling ⋮ On a local protocol for concurrent file transfers ⋮ Approximability of average completion time scheduling on unrelated machines ⋮ Preemptive and non-preemptive generalized min sum set cover ⋮ Unnamed Item ⋮ Combinatorial algorithms for data migration to minimize average completion time

This page was built for publication: A (2+ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective