Loading...
Please wait, while we are loading the content...
Similar Documents
Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme (2003)
| Content Provider | CiteSeerX |
|---|---|
| Author | Sviridenko, M. |
| Abstract | We investigate the approximability of no-wait permutation flow shop scheduling problem under the makespan criterion. We present a polynomial time approximation scheme (PTAS) for problem on any fixed number of machines. 1 |
| File Format | |
| Journal | SIAM J. Discret. Math |
| Language | English |
| Publisher Date | 2003-01-01 |
| Access Restriction | Open |
| Subject Keyword | Polynomial Time Approximation Scheme Makespan Minimization No-wait Flow Shop Makespan Criterion Fixed Number No-wait Permutation Flow Shop |
| Content Type | Text |
| Resource Type | Article |