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




Related Items



Cites Work


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