Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme (Q4443088)
From MaRDI portal
scientific article; zbMATH DE number 2024368
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme |
scientific article; zbMATH DE number 2024368 |
Statements
Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme (English)
0 references
8 January 2004
0 references
approximation algorithms
0 references
shop scheduling
0 references
