Inapproximability results for no-wait job shop scheduling
Operations Research Letters
On Eulerian extensions and their application to no-wait flowshop scheduling
Journal of Scheduling
Hi-index | 0.00 |
For any positive integers r and n, let H(r,n) denote the family of graphs on n vertices with maximum degree r, and let H(r,n,n) denote the family of bipartite graphs H on 2n vertices with n vertices in each vertex class, and with maximum degree r. On ...