Minimizing the sum of weighted completion times in a concurrent open shop
From MaRDI portal
Publication:613333
DOI10.1016/j.orl.2010.04.011zbMath1202.90139OpenAlexW1982055457MaRDI QIDQ613333
Andreas S. Schulz, Ola Svensson, Monaldo Mastrolilli, Nelson A. Uhan, Maurice Queyranne
Publication date: 20 December 2010
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2010.04.011
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time, Minimizing maximum delivery completion time for order scheduling with rejection, Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints, The representation of partially-concurrent open shop problems, A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times, Minimizing the total weighted completion time of fully parallel jobs with integer parallel units, Partially concurrent open shop scheduling with integral preemptions, On scheduling coflows, Scheduling Fully Parallel Jobs with Integer Parallel Units, Unnamed Item, Scheduling distributed clusters of parallel machines : primal-dual and LP-based approximation algorithms, Select and permute: an improved online framework for scheduling to minimize weighted completion time, Scheduling fully parallel jobs, Green scheduling, flows and matchings, Iterated greedy algorithms for a complex parallel machine scheduling problem
Cites Work
- Unnamed Item
- Order scheduling in an environment with dedicated resources in parallel
- A note on the complexity of the concurrent open shop problem
- Scheduling orders for multiple product types to minimize total weighted completion time
- Open shops with jobs overlap
- Structure of a simple scheduling polyhedron
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- Coordinated scheduling of customer orders for quick response
- On the power of unique 2-prover 1-round games
- Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds
- A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover
- Order Scheduling Models: Hardness and Algorithms
