Minimizing the sum of weighted completion times in a concurrent open shop
type: Item
instance of: scholarly article
title: Minimizing the sum of weighted completion times in a concurrent open shop
zbMATH Open document ID: 1202.90139
author: Monaldo Mastrolilli
author: Maurice Queyranne
author: Andreas S. Schulz
author: Ola Svensson
author: Nelson A. Uhan
published in: Operations Research Letters
publication date: 2010-12-20T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5828169
zbMATH Keywords: scheduling
zbMATH Keywords: integrality gap
zbMATH Keywords: approximation algorithm
zbMATH Keywords: hardness of approximation
MaRDI profile type: MaRDI publication profile
full work available at URL: j.orl.2010.04.011
OpenAlex ID: W1982055457
cites work: Coordinated scheduling of customer orders for quick response
cites work: Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
cites work: A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover
cites work: Order Scheduling Models: Hardness and Algorithms
cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
cites work: On the power of unique 2-prover 1-round games
cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
cites work: Q5365139
cites work: Order scheduling in an environment with dedicated resources in parallel
cites work: Scheduling orders for multiple product types to minimize total weighted completion time
cites work: Structure of a simple scheduling polyhedron
cites work: A note on the complexity of the concurrent open shop problem
cites work: Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds
cites work: Open shops with jobs overlap
DOI: 10.1016/J.ORL.2010.04.011
description: scientific article; zbMATH DE number 5828169