Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time
From MaRDI portal
Publication:2892135
DOI10.1002/nav.20484zbMath1241.90045OpenAlexW1977872069MaRDI QIDQ2892135
Chi To Ng, Cheng, T. C. Edwin, Qingqin Nong
Publication date: 18 June 2012
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20484
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Select and permute: an improved online framework for scheduling to minimize weighted completion time ⋮ Iterated greedy algorithms for a complex parallel machine scheduling problem
Cites Work
- Minimizing the sum of weighted completion times in a concurrent open shop
- 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
- Scheduling orders for multiple product types with due date related objectives
- Coordinated scheduling of customer orders for quick response
- On the power of unique 2-prover 1-round games
- Order Scheduling Models: Hardness and Algorithms
- Unnamed Item
This page was built for publication: Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time