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

DOI10.1016/S0196-6774(02)00251-1zbMATH Open1030.68105OpenAlexW2090986925MaRDI QIDQ4806607FDOQ4806607

Authors: Maurice Queyranne, Maxim 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

Recommendations

• scientific article; zbMATH DE number 1757967
• Approximation algorithms for shop scheduling problems with minsum objective
• Publication:4952712
• Scheduling two-machine preemptive open shops to minimize total completion time
• Minimizing the sum of weighted completion times in a concurrent open shop

zbMATH Keywords

preemptive open shop problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cited In (11)

• Minimizing the sum of weighted completion times in a concurrent open shop
• Title not available (Why is that?)
• Title not available (Why is that?)
• Preemptive and non-preemptive generalized min sum set cover
• Properties of optimal schedules in preemptive shop scheduling
• Matroid coflow scheduling
• On a local protocol for concurrent file transfers
• Approximation algorithms for shop scheduling problems with minsum objective
• Combinatorial algorithms for data migration to minimize average completion time
• Approximability of average completion time scheduling on unrelated machines
• Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints

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

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